Fast Reductions on a Network of Workstations

  • Authors:
  • Sudhir Srinivasan;Margaret Lyell;Jeff Wehrwein;Paul F. Reynolds, Jr.

  • Affiliations:
  • -;-;-;-

  • Venue:
  • HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reduction operations are very useful in parallel anddistributed computing, with applications in barriersynchronization, distributed snapshots, terminationdetection, global virtual time computation, etc. In thecontext of parallel discrete-event simulations, we havepreviously introduced a class of adaptive synchronizationalgorithms based on fast reductions. Here, we explorethe implementation of fast reductions on a popular highperformance computing platform - a network ofworkstations. The specific platform is a set of PentiumPro PC's running the Linux operating system, inter-connectedby Myrinet - a Gbps network. The generalreduction model on which our synchronizationalgorithms are based is introduced first, followed by adescription of how this model can be implemented. Wediscuss several design trade-offs that must be made inorder to achieve the driving goal of high speedreductions and provide innovative algorithms to meet thecorrectness and performance requirements of thereduction model.