• DocumentCode
    3501394
  • Title

    Fine-Grained Message Pipelining for Improved MPI Performance

  • Author

    Rodrigues, Arun ; Wheeler, Kyle ; Kogge, Peter ; Underwood, Keith

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Notre Dame Univ.
  • fYear
    2006
  • fDate
    25-28 Sept. 2006
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    By its nature, MPI leads to coarse grained communications. This is because all current MPI implementations deliver two orders of magnitude more bandwidth for large message sizes (kilobytes) than small message sizes (bytes). This translates into applications that bundle their small communications into larger communications whenever possible. In modern implementations, this sacrifice in the granularity of communication translates directly into a sacrifice in the granularity of synchronization. MPI requires that the entire message arrive before any of the data can be delivered to the application, because message completion is the only synchronization semantic the network can expose to the processor. This paper explores the implications of providing synchronization between the network and the processor at the memory word level using a mechanism such as Full/Empty Bits. This enables the application to begin computing as soon as the data for the first memory referenced has arrived without having to wait for all of the data in the message
  • Keywords
    message passing; MPI; coarse grained communications; fine-grained message pipelining; Application software; Bandwidth; Computational modeling; Computer applications; Computer networks; Computer science; Fuses; Laboratories; Message passing; Pipeline processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cluster Computing, 2006 IEEE International Conference on
  • Conference_Location
    Barcelona
  • ISSN
    1552-5244
  • Print_ISBN
    1-4244-0327-8
  • Electronic_ISBN
    1552-5244
  • Type

    conf

  • DOI
    10.1109/CLUSTR.2006.311849
  • Filename
    4100355