On the Optimality of the Probability Ranking Scheme in Storage Applications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the Optimality of the Probability Ranking Scheme in Storage Applications

Full text

Pdf (593 KB)

Source

Journal of the ACM (JACM) archive
Volume 20 , Issue 4 (October 1973) table of contents

Pages: 624 - 633

Year of Publication: 1973

ISSN:0004-5411

Authors

P. C. Yue	Computer Science Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York
C. K. Wong	Computer Science Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 24, Citation Count: 17

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/321784.321790 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	Alfred V. Aho , Peter J. Denning , Jeffrey D. Ullman, Principles of Optimal Page Replacement, Journal of the ACM (JACM), v.18 n.1, p.80-93, Jan. 1971 [doi>10.1145/321623.321632]
	2	CHANG, A. Some probabilistic models of storage systems. IBM Rep. RJ 781 ($14436), Nov. 19, 1970.
	3	Peter J. Denning, The working set model for program behavior, Communications of the ACM, v.11 n.5, p.323-333, May 1968 [doi>10.1145/363095.363141]
	4	DENNING, P., SAVAGE, J., AND SPIRN, J. Models for locality in program behavior. Tech. Rep. 107, Dep. of Elec. Eng., Princeton U., Apr. 1972.
	5	GROSSMAN, D., AND SILWmMAN, H.F. Placement of records on a secondary storage device to minimize access time. IBM Res. Rep. RC-3641, Dec. 1971; also, Proc. Sixth Ann. Princeton Conf. on Information Sciences and Systems, March 1972 (to appear).
	6	HATFIELD, D., AND GERALD, J. Program restructuring for virtual memory. IBM Syst. J. 10, 3 (1971), 168-192.
	7	MATTSON, R., GECSEI, J., SLUTZ, D., AND TI~AIGER, i. Evaluation techniques for storage hierarchies. IBM Syst. J. 9, 2 (1970), 78-117.
	8	MARSHALL, A. W., OLKIN, I., AN}:) PROSCHAN, F. Monotonicity of ratios of means and other applications of majorization. In Inequalities, Shisha (Ed.), Academic Press, New York, 1967.
	9	OSTaOWSKI, A. Sur quelques applications des fonctions convenes et concaves au sens de I. Schur. J. Math. Pures Appl. 31 (1952), 253-292.
	10	Gerard. Salton, Automatic Information Organization and Retrieval., McGraw Hill Text, 1968
	11	ScItua, I. Uber ein Klasse von Mittlebildungen mit Anwendungen auf die Determinatentheorie. Sitzber. Berl. Math. Ges. 22 (1923), 9-20.

CITED BY 17

	A. C. McKellar , C. K. Wong, Dynamic Placement of Records in Linear Storage, Journal of the ACM (JACM), v.25 n.3, p.421-434, July 1978
	Manolis M. Tsangaris , Jeffrey F. Naughton, On the performance of object clustering techniques, ACM SIGMOD Record, v.21 n.2, p.144-153, June 1, 1992
	Ronald Fagin, A counterintuitive example of computer paging, Communications of the ACM, v.19 n.2, p.96-97, Feb. 1976
	Ronald Fagin , Malcolm C. Easton, The independence of miss ratio on page size, Journal of the ACM (JACM), v.23 n.1, p.128-146, Jan. 1976
	Daniel Alexander Ford , Stavros Christodoulakis, Optimal placement of high-probability randomly retrieved blocks on CLV optical discs, ACM Transactions on Information Systems (TOIS), v.9 n.1, p.1-30, Jan. 1991
	Manolis M. Tsangaris , Jeffrey F. Naughton, A stochastic approach for clustering in object bases, ACM SIGMOD Record, v.20 n.2, p.12-21, June 1991
	Shahram Ghandeharizadeh , Douglas J. Ierardi, Management of disk space with REBATE, Proceedings of the third international conference on Information and knowledge management, p.304-311, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	C. T. Yu , M. K. Siu , K. Lam , M. Ozsoyoglu, Performance analysis of three related assignment problems, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts
	Elizabeth Jewkes , Chulung Lee , Ray Vickson, Product location, allocation and server home base location for an order picking line with multiple servers, Computers and Operations Research, v.31 n.4, p.623-636, April 2004
	C. K. Wong, Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems, ACM Computing Surveys (CSUR), v.12 n.2, p.167-178, June 1980
	S. Ghandeharizadeh , L. Ramos, Continuous Retrieval of Multimedia Data Using Parallelism, IEEE Transactions on Knowledge and Data Engineering, v.5 n.4, p.658-669, August 1993
	Sarut Vanichpun , Armand M. Makowski, The output of a cache under the independent reference model: where did the locality of reference go?, ACM SIGMETRICS Performance Evaluation Review, v.32 n.1, June 2004
	Elkafi Hassini , Raymond G. Vickson, A two-carousel storage location problem, Computers and Operations Research, v.30 n.4, p.527-539, April 2003
	Eitan Bachmat , Tao Kai Lam , Avner Magen, Analysis of set-up time models: A metric perspective, Theoretical Computer Science, v.401 n.1-3, p.172-180, July, 2008
	Jung Hoon Kim , Yon Dohn Chung , Myoung Ho Kim, An XML data allocation method on disks, Journal of Systems Architecture: the EUROMICRO Journal, v.52 n.10, p.578-588, October 2006
	Daniel Alexander Ford , Stavros Christodoulakis, Optimizing Random Retrievals from CLV format Optical Disks, Proceedings of the 17th International Conference on Very Large Data Bases, p.413-422, September 03-06, 1991
	Carsten A. Gerlhof , Alfons Kemper , Guido Moerkotte, On the cost of monitoring and reorganization of object bases for clustering, ACM SIGMOD Record, v.25 n.3, p.22-27, Sept. 1996