DocumentCode
996682
Title
Microsystems Minimal Storage Sorting and Searching Techniques for RAM Applications: a Tutorial
Author
Schember, Kurt A. ; Rumsey, John R.
Author_Institution
University of Texas
Volume
10
Issue
6
fYear
1977
fDate
6/1/1977 12:00:00 AM
Firstpage
92
Lastpage
100
Abstract
A large number of sorting and searching techniques, covering a variety of applications, are dealt with in computer science literature. The classical problem associated with these methods has been determining which set of algorithms is most appropriate for a given application. With the recent advances in LSI technology and the assured proliferation of microprocessors and RAM memory, yet another application has evolved. Memory address widths associated with microprocessor systems are limited, in many cases, to a maximum of 16 bits, severely restricting maximum memory size. Minimal storage implementation techniques, characterized by the optimal use of the data space associated with an algorithm, therefore, are most appropriate for these restricted address space environments common to microprocessor systems.
Keywords
Read-write memory; Sorting; Tutorials;
fLanguage
English
Journal_Title
Computer
Publisher
ieee
ISSN
0018-9162
Type
jour
DOI
10.1109/C-M.1977.217752
Filename
1646527
Link To Document