Abstract
In real-time systems, jobs must be finished before their deadlines. When several jobs have similar requests, handling related operations together may improve both the response times of individual jobs and the total execution time of the system. This is because many jobs have common operations which can be performed only once if jobs are coalesced as a single job. Scheduling algorithms which use the technique of job coalescing to meet more job deadlines are studied. Optimal scheduling algorithms for different system models are investigated. Due to the high complexities of these optimal algorithms, several online heuristic algorithms and their performances are investigated.
| Original language | English |
|---|---|
| Pages (from-to) | 143-150 |
| Number of pages | 8 |
| Journal | Proceedings - IEEE Computer Society's International Computer Software & Applications Conference |
| State | Published - 1989 |
| Externally published | Yes |
| Event | Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA Duration: 20 09 1989 → 22 09 1989 |