Kniha Exploiting Task-Order Information Christoph Angerer

Exploiting Task-Order Information

in Compilers for Shared-Memory Parallel Programs

Jazyk: Angličtina
Vazba: Brožovaná
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
1 571
Over the last years, researchers and engineers have developed numerous abstractions and programming...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2012
Stránek
180
EAN
9783838131740
ISBN
3838131746
Enbook ID
06860221
Hmotnost
272
Rozměry
152 x 229 x 10

Kompletní popis

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.

Mohlo by vás zajímat

4 818

DevilGod

Claudia Belle
395

The Jump Journal

Tim Passmore
476

Zákaznicí kteří koupili tuto knihu koupili také