Sciweavers

108 search results - page 17 / 22
» A Lower Bound for Dynamic Scheduling of Data Parallel Progra...
Sort
View
ICPP
2003
IEEE
14 years 22 days ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
ICFP
2010
ACM
13 years 8 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
ASPLOS
2009
ACM
14 years 8 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
CLUSTER
2011
IEEE
12 years 7 months ago
Exploring Fine-Grained Task-Based Execution on Multi-GPU Systems
Using multi-GPU systems, including GPU clusters, is gaining popularity in scientific computing. However, when using multiple GPUs concurrently, the conventional data parallel GPU...
Long Chen, Oreste Villa, Guang R. Gao
MIDDLEWARE
2004
Springer
14 years 25 days ago
A grid service broker for scheduling distributed data-oriented applications on global grids
: The next generation of scientific experiments and studies, popularly called as e-Science, is carried out by large collaborations of researchers distributed around the world engag...
Srikumar Venugopal, Rajkumar Buyya, Lyle J. Winton