Sciweavers

114 search results - page 7 / 23
» Speculative Parallelization - Eliminating the Overhead of Fa...
Sort
View
HPDC
2006
IEEE
14 years 1 months ago
Troubleshooting Distributed Systems via Data Mining
Through massive parallelism, distributed systems enable the multiplication of productivity. Unfortunately, increasing the scale of available machines to users will also multiply d...
David A. Cieslak, Douglas Thain, Nitesh V. Chawla
SPAA
2010
ACM
14 years 13 days ago
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
Load balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating...
Youngjoon Jo, Milind Kulkarni
CC
2009
Springer
149views System Software» more  CC 2009»
14 years 8 months ago
Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...
Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook...
ISCA
1998
IEEE
108views Hardware» more  ISCA 1998»
13 years 12 months ago
Pipeline Gating: Speculation Control for Energy Reduction
Branch prediction has enabled microprocessors to increase instruction level parallelism (ILP) by allowing programs to speculatively execute beyond control boundaries. Although spe...
Srilatha Manne, Artur Klauser, Dirk Grunwald
PPOPP
2010
ACM
14 years 4 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...