| Summary: | Task scheduling is a combinatorial optimisation problem that is known to have large interacting degrees of freedom and is generally classified as NP-complete. Most solutions to the problem have been proposed in the form of heuristics. These include approaches using list scheduling, queueing theory, graph theoretic and enumerated search. In this paper, we present a dynamic scheduling method for mapping tasks onto a set of processing elements (PEs) on the reconfigurable mesh parallel computing model. Our model called the Dynamic Scheduler on Reconfigurable Mesh (DSRM) is based on the Markovian m/m/c queueing system, where tasks arrive and form a queue according to Poisson distribution, and are serviced according to the exponential distribution. The main objective in our study is to produce a schedule that distributes the tasks fairly by balancing the load on all PEs. The second objective is to produce a high rate of successfully assigned tasks on the PEs. These two requirements tend to conflict and they constitute the maximum-minimum problem in optimisation, where the maximum of one causes the other to be minimum. We study the effectiveness of our approach in dealing with these two requirements in DSRM.
|
|---|
