Task Scheduling in the Non-ideal Topology
Wei Liu, Chao Wang, Zhang Xian · 2013
In the non-ideal topology, processors are not fully-connected and the data transmission cannot achieve fully-concurrency, so the schedule of IPCs (Inter Processor Communication) will affect the performance of parallel processing directly. However, traditional scheduling method usually ignored the scheduling of IPCs, or only schedule IPCs under the simple topologies. To solve this problem, the disadvantages of traditional task scheduling methods are analyzed, and a more practical method is put forward, which consists of three steps: first, build the topology model to describe the hardware system; second, define different IPC scheduling principles and for different interconnections between processors under the topology model; third, schedule tasks in the non-ideal topology by applying the IPC scheduling method into the DLS (Dynamic Level Scheduling) method. The test of three groups of random tasks with different CCR (Communication to Computation Radio) and the test of an actual signal processing algorithm, show that the method proposed in this paper achieves a better accuracy, and more suitable for the embedded parallel systems. (8 pages)