Standard Libraries for Parallel Programming

Our objective is to implement a rich set of efficient, re-usable parallel libraries, thereby reducing the time needed to develop parallel applications and encourage modular programming. The libraries are designed to be versatile enough to accommodate the varying demands of the programmer, and still highly efficient in that the programmer need not pay for the features that he is not using. Attempts will be made to make the run-time system take decisions at run time and choose the most appropriate library for the particular problem at hand.

• Reductions
• Communication
• TeMPO
• Load Balancing Algorithms
• PVM
• Simple Messaging
• Master/Slave
• PE Sync
• Branch & Bound
• Heap, Set, Extensible FIFO

Papers / Talks

• 15-04

  2015
  Phd Thesis

  Software Topological Message Aggregation Techniques For Large-scale Parallel Systems

  • Lukasz Wesolowski
• 03-01

  2003
  Paper

  Faucets: Efficient Resource Allocation on the Computational Grid

  • Laxmikant Vasudeo Kale
  • Sameer Kumar
  • Jayant DeSouza
  • Mani Potnuru
  • Sindhura Bandhakavi
• 99-06

  1999
  Paper

  Branch and Bound Based Load Balancing for Parallel Applications

  • Shobana Radhakrishnan
  • Robert Brunner
  • Laxmikant Vasudeo Kale
• 95-13

  1995
  Paper

  A Parallel Adaptive Fast Multipole algorithm for N-body problems

  • Sanjeev Krishnan
  • Laxmikant Vasudeo Kale
• 95-11

  1995
  Paper

  Efficient, Language-Based Checkpointing for Massively Parallel Programs

  • Sanjeev Krishnan
  • Laxmikant Vasudeo Kale
• 95-07

  1995
  Paper

  Modularity, Reuse, and Efficiency with Message-Driven Libraries

  • Laxmikant Vasudeo Kale
  • Attila Gursoy