• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests

Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests

Hardcover

General Computers

Currently unavailable to order

ISBN10: 1409255506
ISBN13: 9781409255505
Publisher: Lulu Press
Pages: 236
Weight: 1.04
Height: 0.69 Width: 6.00 Depth: 9.00
Language: English
A safe basis for automatic loop parallelization is the polyhedron model, which represents the iteration domain of a loop nest as a polyhedron in an n-dimensional integer lattice. However, turning the parallel loop program in the model to efficient code meets with several obstacles, due to which performance may deteriorate seriously - especially on distributed memory architectures. This thesis introduces a fine-grained model of the computation performed and shows how this model can be applied to create efficient code.

Also in

General Computers