Sciweavers

42 search results - page 1 / 9
» Provably Efficient Scheduling for Languages with Fine-Graine...
Sort
View
SPAA
1995
ACM
13 years 8 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
OSDI
1994
ACM
13 years 5 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...
IJHPCA
2006
114views more  IJHPCA 2006»
13 years 4 months ago
Fault-Tolerant Scheduling of Fine-Grained Tasks in Grid Environments
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
Gosia Wrzesinska, Rob van Nieuwpoort, Jason Maasse...
IPPS
1998
IEEE
13 years 8 months ago
Efficient Fine-Grain Thread Migration with Active Threads
Thread migration is established as a mechanism for achieving dynamic load sharing. However, fine-grained migration has not been used due to the high thread and messaging overheads...
Boris Weissman, Benedict Gomes, Jürgen Quitte...
IWOMP
2007
Springer
13 years 10 months ago
Support for Fine Grained Dependent Tasks in OpenMP
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
Oliver Sinnen, Jsun Pe, Alexander Vladimirovich Ko...