Carte Exploiting Task-Order Information Christoph Angerer

Exploiting Task-Order Information

in Compilers for Shared-Memory Parallel Programs

Limbă: engleză
Legare: Carte broșată
Disponibilitate: În depozitul extern
Expediem în 5-8 zile
382.26 lei
Over the last years, researchers and engineers have developed numerous abstractions and programming...

Informații despre carte

Limbă
engleză
Legare
Carte - Carte broșată
Publicat
2012
Pagini
180
EAN
9783838131740
ISBN
3838131746
Enbook ID
06860221
Greutate
272
Dimensiuni
152 x 229 x 10

Descriere completă

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.

S-ar putea să te intereseze

1 151.93 lei

DevilGod

Claudia Belle
96.92 lei

The Jump Journal

Tim Passmore
112.64 lei

Clienții care au cumpărat această carte au mai cumpărat și