REVISITING THE DECOMPOSITION OF KARP, MILLER AND WINOGRAD
Parallel Processing Letters · 1995-12 · 05 (04) · 551-562
DOI: 10.1142/s0129626495000497 ↗Kurz gefasst
Fachartikel in der Zeitschrift Parallel Processing Letters, online erschienen am 21.11.2011. Verfasst von ALAIN DARTE und 1 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
DARTE, A., & VIVIEN, F. (1995). REVISITING THE DECOMPOSITION OF KARP, MILLER AND WINOGRAD. Parallel Processing Letters, 05(04), 551-562. https://doi.org/10.1142/s0129626495000497
Vancouver
DARTE A, VIVIEN F. REVISITING THE DECOMPOSITION OF KARP, MILLER AND WINOGRAD. Parallel Processing Letters. 1995;05(04):551-562. doi:10.1142/s0129626495000497
BibTeX
@article{DARTE1995,
author = {DARTE, ALAIN and VIVIEN, FRÉDÉRIC},
title = {REVISITING THE DECOMPOSITION OF KARP, MILLER AND WINOGRAD},
journal = {Parallel Processing Letters},
year = {1995},
volume = {05},
number = {04},
pages = {551--562},
doi = {10.1142/s0129626495000497}
}
EUVIMED