A Clustering Algorithm for Communication-Aware Scheduling of Task Graphs on Multi-Core Reconfigurable Systems

In this paper, a clustering algorithm called the Reconfigurable Dominant Sequence Clustering (ReDSC), is proposed. The experiments show that ReDSC reduces the parallel run time efficiently by 30 percent. Moreover, an empirical comparison of ReDSC with its peer in the multi-processor model, i.e., DSC algorithm, is provided and the results demonstrate the 35 percent improvement of ReDSC over DSC. Then, a hardware implementation of a dynamic scheduler for run-time communication-aware scheduling of hardware tasks is proposed. The proposed scheduler makes use of the ReDSC algorithm for allocating tasks to the processing reconfigurable cores, dynamically considering the communication costs. The simulation results illustrate the benefits of the proposed scheduler as compared to that of other static and basic schedulers in the technical literature.