PRO:a model for parallel resource-optimal computation

Proceedings - International Symposium on High Performance Computing Systems and Applications

Volumn 2002-January, Issue , 2002, Pages 100-107

  Gebremedhin, Assefaw Hadish ^a   Lassous, Isabelle Guérin ^b   Gustedt, Jens ^c   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b INRIA RHÔNE ALPES   (France)

^c LORIA   (France)

Author keywords

Complexity analysis; Parallel algorithms; Parallel computers; Parallel models

Indexed keywords

PARALLEL ALGORITHMS;

COMPLEXITY ANALYSIS; INTEGRAL PART; OPTIMAL COMPUTATION; OPTIMALITY; PARALLEL COMPUTATION MODEL; PARALLEL COMPUTER; PARALLEL MODELS;

ALGORITHMS;

EID: 84949883411     PISSN: 15505243     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCSA.2002.1019141     Document Type: Conference Paper

References (23)

1. A. G. Alexandrakis, A. V. Gerbessiotis, D. S. Lecomber, and C. J. Siniolakis. Bandwidth, space and computation efficient PRAMprogramming: The BSP approach. In Proceedings of the SUP'EUR '96 Conference, Krakow, Poland, September 1996.
2. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the Postal Model for message passing systems. In The 4th annual ACM symposium on parallel algorithms and architectures, pages 13-22, July 1992.
3. R. P. Brent. The parallel evaluation of generic arithmetic expressions. Journal of the ACM, 21(2):201-206, 1974.
4. E. Caceres, F. Dehne, A. Ferreira, P. Locchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In The 24th International Colloquium on Automata Languages and Programming, volume 1256 of LNCS, pages 390-400. Springer Verlag, 1997.
5. D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4thA CM SIGPLAN Symposium on principles and practice of parallel programming, San Diego, CA, May 1993.
6. F. Dehne. Coarse grained parallel algorithms. Algorithmica Special Issue on "Coarse grained parallel algorithms", 24(3/4):173-176, 1999.
7. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379-400, 1996.
8. S. Fortune and J. Wyllie. Parallelism in random access machines. In 10thA CM Symposium on Theory of Computing, pages 114-118, May 1978.
9. A. H. Gebremedhin, I. Guérin Lassous, J. Gustedt, and J. A. Telle. Graph coloring on a coarse grained multiprocessor. In U. Brandes and D. Wagner, editors, WG 2000, volume 1928 of LNCS, pages 184-195. Springer-Verlag, 2000.
10. A. V. Gerbessiotis, D. S. Lecomber, C. J. Siniolakis, and K. R. Sujithan. PRAM programming: Theory vs. practice. In Proceedings of 6thE uromicro Workshop on Parallel and Distributed Processing, Madrid, Spain. IEEE Computer Society Press, January 1998.
11. A. V. Gerbessiotis and C. J. Siniolakis. A new randomized sorting algorithm on the BSP model. Technical report, New Jersey Institute of Technology, 2001.
12. A. V. Gerbessiotis and L. G. Valiant. Direct bulksynchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251-267, 1994.
13. P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory of Computing Systems, 1999.
14. R. Greenlaw, H. Hoover, andW. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York, 1995.
15. I. Guérin Lassous, J. Gustedt, and M. Morvan. Handling graphs according to a coarse grained approach: Experiments with MPI and PVM. In J. Dongarra, P. Kacsuk, and N. Podhorszki, editors, 7thE uropean PVM/MPI Users' Group Meeting, volume 1908 of LNCS, pages 72-79. Springer Verlag, 2000.
16. K. Hawick et al. High performance computing and communications glossary. see http://nhse.npac.syr.edu/hpccgloss/.
17. J. Jájá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
18. J. JáJá and K. W. Ryu. The Block Distributed Memory model. IEEE Transactions on Parallel and Distributed Systems, 8(7):830-840, 1996.
19. R. M. Karp and V. Ramachandran. Parallel Algorithms for Shared-Memory Machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, Algorithms and Complexity, pages 869-941. Elsevier Science Publishers B.V., Amsterdam, 1990.
20. C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71(1):95-132, march 1990.
21. B. M. Maggs, L. R. Matheson, and R. E. Tarjan. Models of parallel computation: A survey and synthesis. In 28th HICSS, volume 2, pages 61-70, January 1995.
22. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
23. J. S. Vitter and R. A. Simons. New classes for parallel complexity: A study of unification and other complete problems for P. IEEE Transactions on Computers, C-35(5):403-418, 1986.