On the Time Scheduling Problem of Uniform Recurrence Equations

• Main Authors: Chin, Tai-Lin, 金台齡
• Other Authors: Tasy Jong-Chuang
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/44704529731090887534

碩士 === 國立交通大學 === 資訊工程學系 === 85 === In this thesis, we study a series of hyperplane-based time scheduling methods for uniform recurrence equations. The studied schedules are linear schedule, uniform affine schedule, affine schedule, and multi-dimensional schedule.In addition, a schedule named as multi-dimensional affine schedule is studied.It improves the execution time of the multi-dimensional schedule. All these scheduling problems are formulated as linear programs. Time scheduling problem is a very important problem on parallel cmputing field. It plays an important role in the designs of parallel processor array and parallel compilers. Besides, for illustration, these scheduling methods are implemented for some real examples, including convolution, selection sort, 2D filter and a complex example of uniform recurrence equations. From these illustrative examples, the quality of various time scheduling methods can be explored. Moreover, the importance of the time scheduling problem in parallel algorithms can be seen.