TY - GEN
T1 - Pareto-based soft real-time task scheduling in multiprocessor systems
AU - Oh, J.
AU - Bahn, H.
AU - Wu, C.
AU - Koh, K.
N1 - Publisher Copyright:
© 2000 IEEE.
PY - 2000
Y1 - 2000
N2 - We develop a new method to map (i.e. allocate and schedule) real-time applications into certain multiprocessor systems. Its objectives are: the minimization of the number of processors used; and 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 Pareto-optimal set, out of which designers can select optimal solutions appropriate for their environmental conditions.
AB - We develop a new method to map (i.e. allocate and schedule) real-time applications into certain multiprocessor systems. Its objectives are: the minimization of the number of processors used; and 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 Pareto-optimal set, out of which designers can select optimal solutions appropriate for their environmental conditions.
KW - Algorithm design and analysis
KW - Application software
KW - Computer science
KW - Genetic algorithms
KW - Minimization methods
KW - Multiprocessing systems
KW - Optimal scheduling
KW - Processor scheduling
KW - Real time systems
KW - Scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=35048896587&partnerID=8YFLogxK
U2 - 10.1109/APSEC.2000.896679
DO - 10.1109/APSEC.2000.896679
M3 - Conference contribution
AN - SCOPUS:35048896587
T3 - Proceedings - Asia-Pacific Software Engineering Conference, APSEC
SP - 24
EP - 28
BT - Proceedings - 7th Asia-Pacific Software Engineering Conference, APSEC 2000
PB - IEEE Computer Society
Y2 - 5 December 2000 through 8 December 2000
ER -