Dynamic Placement of Records in Linear Storage

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dynamic Placement of Records in Linear Storage

Full text

Pdf (598 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 421 - 434

Year of Publication: 1978

ISSN:0004-5411

Authors

A. C. McKellar	IBM Thomas J Watson Research Center, P.O. Box 218, Yorktown Heights, NY
C. K. Wong	IBM Thomas J Watson Research Center, P.O. Box 218, Yorktown Heights, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322077.322085 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	BERGMANS, P P Mm~mlzmg expected travel ttme on geometrtcal patterns by opumal probabdity rearrangements Inform and Control 20 (1972), 331-350
	2	Edward G. Coffman, Jr. , Peter J. Denning, Operating Systems Theory, Prentice Hall Professional Technical Reference, 1973
	3	David D. Grossman , Harvey F. Silverman, Placement of Records on a Secondary Storage Device to Minimize Access Time, Journal of the ACM (JACM), v.20 n.3, p.429-438, July 1973 [doi>10.1145/321765.321775]
	4	IBM CORP. IBM VM/370 lntroducuon File No $370-20, Order No GC20-1800-1, IBM Corp, White Plains, N.Y.
	5	KARP, R.M, MCKELLAR, A C, AND WONG, C K. Near-optimal solutions to a 2-dimensional placement problem. SIAM J. Comptng 4, 3 (1975), 271-286.
	6	PRATT, V.R. An N log N algonthm to distribute N records optimally in a sequential access file In Complexity of Computer Computations, R E Miller and J W. Thatcher, Eds, Plenum Press, New York, 1972, pp 111-118
	7	WHITTAKER, E T ,AND WATSON, G N A Course of Modern Analysts UmversRy Press, Cambridge, England, 1952
	8	P. C. Yue , C. K. Wong, On the Optimality of the Probability Ranking Scheme in Storage Applications, Journal of the ACM (JACM), v.20 n.4, p.624-633, Oct. 1973 [doi>10.1145/321784.321790]
	9	YUE, P C, AND WONG, C K Near-optimal heuristics for an assignment problem in mass storage Int J Comptr and Inform Sct 4, 4 (1975), 281-294