Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings - 7th Asia-Pacific Software Engineering Conference, APSEC 2000 |
Publisher | IEEE Computer Society |
Pages | 24-28 |
Number of pages | 5 |
ISBN (Electronic) | 0769509150 |
DOIs | |
State | Published - 2000 |
Event | 7th Asia-Pacific Software Engineering Conference, APSEC 2000 - Singapore, Singapore Duration: 5 Dec 2000 → 8 Dec 2000 |
Publication series
Name | Proceedings - Asia-Pacific Software Engineering Conference, APSEC |
---|---|
Volume | 2000-January |
ISSN (Print) | 1530-1362 |
Conference
Conference | 7th Asia-Pacific Software Engineering Conference, APSEC 2000 |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 5/12/00 → 8/12/00 |
Bibliographical note
Publisher Copyright:© 2000 IEEE.
Keywords
- Algorithm design and analysis
- Application software
- Computer science
- Genetic algorithms
- Minimization methods
- Multiprocessing systems
- Optimal scheduling
- Processor scheduling
- Real time systems
- Scheduling algorithm