Scheduling parallel tasks with individual deadlines
In this paper, we consider the problem of scheduling independent parallel tasks with individual deadlines so as to maximize the sum of the works of the tasks which complete their executions before deadlines. We propose two polynomial time heuristic algorithms for non-malleable parallel tasks and malleable tasks with linear speedups, respectively. The approximation factors of two algorithms are 5+ε and 4.5, respectively, where ε is an arbitrary positive constant.
Unable to display preview. Download preview PDF.
- 1.S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. The Journal of Real-Time Systems, 4:125–144, 1992.Google Scholar
- 2.R. Conway, W. Maxwell, and L. Miller, Theory of Scheduling, Addison-Wesley, 1967.Google Scholar
- 3.A. Feldmann, M. Kao, J. Sgall, and S. Teng. Optimal online scheduling of parallel jobs with dependencies. STOC, 642–651, 1993.Google Scholar
- 4.G. Koren and D. Shasha. Moca: a multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science, 128:75–97, 1994.Google Scholar
- 5.W. Ludwig and P. Tiwari. Scheduling malleable and nonmalleable parallel tasks. SODA, 167–176, 1994.Google Scholar
- 6.S. K. Sahni. Algorithms for scheduling independent tasks. JACM, 116–127, 1976.Google Scholar
- 7.J. Turek, J. Wolf and P. Yu, Approximate algorithms for scheduling parallelizable tasks. SPAA, 323–332, 1992.Google Scholar
- 8.J. Turek, W. Ludwig, J. L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn and P. S. Yu, “Scheduling parallelizable tasks to minimize average response time,” SPAA, 200–209, 1994.Google Scholar
- 9.G. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130:5–16, 1994.Google Scholar