Könyv Exploiting Task-Order Information Christoph Angerer

Exploiting Task-Order Information

in Compilers for Shared-Memory Parallel Programs

Nyelv: Angol
Kötés: Puha kötésű
Elérhetőség: Beszállítói készleten
Küldés 5-8 napon belül
27 449 Ft
Over the last years, researchers and engineers have developed numerous abstractions and programming...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
2012
oldal
180
EAN
9783838131740
ISBN
3838131746
Enbook ID
06860221
Súly
272
Méretek
152 x 229 x 10

Teljes leírás

Over the last years, researchers and engineers have developed numerous abstractions and programming models that make developing parallel programs easier, safer, and more efficient. Despite the advances made in parallel programming, however, the corresponding compilers still remain largely ignorant of the parallelism exhibited by the program execution. In particular, current compilers do not have any knowledge about what tasks are scheduled with what ordering---even though many higher-level parallel programming models contain a wealth of task-order information that can be exploited by the compiler. This thesis presents a schedule analysis that can extract task-ordering information from real-world programs. By analyzing potential orderings between tasks, the compiler can decide whether accesses to shared memory by different tasks may interfere and use this information to guide its optimization efforts. The schedule analysis can be combined with standard program analyses such as points-to and escape analysis to improve the precision of known optimizations as well as enable new optimizations.

Érdekelheti

88 779 Ft

DevilGod

Claudia Belle
6 969 Ft

The Jump Journal

Tim Passmore
8 031 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták