Abstract
We study the space and the access complexity of computations represented by Computational Directed Acyclic Graphs (CDAGs) in hierarchical memory systems. First, we present a unifying framework for proving lower bounds on the space complexity, which captures most of the bounds known in the literature for relevant CDAGs, previously proved through ad-hoc arguments. Then, we expose a close relationship between the notions of space and access complexity, where the latter represents the minimum number of accesses performed by any computation of a CDAG at a given level of the memory hierarchy. Specifically, we present two general techniques to derive bounds on the access complexity of a CDAG based on the space complexity of certain subgraphs. One technique, simpler to apply, provides only lower bounds, while the other provides (almost) matching lower and upper bounds and improves upon previous well-known result by Hong and Kung.
This work was supported, in part, by CNR and MURST of Italy. Part of the work of G. Bilardi was done while this author was a visitor at the IBM T. J. Watson Research Laboratory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, B. Alpern, A.K. Chandra, and M. Snir. A model for hierarchical memory. In Proc. of the 19th ACM Symp. on Theory of Computing, pages 305–314, 1987.
A. Aggarwal and J.S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116–1127, 1988.
G. Bilardi and F.P. Preparata. Processor-time tradeoffs under bounded-speed message propagation: Part II, lower bounds. Theory of Computing Systems, Vol. 32, 531–559, 1999.
G. Bilardi and E. Peserico. Efficient portability across memory hierarchies. Manuscript, 2000.
S.A. Cook. An observation on time-storage trade off. Journal of Computer and System Sciences, 9:308–316, 1974.
J.W. Hong and H.T. Kung. I/O complexity: The red-blue pebble game. In Proc. of the 13th ACM Symp. on Theory of Computing, pages 326–333, 1981.
J. Hopcroft, W. Paul, and L. Valiant. On time versus space. Journal of the ACM, 24(2):332–337, April 1977.
T. Lengauer and R.E. Tarjan. Asymptotically tight bounds on time-space trade-offs in a pebble game. Journal of the ACM, 29(4):1087–1130, October 1982.
M.S. Paterson and C.E. Hewitt. Comparative schematology. In Proc. of Project MAC Conf. Concurrent Systems and Parallel Computation, pages 119–127, Woods Hole, MA, 1970.
N. Pippenger. Pebbling. Technical report, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, 1980. See also 5th IBM Symposium of Mathematical Foundations of Computer Science.
W.J. Paul, R.E. Tarjan, and J.R. Celoni. Space bounds for a game on graphs. Mathematical Systems Theory, 10:239–251, 1977.
A.L. Rosenberg and I.H. Sudborough. Bandwidth and pebbling. Computing, 31:115–139, 1983.
J.E. Savage. Space-time tradeoffs in memory hierarchies. Technical Report CS-93-08, Department of Computer Science, Brown University, 115 Waterman St. Providence, RI 02912-1910, 1993.
J.E. Savage. Models of Computation-Exploring the Power of Computing. Addison Wesley, Reading, MA, USA, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilardi, G., Pietracaprina, A., D’Alberto, P. (2000). On the Space and Access Complexity of Computation DAGs. In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-40064-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41183-3
Online ISBN: 978-3-540-40064-6
eBook Packages: Springer Book Archive