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

Efficient use of parallel libraries on heterogeneous Networks of Workstations

โœ Scribed by A. Clematis; G. Dodero; V. Gianuzzi


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
231 KB
Volume
46
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Stardust: An Environment for Parallel Pr
โœ Gilbert Cabillic; Isabelle Puaut ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 328 KB

This paper describes Stardust, an environment for parallel programming on networks of heterogeneous machines. Stardust runs on distributed memory multicomputers and networks of workstations. Applications using Stardust can communicate both through message-passing and through distributed shared memor

Efficient parallel timing simulation of
โœ Edwin Naroska; Feipei Lai; Rung-Ji Shang; Uwe Schwiegelshohn ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 353 KB

In this paper we address the parallel timing simulation of synchronous VLSI designs on a network of workstations (NOWs). We suggest combining cycle based and conventional timing simulation techniques to achieve fast timing simulation even on NOWs which are typically characterized by low bandwidth an

Coordinating Parallel Processes on Netwo
โœ Xing Du; Xiaodong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

The network of workstations (NOW) we consider for scheduling is heterogeneous and nondedicated, where computing power varies among the workstations and local and parallel jobs may interact with each other in execution. An effective NOW scheduling scheme needs sufficient information about system hete

Parallel Application Scheduling on Netwo
โœ Stergios V. Anastasiadis; Kenneth C. Sevcik ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

Parallel applications can be executed using the idle computing capacity of workstation clusters. However, it remains unclear how to schedule the processors among different applications most effectively. Processor scheduling algorithms that were successful for shared-memory machines have proven to be

On Multicast Algorithms for Heterogeneou
โœ R. Libeskind-Hadas; J.R.K. Hartline; P. Boothe; G. Rae; J. Swisher ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB

Networks of workstations (NOWs) provide an economical platform for high performance parallel computing. Such networks may comprise a variety of different types of workstations and network devices. This paper addresses the problem of efficient multicast in a heterogeneous communication model. Althoug