Dynamic Scheduling Algorithm for Hypercube Architecture
G. J. Joyce Mary, R. Prabhu Doss, G. J. Justin Micheal Sagayam
Journal of E-Technology, Vol. 5, No. 1, 2014.
DOI: 
Link: http://www.dline.info/jet/fulltext/v5n1/4.pdf
Abstract:
Dynamic scheduling on multiprocessor system is mostly for real-time applications. When allocating real time task to a processor, the network topology paid more attention. Hypercube and Mesh connected systems are well known topologies that can be implemented in the tightly coupled architecture. Hypercubes are used to have several useful properties such as high degree of connectivity, fault tolerance, low diameter etc.. In this paper, the outperforming Buddy R/ T [1], Stacking algorithms and Deferred Earliest Deadline First(DEDF) algorithms [2] have been analyzed. DEDF algorithm uses hypercube architecture. A modification of DEDF algorithm has been suggested for hypercube systems. We are introducing new window called Available Processor Time Window (APTW) for processor allocation. By using this window, the processor utilization can be improved and the deadlines of most of the tasks can be met. So, we assure that, the performance is noteworthy and better than the earlier proposed DEDF algorithm for a wide range of workloads.