๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Threshold Scheduling Strategy for Sisal on Distributed-Memory Machines

โœ Scribed by S.S. Pande; D.P. Agrawal; J. Mauney

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
906 KB
Volume
21
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Compilation and Communication Strategies
Compilation and Communication Strategies for Out-of-Core Programs on Distributed Memory Machines
โœ Rajesh Bordawekar; Alok Choudhary; J. Ramanujam ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 518 KB

program. The need for high performance I/O is so significant that almost all the present generation parallel computers such as the Paragon, SP-2, and nCUBE2. provide some kind of hardware and software support for parallel I/O [dRC94]. Data parallel languages such as High Performance Fortran (HPF) [

Compiler Algorithms for Optimizing Local
Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines
โœ M. Kandemir; J. Ramanujam; A. Choudhary ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB

Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar