Pareto-based Soft Real-Time Task Scheduling in Multiprocessor Systems
Abstract:
We develop a new method to map (i.e. allocate and schedule) real-time applications into certain multiprocessor systems. Its objectives are 1) the minimization of the number of processors used and 2) the minimization of the deadline missing time. Given a parallel program with real time constraints and a multiprocessor system, our method finds schedules of the program in the system which satisfy all the real time constraints with minimum number of processors. The minimization is carried out through a Pareto-based Genetic Algorithm which independently considers the both goals, because they are non-commensurable criteria. Experimental results show that our scheduling algorithm achieved better performance than previous ones. The advantage of our method is that the algorithm produces not a single solution but a family of solutions known as the Paretooptimal set, out of which designers can select optimal solutions appropriate for their environmental conditions. 1.
Citations
| 2168 | Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973 |
| 99 | Multiprocessor On-Line Scheduling of Hard Real-Time Tasks – Dertouzos, Mok - 1989 |
| 55 | Two-processor scheduling with start-times and deadlines – Garey, Johnson - 1977 |
| 33 | An empirical study of evolutionary techniques for multiobjective optimization in engineering design – Coello - 1996 |
| 3 | Antwortzeitgesteuerte prozessorzuteilung unter strengen zeitbedingungen – Henn - 1978 |
| 2 | E."Task Assignment and Transaction Clustering Heuristics for Distributed Systems – Aguilar, Gelenbe - 1997 |
| 1 | A New Method for Optimization of Allocation and Scheduling – Coli, Palazzari - 1995 |
