Resource-Optimal Software Pipelining Using Flow Graphs(Special Issue on Parallel and Distributed Computing, Applications and technologies)
スポンサーリンク
概要
- 論文の詳細を見る
We present a new approach to the loop scheduling problem, which excels previous solutions in two important aspects : The resource constraints are formulated using flow graphs, and the initiation interval λ is treated as a rational variable. The approach supports heterogeneous processor architectures and pipelined functional units, and the Integer Linear Programming implementation produces an optimum loop schedule, whereby a minimum λ is achieved. Our flow graph model facilitates the cyclic binding of loop operations to functional units. Compared to previous research results, the solution can provide faster loop schedules and a significant reduction of the problem complexity and solution time.
- 社団法人電子情報通信学会の論文
- 2003-09-01
著者
-
Muller Jan
The Department Of Electrical Engineering At Dresden University Of Technology
-
FIMMEL Dirk
Department of Electrical Engineering at Dresden University of Technology
-
MULLER Jan
Department of Electrical Engineering at Dresden University of Technology
-
MERKER Renate
Department of Electrical Engineering at Dresden University of Technology
-
FIMMEL Dirk
the Department of Electrical Engineering at Dresden University of Technology
-
MERKER Renate
the Department of Electrical Engineering at Dresden University of Technology
関連論文
- Resource-Optimal Software Pipelining Using Flow Graphs(Special Issue on Parallel and Distributed Computing, Applications and technologies)
- Resource-Optimal Software Pipelining Using Flow Graphs