Brief announcement: Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 185-187

  Dorrigiv, Reza ^a   López Ortiz, Alejandro ^a   Salinger, Alejandro ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; ARCHITECTURE; COMPUTER ARCHITECTURE; MICROPROCESSOR CHIPS; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE;

DESIGN AND ANALYSES; HIGH LEVEL OF ABSTRACTIONS; LOW DEGREES; MICRO-PROCESSORS; PARALLEL ARCHITECTURES; PARALLEL PROGRAMS; PRAM MODELS; SEQUENTIAL ALGORITHMS; SIMPLE MODIFICATIONS; SPEED-UP; THEORY;

PARALLEL ALGORITHMS;

EID: 57349088105     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378568     Document Type: Conference Paper

References (18)

1. A. Aggarwal, A. K. Chandra, and M. Snir. On communication latency in pram computations. In SPAA '89: Proc. 1st ACM Symp. on Parallel Algs. and, Architectures, pp. 11-21. 1989.
2. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of prams. Theor. Com.put. Sci., 71(1):3 28. 1990.
3. A. Alexandrov, M. F. Ionescu. K. E. Schauser, and C. Schciman. Loggp: incorporating long messages into the logp model one step closer towards a realistic model for parallel computation. In SPAA '95: Proc. 7th ACM Symp. on Parallel Algs. and Architectures, pp. 95 105, 1995.
4. A. Apostolico, M. J. Atallah, L. L. Larmore, and S. McFaddin. Efficient parallel algorithms for string editing and related problems. SIAM J. Com.put., 19(5) :968-988, 1990.]
5. P. G. Bradford. Parallel dynamic programming. Technical Report #352, 1994.
6. R. P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201-206, 1974.
7. F. W. Burton and M. R. Sleep. Executing functional programs on a virtual tree of processors. In FPCA '81: Proc. 1981 Conf. on Functional programming languages and computer architecture., pp. 187 194, 1981.
8. R. Cole. Parallel merge sort. SIAM J. Comput., 17(4):770-785, 1988.
9. T. H. Gormen, C. E. Leiserson. R. L. Rivest, and C. Stein. Introduction, to Algorithms. The MIT Press, 2nd edition, 2001.
10. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauscr, E. Santos. R. Subramonian, and T. von Eicken. Logp: towards a realistic model of parallel computation. In PPOPP '93: Proc. 4th ACM SIGPLAN Symp. on Principles and practice of parallel programming, pp. 1-12, 1993.
11. F. E. Fich, P. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM J. Comput., 17(3):606-627, 1988.
12. S. Fortune and J. Wyllie. Parallelism in random access machines. In STOC :78: Proc. 10th ACM Symp. on Theory of Computing, pp. 114-118, 1978.
13. Z. Galil and K. Park. Parallel dynamic programming. Technical Report CUCS-040-91. 1991.
14. P. B. Gibbons. A more practical pram model. In SPAA '89: Proc. 1st ACM Symp. on Parallel Algs. and Architectures, pp. 158-168, 1989.
15. J. JáJá. An introduction to parallel algorithms. Addison Wesley Longman Publishing Co., Inc., 1992.
16. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of prams by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.
17. C. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. In STOC '88: Proc. 20th ACM Symp. on Theory of Computing, pp. 510-513, 1988.
18. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.