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

A checkpointing algorithm for an SCI based distributed shared memory system

โœ Scribed by S Kalaiselvi; V Rajaraman


Book ID
108400810
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
339 KB
Volume
22
Category
Article
ISSN
0141-9331

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A task duplication based scheduling algo
โœ Oh-Han Kang; Si-Gwan Kim ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performan

An efficient implementation of tree-base
โœ M.P. Malumbres; Josรฉ Duato ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 398 KB

This paper presents an ecient routing and ยฏow control mechanism to implement multidestination message passing in wormhole networks. The mechanism is a variation of tree-based multicast with pruning to recover from deadlocks and it is well suited for distributed shared-memory multiprocessors (DSMs) w

The Scalable Modeling System: directive-
โœ M. Govett; L. Hart; T. Henderson; J. Middlecoff; D. Schaffer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

A directive-based parallelization tool called the Scalable Modeling System (SMS) is described. The user inserts directives in the form of comments into existing Fortran code. SMS translates the code and directives into a parallel version that runs efficiently on shared and distributed memory high-pe