Sciweavers

287 search results - page 8 / 58
» On Exploiting Task Duplication in Parallel Program Schedulin...
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
PC
2011
413views Management» more  PC 2011»
13 years 3 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...
ASPLOS
2010
ACM
14 years 3 months ago
Flexible architectural support for fine-grain scheduling
To make efficient use of CMPs with tens to hundreds of cores, it is often necessary to exploit fine-grain parallelism. However, managing tasks of a few thousand instructions is ...
Daniel Sanchez, Richard M. Yoo, Christos Kozyrakis
ISORC
2007
IEEE
14 years 3 months ago
Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids
Scheduling tasks on large-scale computational grids is difficult due to the heterogeneous computational capabilities of the resources, node unavailability and unreliable network ...
Fábio Favarim, Joni da Silva Fraga, Lau Che...
MICRO
2007
IEEE
164views Hardware» more  MICRO 2007»
14 years 3 months ago
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
The emergence of multicore processors has heightened the need for effective parallel programming practices. In addition to writing new parallel programs, the next generation of pr...
William Thies, Vikram Chandrasekhar, Saman P. Amar...