SUCRA(さくら: Saitama University Cyber Repository of Academic Resources)は、埼玉大学に在籍する研究者の学術雑誌論文、紀要論文、科学研究費補助金成果報告書、学位論文、研究発表プレゼン資料などを登録し、広く世界に発信しています。 埼玉大学に在籍する皆様は、著作物をSUCRAを通じて発信することができます。詳しくは「成果物の登録方法」をご覧ください。
One 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.
An Overlapped Scheduling Method for an Iterative Processing Algorithm with Conditional Operations
A1003001.pdf
(923.78KB)
SUCRAの概要
