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 accomodate 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

• Terry Wilmarth

• 99-06    Shobana Radhakrishnan, Robert Brunner, and Laxmikant Kale,  Branch and Bound Based Load Balancing for Parallel Applications ,  Lecture Notes in Computer Science, Volume 1732, 1999.
• 95-13    Sanjeev Krishnan and Laxmikant V. Kale,  A Parallel Adaptive Fast Multipole algorithm for N-body problems,  Proceedings of the International Conference on Parallel Processsing, August 1995.
• 95-11    Sanjeev Krishnan and Laxmikant V. Kale,  Efficient, Language-Based Checkpointing for Massively Parallel Programs,  Internal Report #94-2
• 95-07    L.V. Kale and A. Gursoy,  Modularity, Reuse, and Efficiency with Message-Driven Libraries,  The Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientigic Computing, San Fransisco, 1995