ACM Home Page
Please provide us with feedback. Feedback
Automatic data structure selection: an example and overview
Full text PdfPdf (1.14 MB)
Source
Communications of the ACM archive
Volume 21 ,  Issue 5  (May 1978) table of contents
Pages: 376 - 385  
Year of Publication: 1978
ISSN:0001-0782
Author
James R. Low  The Univ. of Rochester, Rochester, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 41,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359488.359498
What is a DOI?

ABSTRACT

The use of several levels of abstraction has proved to be very helpful in constructing and maintaining programs. When programs are designed with abstract data types such as sets and lists, programmer time can be saved by automating the process of filling in low-level implementation details. In the past, programming systems have provided only a single general purpose implementation for an abstract type. Thus the programs produced using abstract types were often inefficient in space or time. In this paper a system for automatically choosing efficient implementations for abstract types from a library of implementations is discussed. This process is discussed in detail for an example program. General issues in data structure selection are also reviewed.


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
 
2
Allen, F.E. Bibliography on program optimization. Rep. RC5767, IBM T.J. Watson Res. Ctr., Dec. 1975.
 
3
Birtwistle, G. et al. DECSYSTEM-10 SIMULA Language Handbook. Rep. C8398, C8399, Swedish Nat. Defense Res. Inst., Stockholm, Sweden, 1974.
4
 
5
Burstall, R.M., Collins, J.S., and Popplestone, R.J. Programming in POP.2. Edinburgh U. Press, Edinburgh, Scotland, 1971.
 
6
ECL Programmer's Manual. Ctr. Res. Comptng. Tech., Harvard U., Cambridge, Mass., Dec. 1974.
7
 
8
Feldman, J., et al. Recent developments in SAIL-an ALGOL- based language for artificial intelligence. Proc. AFIPS 1972 FJCC, AFIPS Press, Montvale, N.J., pp. 1193-1202.
 
9
Geschke, C.M., and Mitchell, J.G. On the problem of uniform references to data structures. IEEE Trans. Sofiware Eng. SE-1 (June 1975), 207-219.
 
10
 
11
12
13
 
14
Low, J. Automatic Coding: Choice of Data Structures. Interdisciplinary Syst. Res. Rep. 16, Birkha/iser Verlag, Basel, 1976.
15
 
16
 
17
Rovner, P. Automatic representation selection for associative data structures. Ph.D. Th., Harvard U., Cambridge, Mass; Tech. Rep. TR10, U. of Rochester, Rochester, N.Y., Sept. 1976.
 
18
Schwartz, J. Optimization of very high level languages--l: Value transmission and its corollaries. In Computer Languages, Vol. I, Pergamon Press, Elmsford, N.Y., 1975, 161-194.
 
19
20
 
21
Wulf, W.A., London, R.L., and Shaw, M. An introduction to the construction and verification of ALPHARD programs. IEEE Trans. Software Eng. SE-2, 4, (Dec. 1976). 253-265.

CITED BY  12