A Module-Interlock Technique for Task Scheduling in a Multiprocessor System

• Main Authors: Wei-Chung Tung, 董維鈞
• Other Authors: Liang-Teh Lee
• Format: Others
• Language: en_US
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/54603373274767862520

碩士 === 大同工學院 === 資訊工程研究所 === 87 === For finding the shortest execution time in a directed acyclic graph (DAG), the critical path concept is usually applied. However, in those approaches, the utilization of processors is not considered. In this thesis we propose a new task scheduling technique, module-interlock technique (MIT), to keep the processor utilization as high as possible, so as to obtain a shortest execution time. According to the critical path scheme on the DAG, the result of the task scheduling can be presented in a Gantt chart that is then translated into bricks in our system for further scheduling. Bricks in the system are categorized in four types, rectangular, protruding, concave, and uneven, according to the usage of processors. Applying the proposed technique by interlocking proper type of bricks to perform the task re-scheduling, a higher processor utilization with shorter execution time can be achieved.