𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximizing parallelism and minimizing synchronization with affine partitions

✍ Scribed by Amy W. Lim; Monica S. Lam

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
232 KB
Volume
24
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents an algorithm to find the optimal affine partitions that maximize the degree of parallelism and minimize the degree of synchronization in programs with arbitrary loop nestings and affine data accesses. The problem is formulated without the use of imprecise data dependence abstractions such as data dependence vectors. The algorithm presented subsumes previously proposed loop transformation algorithms that are based on unimodular transformations, loop distribution, fusion, scaling, reindexing, and statement reordering.

πŸ“œ SIMILAR VOLUMES

Ranking alternatives with fuzzy weights
Ranking alternatives with fuzzy weights using maximizing set and minimizing set
✍ P. Anand Raj; D. Nagesh Kumar πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 601 KB

Ranking alternatives (both qualitative as well as quantitative) in a multicriterion environment, employing experts opinion (preference structure) using fuzzy numbers and linguistic variables, are presented in this paper. Fuzzy weights (#i) of alternatives (Ai) are computed using standard fuzzy arith

Torus structure on graphs and twisted pa
Torus structure on graphs and twisted partition functions for minimal and affine models
✍ R. Coquereaux; M. Huerta πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 530 KB

Using the Ocneanu quantum geometry of ADE diagrams (and of other diagrams belonging to higher Coxeter-Dynkin systems), we discuss the classification of twisted partition functions for affine and minimal models in conformal field theory and study several examples associated with the WZW, Virasoro and