| Multiword list items |
| Full text |
Pdf
(620 KB)
|
Source
|
Communications of the ACM
archive
Volume 7 , Issue 6 (June 1964)
table of contents
COLUMN: Techniques
table of contents
Pages: 357 - 362
Year of Publication: 1964
ISSN:0001-0782
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 20, Citation Count: 8
|
|
|
ABSTRACT
The list concept as originally proposed by Newell, Simon and Shaw specified single computer words as elements of a list. This report describes the use of two or more consecutive words as one element. Such use results in a considerable saving in both the space required to hold a given amount of data, and in the execution time required to perform a given process on the data.Following a brief description of standard list structures with single-word items, the multiword items are introduced. Then variable-length items are described, along with the corresponding space-utilization problems. Finally, several examples are given to illustrate the use of multiword lists.This paper attempts to draw together various recent papers which have applied some of these concepts in different ways, and indicate how they relate to the more general problem.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
NEWELL, A., AND SHAW, J. C. Programming the logic theory machine. Proc. Western Joint Comput. Conf., 1957.
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
NEWELL, A. (Ed.) Information Processing Language---V Manual. Prentice-Hall, 1961.
|
 |
8
|
|
 |
9
|
|
 |
10
|
|
| |
11
|
ILIFFE, J. K., AND JODEIT, J. G. A dynamic storage allocation scheme. Comput. J. (Oct. 1962).
|
|