Computing with time-varying data: Sequential complexity and parallel speed-up

Theory of Computing Systems

Volumn 31, Issue 1, 1998, Pages 5-26

  Luccio, F ^a   Pagli, L ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PROBLEM SOLVING;

COMPUTATIONAL COSTS; DYNAMIC ALGORITHM; OPTIMAL SEQUENTIAL; PARALLEL SOLUTIONS; RUNNING TIME; SEQUENTIAL COMPUTATIONS; TIME INVARIANTS; TIME-VARYING DATA;

DATA HANDLING;

EID: 0032345962     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000074     Document Type: Article

References (18)

1. A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir, A model for hierarchical memory, Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 305-314.
2. A. Aggarwal, A. K. Chandra, and M. Snir, Hierarchical memory with block transfer, Proc. 28th Ann. IEEE Symp. on Foundations of Computer Science, 1987, pp. 204-216.
3. S. G. Akl, M. Cosnard, and A. G. Ferreira, Data-movement-intensive problems: two folk theorems in parallel computation revisited, Theoret. Comput. Sci. 95 (1992), 323-337.
4. R. Cole and U. Vishkin, Approximate and exact parallel scheduling with application to list, tree and graph problems, Proc. 21th Ann. IEEE Symp. on Foundations of Computer Science, 1986, pp. 478-491.
5. S. Cook, C. Dwork, and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput. 15 (1986), 87-97.
6. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification - a technique for speeding up dynamic graph algorithms, Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science, 1992, pp. 60-69.
7. D. Eppstein, Z. Galil, and G. F. Italiano, Improved sparsification, TR 93-20, Department of Information and Computer Science, University of California, Irvine, 1993.
8. R. M. Karp, On-line algorithms versus off-line algorithms: how much is it worth to know the future?, in: J. van Leeuven, Ed., Information Processing 92, Vol. 1, Elsevier, Amsterdam, 1992, pp. 416-429.
9. R. M. Karp and V. Ramachandran, A survey of parallel algorithms for shared memory machines, in: J. van Leeuven, Ed., Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 869-941.
10. L. Kleinrock, Queueing Systems, Wiley, New York, 1975.
11. F. Luccio and L. Pagli, The p-shovelers problem (computing with time-varying data), Proc. 4th IEEE Symp. on Parallel and Distributed Processing, 1992, pp. 188-193.
12. F. Luccio and L. Pagli, A model of sequential computation based on a pipelined access to memory, Math. Systems Theory 26 (1993), 343-356.
13. M. H. Nodine and J. F. Vitter, Large-scale sorting in parallel memories, Proc. 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, 1991, pp. 29-39.
14. W. Paul, U. Vishkin, and H. Wagener, Parallel dictionaries on 2-3 trees, Proc. ICALP, 1983, pp. 597-609.
15. F. P. Preparata, Introduction to Computer Engineering, Harper & Row, New York, 1985.
16. D. Richards, Studies of self-organizing placement algorithms for linear and finger lists, Inform. Sci. 63 (1992), 153-172.
17. U. Vishkin, Can parallel algorithms enhance serial implementation?, SIGACT News 22 (Fall 1991), 63.
18. J. S. Vitter and R. A. Simons, New classes for parallel complexity: a study of unification and other complete problems for P, IEEE Trans. Comput. 35 (1986), 403-418.