| D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Euro-Par '98, LNCS, pages 1018--1028, 1998. |
....of the data transfers using this interconnections. A solution of the problem of organizing the data transfers for a given interconnection network is also presented. The design of processor arrays is well studied (e.g. 2,7,8,10,13] and became more realistic by inclusion of resource constraints [3,5,12]. But up to now, only some work has been done in the organization of data transfer. Fortes and Moldovan [6] as well as Lee and Kedem [9] discuss the need of a decomposition of global interconnections into a set of local interconnections without conside ration of access con icts to channels. Chou ....
....The iteration interval as well as t start (e) and t end (e) depend on the scheduling function (i) Hence, a more consequent approach consists in solving the communication problem and determining the scheduling function in one problem. This can be done by adopting techniques presented in [5]. In principle, this allows to determine a scheduling function, the functionality of processors and the channels between processors by solving one optimization problem. Unfortunately, the arising integer program tends to long solution time even for small problems. The presented method also applies ....
D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Proc. Int. Conf. Euro-Par '98, pages 1018-1028, Southampton, 1998. Lecture Notes in Computer Science, Springer.
No context found.
D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Euro-Par '98, LNCS, pages 1018--1028, 1998.
No context found.
D. Fimmel and R. Merker. Design of processor arrays for real-time applications. In Euro-Par '98, LNCS, pages 1018--1028, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC