Partitioning Processor Arrays under Resource Constraints

Teich J, Thiele L, Zhang L (1997)

Publication Type: Journal article

Publication year: 1997

Journal

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology Kluwer Academic Publishers

Publisher: Kluwer Academic Publishers

Book Volume: 17

Pages Range: 5-20

Journal Issue: 1

Abstract

A single integer linear programming model for optimally scheduling partitioned regular algorithms is presented. The herein presented methodology differs from existing methods in the following capabilities: 1) Not only constraints on the number of available processors and communication capabilities are taken into account, but also local memories and constraints on the size of available memories. 2) Different types of processors can be handled. 3) The size of the optimization model (number of integer variables) is independent of the size of the tiles to be executed. Hence, 4) the number of integer variables in the optimization model is greatly reduced such that problems of relevant size can be solved in practical execution time.

Authors with CRIS profile

Jürgen Teich Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)

Involved external institutions

Eidgenössische Technische Hochschule Zürich (ETHZ) / Swiss Federal Institute of Technology in Zurich CH Switzerland (CH)

How to cite

APA:

Teich, J., Thiele, L., & Zhang, L. (1997). Partitioning Processor Arrays under Resource Constraints. Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology, 17(1), 5-20.

MLA:

Teich, Jürgen, Lothar Thiele, and L Zhang. "Partitioning Processor Arrays under Resource Constraints." Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology 17.1 (1997): 5-20.

BibTeX: Download