Sciweavers

421 search results - page 32 / 85
» An Intelligent Parallel Loop Scheduling for Parallelizing Co...
Sort
View
ISHPC
2000
Springer
15 years 1 months ago
Limits of Task-Based Parallelism in Irregular Applications
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...
Barbara Kreaseck, Dean M. Tullsen, Brad Calder
69
Voted
IPPS
2006
IEEE
15 years 3 months ago
Dynamic multi phase scheduling for heterogeneous clusters
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
Florina M. Ciorba, Theodore Andronikos, Ioannis Ri...
CJ
1999
87views more  CJ 1999»
14 years 9 months ago
Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
Mayez A. Al-Mouhamed
HPCA
1998
IEEE
15 years 1 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas
OSDI
1994
ACM
14 years 11 months ago
Distributed Filaments: Efficient Fine-Grain Parallelism on a Cluster of Workstations
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
Vincent W. Freeh, David K. Lowenthal, Gregory R. A...