loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95)
Revisiting the Decomposition of Karp, Miller and Winograd
Strasbourg, France
July 24-July 26
ISBN: 0-8186-7109-2
Alain Darte, Ecole Normale Sup_rieure de Lyon
Fredric Vivien, Ecole Normale Sup_rieure de Lyon
This paper is devoted to the construction of multi-dimensional schedules for a system of uniform recurrence equations. We show that this problem is dual to the problem of computability of a system of uniform recurrence equations. We propose a new study of the decomposition algorithm first proposed by Karp, Miller and Winograd: we base our implementation on linear programming resolutions whose duals give exactly the desired multi-dimensional schedules. Furthermore, we prove that the schedules built this way are optimal up to a constant factor.
Index Terms:
Uniform recurrence equations, multi-dimensional scheduling, automatic parallelization
Citation:
Alain Darte, Fredric Vivien, "Revisiting the Decomposition of Karp, Miller and Winograd," asap, pp.13, 1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.