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
β¦ LIBER β¦
Broadcasting on Networks of Workstations
β Scribed by Samir Khuller; Yoo-Ah Kim; Yung-Chun Justin Wan
- Book ID
- 106148974
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 547 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Parallel Application Scheduling on Netwo
β
Stergios V. Anastasiadis; Kenneth C. Sevcik
π
Article
π
1997
π
Elsevier Science
π
English
β 538 KB
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
Unstructured Mesh Computations on Networ
β
Mark T. Jones; Paul E. Plassmann
π
Article
π
2000
π
John Wiley and Sons
π
English
β 622 KB
On time-relaxed broadcasting networks
β
Tianxing Yao; Peter Che Bor Lam; Wensong Lin; Guofei Zhou
π
Article
π
2010
π
Elsevier Science
π
English
β 281 KB
Parallel FFT on ATMβbased networks of wo
β
Suresh Chalasani; Parameswaran Ramanathan
π
Article
π
1998
π
Springer US
π
English
β 289 KB
OpenMP on networks of workstations for s
β
Feng Zhang; Guoliang Chen; Zhaoqing Zhang
π
Article
π
2002
π
Springer
π
English
β 941 KB