An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations

スポンサーリンク

概要

• 論文の詳細を見る

• copyright(c)1998 IEICE許諾番号：08RB0009One of the ways to execute a processing algorithm in high speed is parallel processing on multiple computing resources such as processors and functional units. To identify the minimum number of computing resources, the most important is the scheduling to determine when each operation in the processing algorithm is executed. Among feasible schedules satisfying all the data dependencies in the processing algorithm, an overlapped schedule can achieve the fastest execution speed for an iterative processing algorithm. In the case of processing algorithms with operations which are executed on some conditions, computing resources can be shared by those conditional operations. In this paper, we propose a scheduling method which derives an overlapped schedule where the required number of computing resources is minimized by considering the sharing by conditional operations.

• 一般社団法人電子情報通信学会の論文
• 1998-03-25

著者

• Ito Kazuhito

  The Department Of Electrical And Electronic Systems Saitama University

• Kawasaki Tatsuya

  The Department Of Electrical And Electronic Systems Saitama University

• 伊藤 和人

  the Department of Communications and Integrated Systems, Tokyo Institute of Technology

関連論文

• Systm-MSPA Design of H.263+ Video Encoder/Decoder LSI for Videotelephony Applications(Special Section on VLSI Design and CAD Algorithms)
• An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations

スポンサーリンク