On broadcast disk paging

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On broadcast disk paging

Full text

Pdf (1.43 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirtieth annual ACM symposium on Theory of computing table of contents

Dallas, Texas, United States

Pages: 634 - 643

Year of Publication: 1998

ISBN:0-89791-962-9

Authors

Sanjeev Khanna	Dept. of Fudamental Mathematics Research, Bell Labs, Murray Hill, NJ
Vincenzo Liberatore	Department of Computer Science, Hill Center, Rutgers University, New Brunswick, NJ

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 5

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/276698.276879 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	Swarup Acharya , Rafael Alonso , Michael Franklin , Stanley Zdonik, Broadcast disks: data management for asymmetric communication environments, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.199-210, May 22-25, 1995, San Jose, California, United States
	2	Swarup Acharya , Michael J. Franklin , Stanley B. Zdonik, Prefetching from Broadcast Disks, Proceedings of the Twelfth International Conference on Data Engineering, p.276-285, February 26-March 01, 1996
	3	Dimitris Achlioptas , Marek Chrobak , John Noga, Competive Analysis of Randomized Paging Algorithms, Proceedings of the Fourth Annual European Symposium on Algorithms, p.419-430, September 25-27, 1996
	4	BELAD~, L. A. A study of replacement algorithms for a virtual storage computer. IBM Systems Journal 5, 2 (looo), 78-101.
	5	Allan Borodin , Nathan Linial , Michael E. Saks, An optimal on-line algorithm for metrical task system, Journal of the ACM (JACM), v.39 n.4, p.745-763, Oct. 1992 [doi>10.1145/146585.146588]
	6	T. F. Bowen , G. Gopal , G. Herman , T. Hickey , K. C. Lee , W. H. Mansfield , J. Raitz , A. Weinrib, The Datacycle architecture, Communications of the ACM, v.35 n.12, p.71-81, Dec. 1992 [doi>10.1145/138859.138868]
	7	Pei Cao , Edward W. Felten , Anna R. Karlin , Kai Li, A study of integrated prefetching and caching strategies, Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, p.188-197, May 15-19, 1995, Ottawa, Ontario, Canada
	8	Amos Fiat , Richard M. Karp , Michael Luby , Lyle A. McGeoch , Daniel D. Sleator , Neal E. Young, Competitive paging algorithms, Journal of Algorithms, v.12 n.4, p.685-699, Dec. 1991 [doi>10.1016/0196-6774(91)90041-V]
	9	Michael Franklin , Stanley Zdonik, A framework for scalable dissemination-based systems, Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.94-105, October 05-09, 1997, Atlanta, Georgia, United States
	10	David K. Gifford, Polychannel systems for mass digital communications, Communications of the ACM, v.33 n.2, p.141-151, Feb. 1990 [doi>10.1145/75577.75580]
	11	Tomasz Imielinski , B. R. Badrinath, Mobile wireless computing: challenges in data management, Communications of the ACM, v.37 n.10, p.18-28, Oct. 1994 [doi>10.1145/194313.194317]
	12	Sandy Irani , Anna R. Karlin, Online computation, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
	13	KARL,, A. R., MA~ASS% M. S., RUOOLPH, L., AND SLEATOR, D. D. Competitive snoopy caching. Algo. rithmica 3, 1 (1988), 79-119.
	14	Mark S. Manasse , Lyle A. McGeoch , Daniel D. Sleator, Competitive algorithms for server problems, Journal of Algorithms, v.11 n.2, p.208-230, Jun. 1990 [doi>10.1016/0196-6774(90)90003-W]
	15	MCGEOCH, L. A., AND SLEATOR, D. D. A strongly competitive randomized paging algorithm. Algorith. mica 6 (1991), 816-825.
	16	SIGEL, E. Videotezt: The Coming Revolution in Home/Office Information Retrieval. Knowledge Industry Publications, White Plains, 1980.
	17	Daniel D. Sleator , Robert E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, v.28 n.2, p.202-208, Feb. 1985 [doi>10.1145/2786.2793]

CITED BY 5

	Vincenzo Liberatore, Empirical investigation of the Markov reference model, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.653-662, January 17-19, 1999, Baltimore, Maryland, United States
	Claire Kenyon , Nicolas Schabanel , Neal Young, Polynomial-time approximation scheme for data broadcast, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.659-666, May 21-23, 2000, Portland, Oregon, United States
	Claire Kenyon , Nicolas Schabanel, The data broadcast problem with non-uniform transmission times, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.547-556, January 17-19, 1999, Baltimore, Maryland, United States
	André Seifert , Marc H. Scholl, A multi-version cache replacement and prefetching policy for hybrid data delivery environments, Proceedings of the 28th international conference on Very Large Data Bases, p.850-861, August 20-23, 2002, Hong Kong, China
	Edward Chan , Wenzhong Li , Daoxu Chen, Energy saving strategies for cooperative cache replacement in mobile ad hoc networks, Pervasive and Mobile Computing, v.5 n.1, p.77-92, February, 2009