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
Optimum merging from mass storage
Full text PdfPdf (436 KB)
Source
Communications of the ACM archive
Volume 13 ,  Issue 12  (December 1970) table of contents
Pages: 745 - 749  
Year of Publication: 1970
ISSN:0001-0782
Author
Neville A. Black  Computer Sciences Corp., Hunstville, AL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Citation Count: 1
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/362814.362826
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
George U. Hubbard, Some characteristics of sorting computing systems using random access storage devices, Communications of the ACM, v.6 n.5, p.248-255, May 1963  [doi>10.1145/366552.366586]
 
2
Ivan Flores, Computer Sorting, Prentice-Hall, Inc., Upper Saddle River, NJ, 1969
 
3
Kenneth E. Iverson, A Programming Language., John Wiley & Sons, 1962

CITED BY  2
W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
H. Lorin, A guided bibliography to sorting, IBM Systems Journal, v.10 n.3, p.244-254, September 1971

INDEX TERMS

Keywords:
access time, drum-merging, mass storage, merging, optimum merging, sort timing, sorting


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