ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The software lookaside buffler reduces search overhead with linked lists
Full text PdfPdf (360 KB)
Source
Communications of the ACM archive
Volume 27 ,  Issue 3  (March 1984) table of contents
Pages: 222 - 227  
Year of Publication: 1984
ISSN:0001-0782
Author
Gerald Bozman  IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 5
Additional Information:

references   cited by   index terms  

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/357994.358020
What is a DOI?

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
Bozman, G., Buco, W., Daly, T., and Tetzlaff, W. Analysis of free storage algorithms--revisited. IBM Syst. J. 23, 1 (Feb. 1984).
 
2
Denning, P.J. Working sets past and present. IEEE Trans. Softw. Eng. 6, 1 (Jan. 1980), 64-84.
 
3
Horowitz, E., and Sahni, S. Fundamentals of Data Structures. Computer Science Press, Rockville, Md., 1976, pp. 106-202.
 
4
IBM Virtual Machine/System Product Introduction. IBM Publication GC19-6200.
 
5
Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
6
Alan Jay Smith, Cache Memories, ACM Computing Surveys (CSUR), v.14 n.3, p.473-530, Sept. 1982  [doi>10.1145/356887.356892]

CITED BY  5
R. P. Brent, Efficient implementation of the first-fit strategy for dynamic storage allocation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.3, p.388-403, July 1989
Dirk Grunwald , Benjamin Zorn , Robert Henderson, Improving the cache locality of memory allocation, ACM SIGPLAN Notices, v.28 n.6, p.177-186, June 1993
Benjamin Zorn , Dirk Grunwald, Evaluating models of memory allocation, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.4 n.1, p.107-131, Jan. 1994
Rodney R. Oldehoeft , Stephen J. Allan, Adaptive exact-fit storage management, Communications of the ACM, v.28 n.5, p.506-511, May 1985
Jeff Bonwick, The slab allocator: an object-caching kernel memory allocator, Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference, p.6-6, June 06-10, 1994, Boston, Massachusetts

INDEX TERMS

Primary Classification:
  B. Hardware
  B.3 MEMORY STRUCTURES
      B.3.2 Design Styles
          Subjects: Cache memories

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.2 Storage Management
          Subjects: Allocation/deallocation strategies
      D.4.3 File Systems Management
          Subjects: Directory structures
      D.4.4 Communications Management
          Subjects: Buffering
      D.4.8 Performance
          Subjects: Simulation

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Lists, stacks, and queues; Arrays
  E.2 DATA STORAGE REPRESENTATIONS
      Subjects: Linked representations

  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching


General Terms:
Algorithms, Design, Performance, Theory


Keywords:
CMS, VM/SP, best fit, first fit, linked lists, looaside buffer


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player