Virtual memory algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Virtual memory algorithms

Full text

Pdf (1.12 MB)

Source

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

Chicago, Illinois, United States

Pages: 173 - 185

Year of Publication: 1988

ISBN:0-89791-264-0

Authors

Alok Aggarwal	IBM Research Division, Thomas J. Watson Center, P. O. Box 218, Yorktown Heights, New York
Ashok Chandra	IBM Research Division, Thomas J. Watson Center, P. O. Box 218, Yorktown Heights, New York

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 14, 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/62212.62227 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.

	A86	R. C. Agarwal, Personal Co,ln~t~nication.
	AACS87	A. Aggarwal , B. Alpern , A. Chandra , M. Snir, A model for hierarchical memory, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.305-314, January 1987, New York, New York, United States [doi>10.1145/28395.28428]
	AC86	Ramesh C Agarwal , James W Cooley, Fourier transform and convolution subroutines for the IBM 3090 Vector facility, IBM Journal of Research and Development, v.30 n.2, p.145-162, March 1986
	ACS87	A. Aggarwal, A. K. ('handr;i and M. Snir, "1 licrarchic:ll Monitory with Block transfer," proc. of Annual Sylnp. foundations o1' Computer Science, ()ct. 19H7, 204-216.
	AHU74	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	AHU83	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	AV87	A. Aggarwal , J. S. Vitter, The I/O complexity of sorting and related problems, 14th International Colloquium on Automata, languages and programming, p.467-478, July 1987, Karlsruhe, Germany
	De70	Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970 [doi>10.1145/356571.356573]
	F72	R. W. Floyd, "Permuting Information in Idealized Two-Level Storage," In R. E. Miller and J. W. Thatcher (editors), Complexity of Computer Computations, Plenum Press, New York, 1972, 105-109.
	FM67	G. Forsythc and C. B. Molar, Cotnputer Solution of Litwar AIgebnlit' Sl'wents. Prcntice-ttall, 1967.
	FP79	Patrick C. Fischer , Robert L. Probert, Storage reorganization techniques for matrix computation in a paging environment, Communications of the ACM, v.22 n.7, p.405-415, July 1979 [doi>10.1145/359131.359134]
	G74	J. Gecsci, "Determining Hit Ratios in Multilevel Hierarchies.'' IBM J. of Research and Development, July 1974, 316-327.
	HK81	Hong Jia-Wei , H. T. Kung, I/O complexity: The red-blue pebble game, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.326-333, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802486]
	K73	Donald E. Knuth, The Art of Computer Programming Volumes 1-3 Boxed Set, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1998
	LS87	B. Liu and N. Strother, "peak Vector performance from VS fortran." IBM Research, 'Itch. Report, Rc 12849, Jtlnc 1987.
	M72	Cleve B. Moler, Matrix computations with Fortran and paging, Communications of the ACM, v.15 n.4, p.268-270, April 1972 [doi>10.1145/361284.361297]
	MC69	A. C. McKellar , E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, v.12 n.3, p.153-165, March 1969 [doi>10.1145/362875.362879]
	MGS70	R, L, Mattson, J. Gacsei, D. R. Slutz and I. L. Traiger, Evaluation Techniques for Storage Hierarchies," IBM Systems Journal, 1970, 78-117.
	ST85	Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi>10.1145/3828.3835]
	SV87	J, E. Savage and J, S. Vittcr, "Parallelism in Space- Time Tradco{fs," Advances in Computing Re~'earch, Vol. 4: Special Issue on Parallel and Distributed Computing, J AI Press, 1987, 117-146.

CITED BY 5

	Marek Chrobak , John Noga, Competitive algorithms for multilevel caching and relaxed list update, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.87-96, January 25-27, 1998, San Francisco, California, United States
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Journal of Algorithms, v.53 n.2, p.115-136, November 2004
	Lars Arge , Michael A. Bender , Erik D. Demaine , Bryan Holland-Minkley , J. Ian Munro, Cache-oblivious priority queue and graph algorithm applications, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	R. Cole , O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.169-178, June 18-21, 1989, Santa Fe, New Mexico, United States