Automatic parallelization in the polytope model

P Feautrier - The Data Parallel Programming Model: Foundations …, 2005‏ - Springer
The aim of this paper is to explain the importance of polytope and polyhedra in automatic
parallelization. We show that the semantics of parallel programs is best described …

Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model

U Bondhugula, M Baskaran, S Krishnamoorthy… - … CC 2008, Held as Part of …, 2008‏ - Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular
accesses. Affine transformations in this model capture a complex sequence of execution …

An approach for quantitative analysis of application-specific dataflow architectures

B Kienhuis, E Deprettere, K Vissers… - Proceedings IEEE …, 1997‏ - ieeexplore.ieee.org
In this paper we present an approach for quantitative analysis of application-specific
dataflow architectures. The approach allows the designer to rate design alternatives in a …

Generation of efficient nested loops from polyhedra

F Quilleré, S Rajopadhye, D Wilde - International journal of parallel …, 2000‏ - Springer
Automatic parallelization in the polyhedral model is based on affine transformations from an
original computation domain (iteration space) to a target space-time domain, often with a …

[PDF][PDF] An affine partitioning algorithm to maximize parallelism and minimize communication

AW Lim, GI Cheong, MS Lam - … of the 13th international conference on …, 1999‏ - dl.acm.org
An affine partitioning Framework unifies many useful program transforms such as
unimodular transformations(interchange, reversal, skewing), loop fusion, fission, scaling …

[ספר][B] Scheduling and automatic parallelization

A Darte, Y Robert, F Vivien - 2012‏ - books.google.com
Page 1 Alain Darte Yves Robert Frédéric Vivien Scheduling and Automatic Parallelization pringer
Science Business Media, LLC Page 2 Scheduling and Automatic Parallelization Page 3 Alain …

Maximizing parallelism and minimizing synchronization with affine transforms

AW Lim, MS Lam - Proceedings of the 24th ACM SIGPLAN-SIGACT …, 1997‏ - dl.acm.org
This paper presents the first algorithm to find the optimal affine transform that maximizes the
degree of parallelism while minimizing the degree of synchronization in a program with …

[HTML][HTML] Maximizing parallelism and minimizing synchronization with affine partitions

AW Lim, MS Lam - Parallel computing, 1998‏ - Elsevier
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 …

ICFHR2014 competition on handwritten text recognition on transcriptorium datasets (HTRtS)

JA Sánchez, V Romero, AH Toselli… - 2014 14th International …, 2014‏ - ieeexplore.ieee.org
A contest on Handwritten Text Recognition organised in the context of the ICFHR 2014
conference is described. Two tracks with increased freedom on the use of training data were …

SUIF Explorer: an interactive and interprocedural parallelizer

SW Liao, A Diwan, RP Bosch Jr, A Ghuloum… - Proceedings of the …, 1999‏ - dl.acm.org
The SUIF Explorer is an interactive parallelization tool that is more effective than previous
systems in minimizing the number of lines of code that require programmer assistance. First …