LogfP - A model for small messages in InfiniBand

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Hoefler, Torsten ^a   Mehlan, Torsten ^a   Mietke, Frank ^a   Rehm, Wolfgang ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS;

INFINIBAND NETWORK; MODEL DESIGNERS;

PARALLEL PROCESSING SYSTEMS;

EID: 33847099271     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639624     Document Type: Conference Paper

References (21)

1. A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating Long Messages into the LogP Model. Journal of Parallel and Distributed Computing, 44(1):71-79, 1995.
2. G. Bilardi, K. T. Herley, and A. Pietracaprina. BSP vs LogP. In SPAA '96: Proceedings of the eighth annual ACM symposium on Paraliel algorithms and architectures, pages 25-32. ACM Press, 1996.
3. G. Blelloch. Scans as Primitive Operations. In Proc. of the International Conference on Parallel Processing, pages 355-362, August 1987.
4. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: towards a realistic model of parallel computation. In Principles Practice of Parallel Programming, pages 1-12, 1993.
5. D. Culler, L. T. Liu, R. P. Martin, and C. Yoshikawa. LogP Performance Assessment of Fast Network Interfaces. IEEE Micro, February 1996.
6. S. Fortune and J. Wyllie. Parallelism in random access machines. In STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computing, pages 114-118. ACM Press, 1978.
7. P. G. Gibbons, Y. Matias, and V. Ramachandran. Can a shared memory model serve as a bridging model for parallel computation? In ACM Symposium on Parallel Algorithms and Architectures, pages 72-83, 1997.
8. S. E. Hambrusch. Models for parallel computation. In ICPP Workshop, pages 92-95, 1996.
9. S. E. Hambrusch and A. A. Khokhar. An architectureindependent model for coarse grained parallel machines. In Proceedings of the 6-th IEEE Symposium on Parallel and Distributed Processing, 1994.
10. T. Hoefler, L. Cerquetti, T. Mehlan, F. Mietke, and W. Rehm. A practical Approach to the Rating of Barrier Algorithms using the LogP Model and Open MPI. In Proceedings of the 2005 International Conference- on Parallel Processing Workshops, pages 562-569, June 2005.
11. T. Hoefler, T. Mehlan, F. Mietke, and W. Rehm. A Survey of Barrier Algorithms for Coarse Grained Supercomputers. Chemnitzer Informatik Berichte - CSR-04-03, 2004. url: http://archiv.tuchemnitz.de/pub/2005/0074/data/CSR,- 04-03.pdf.
12. T. Hoefler, T. Mehlan, F. Mietke, and W. Rehm. A Communication Model for Small Messages with Infini-Band. PARS Proceedings, 2005.
13. F. Ino, N. Fujimoto, and K. Hagihara. Loggps: a parallel computational model for synchronization analysis. In PPoPP '01: Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming, pages 133-142, New York, NY, USA, 2001. ACM Press.
14. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. Leeuwen, editor, Handbook of Theoretical Computer Science: Volume A: Algorithms and Complexity, pages 869-941. Elsevier, Amsterdam, 1990.
15. T. Kielmann, H. E. Bal, and K. Verstoep. Fast measurement of logp parameters for message passing platforms. In IPDPS '00: Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing, pages 1176-1183, London, UK, 2000. Springer-Verlag.
16. J. R. Larus, S. Chandra, and D. A. Wood. CICO: A Practical Shaied-Memory Programming Performance Model. In Ferrante and Hey, editors, Workshop on Portability and Performance for Parallel Processing, Southampton University, England, July 13-15, 1993. John Wiley & Sons.
17. F. T. Leighton. Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc., 1992.
18. B. M. Maggs, L. R. Matheson, and R. E. Tarjan. Models of Parallel Computation: A Survey and Synthesis. In Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), volume 2, pages 61-70, 1995.
19. C. A. Moritz and M. I. Frank. LoGPC: Modelling Network Contention in Message-Passing Programs. IEEE Transactions on Parallel and Distributed Systems, 12(4):404, 2001.
20. J. A. Neider and R. Mead. A simplex method for function minimization. Comput. J. 7, pages 308-313, 1965.
21. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.