Minimizing the Maximum End-to-End Delay on Network Structures Using the Distributed Pinwheel Model

• Main Authors: Yu-Sheng Huang, 黃裕盛
• Other Authors: Chih-Wen Hsueh
• Format: Others
• Language: en_US
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/20753318880514195417

碩士 === 國立中正大學 === 資訊工程研究所 === 89 === Distributed real-time systems often have an end-to-end timing requirement. Minimizing the maximum end-to-end delay is one of the most important timing constraints we would like to guarantee for quality of services. The topology of many distributed systems on Internet is often a complex network structure.In this paper, we extend our research on distributed pinwheel scheduling from a pipelined structure to general network structures for minimizing the maximum end-to-end delay. We derive a tight maximum delay bound between two nodes and a linear-time algorithm to find the minimax delay between two nodes. With this bound and algorithm, it is easier and faster to schedule distributed real-time tasks with distance constraints and minimize the maximum end-to-end delay. Since the general scheduling problem is very difficult (NP-hard), we derive two more efficient heuristics algorithm than previous research to minimize the maximum end-to-end delay. We also compare the simulation results between our heuristics and previous research. The distributed pinwheel scheduling model can be used for distance-constrained real-time tasks on complex network structures to reduce a lot of end-to-end delay and provide a predictable result.