LogGP: Incorporating long messages into the LogP model for parallel computation

Journal of Parallel and Distributed Computing

Volumn 44, Issue 1, 1997, Pages 71-79

  Alexandrov, Albert ^a   Ionescu, Mihai F ^a   Schauser, Klaus E ^a   Scheiman, Chris ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008669884     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1346     Document Type: Article

References (18)

1. Alexandrov A., Ionescu M., Schauser K., Scheiman C. LogGP: Incorporating Long Messages into the LogP model - One step closer towards a realistic model for parallel computation. Technical Report. TRCS 95-09:Apr. 1995.
2. V. Bala, J. Bruck, R. Cypher, P. Elustondo, A. Ho, C-T. Ho, S. Kipnis, M. Snir, Apr. 1994, CCL: A portable and tunable collective communication library for scalable parallel computers, 8th International Parallel Processing Symposium.
3. A. Bar-Noy, S. Kipnis, June 1992, Designing broadcasting algorithms in the postal model for message-passing systems, Proceedings of the ACM Symposium on Parallel Algorithms and Architectures.
4. Bertsekas D., Tsitsiklis J. Parallel and Distributed Computation. 1989;Prentice Hall, Englewood Cliffs.
5. D. E. Culler, A. Dusseau, S. C. Golstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick, Nov. 1993, Parallel programming in Split-C, Proc. of Supercomputing.
6. Culler D. E., Dusseau A., Martin R., Schauser K. E. Fast parallel sorting under LogP: From theory to practice. Portability and Performance for Parallel Processing. 1994;Wiley, New York.
7. D. E. Culler, R. M. Karp, D. A. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, T. von Eicken, May 1993, LogP: Towards a realistic model of parallel computation, Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.
8. D. E. Culler, K. Keeton, L. T. Liu, A. Mainwaring, R. Martin, S. Rodrigues, K. Wright, Nov. 1994, Generic active message interface specification, UC Berkeley.
9. S. Fortune, J. Wyllie, May 1978, Parallelism in random access machines, Proceedings of the 10th Annual Symposium on Theory of Computing.
10. Hockney R. Performance parameters and results for the genesis parallel benchmarks. Hey T., Ferrante J. Portability and Performance for Parallel Processing. 1994;Wiley, New York.
11. M. Homewood, M. McLaren, Aug. 1993, Meiko CS-2 interconnect elan-elite design, Proc. of Hot Interconnects.
12. Karp R. M., Ramachandran V. Parallel algorithms for shared-memory machines. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;Elsevier, Amsterdam/New York.
13. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing. 1994;Benjamin-Cummings, Redwood City.
14. Liu L. T., Culler D. E. Measurements of active messages performance on the CM-5. Technical Report. UCB/CSD 94-807:May 1994.
15. K. E. Schauser, C. J. Scheiman, Apr. 1995, Experience with active messages on the Meiko CS-2, 9th International Parallel Processing Symposium.
16. Tucker L. W., Mainwaring A. CMMD: Active messages on the CM-5. Parallel Comput. 20:Apr. 1994.
17. Valiant L. G. A bridging model for parallel computation. Commun. ACM. 33:Aug. 1990.
18. T. von Eicken, D. E. Culler, S. C. Goldstein, K. E. Schauser, Active messages: A mechanism for integrated communication and computation, Proc. of the 19th Int'l Symposium on Computer Architecture, May 1992.