Optimal dynamic-priority real-time scheduling algorithms for uniform multiprocessors

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2008, Pages 147-156

  Chen, Shih Ying ^a   Hsueh, Chih Wen ^a  

^a Embedded System and Wireless Network Laboratory   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING CAPACITY; CONTEXT SWITCH; EXECUTION TIME; FEASIBLE SOLUTION; MULTI CORE; MULTI PROCESSOR SCHEDULING; MULTI-CORE PROCESSOR; ON-LINE ALGORITHMS; ONLINE SCHEDULING; OPTIMAL DYNAMICS; PERIODIC TASKS; POLYNOMIAL-TIME ALGORITHMS; PRIORITY ASSIGNMENT; REAL-TIME ENVIRONMENT; REAL-TIME SCHEDULING ALGORITHMS; REAL-TIME TASKS; TASK MIGRATION;

MULTIPROCESSING SYSTEMS; REAL TIME SYSTEMS; TIME SWITCHES;

SCHEDULING ALGORITHMS;

EID: 67249149004     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2008.35     Document Type: Conference Paper

References (18)

1. A. M. D. (AMD). Multi-core processors - the next evolution in computing
2. S. Baruah, N. Cohen, C. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6):600-625, June 1996 (Pubitemid 126422534)
3. S. Baruah and J. Goossens. Rate-monotonic scheduling on uniform multiprocessors. IEEE Transactions on Computers, 52(7):966-970, Jul 2003
4. J. Calandrino, D. Baumberger, S. Tong Li, Hahn, and J. Anderson. Soft real-time scheduling on performance asymmetric multicore platforms. Real Time and Embedded Technology and Applications Symposium, April 2007
5. A. Chandra, M. Adler, and P. Shenoy. Deadline fair scheduling: bridging the theory and practice of proportionate pair scheduling in multiprocessor systems. Real-Time Technolog and Applications Symposium, pages 3-14, June 2001 (Pubitemid 32877657)
6. H. Cho, B. Ravindran, and E. D. Jensen. An optimal realtime scheduling algorithm for multiprocessors. RTSS, pages 101-110, Oct. 2006 (Pubitemid 351209722)
7. M. Dertouzos and A. Mok. Multiprocessor online scheduling of hard-real-time tasks. IEEE Transcation on Software Engineering, 15(12):1497-1506, Dec. 1989 (Pubitemid 20653698)
8. S. Funk, J. Goossens, and S. Baruah. On-line scheduling on uniform multiprocessors. RTSS, pages 183-192, Dec. 2001 (Pubitemid 34064493)
9. T. Gonzalez and S. Sahni. Preemptive scheduling of uniform processor systems. Journal of the ACM, 25(1):92-101, Jan. 1978 (Pubitemid 8579083)
10. D. S. Hochbaum and D. B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAMJournal on Computing, 17(3):539-551, 1988
11. P. Holman and J. H. Anderson. Adapting pfair scheduling for symmetric multiprocessors. Journal of Embedded Computing, 1(4):543-564, 2005
12. E. C. Horvath, S. Lam, and R. Sethi. A level algorithm for preemptive scheduling. Journal of the ACM, 24(1):32-43, January 1977
13. K. Jansen and L. Porkolab. Improved approximation schemes for scheduling unrelated parallel machines. ACM symposium on Theory of computing, 1999
14. J. K. Lenstra, D. B. Shmoys, and ́Eva Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46(1), Jan. 1990
15. C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 10(1):46-61, 1973
16. J. W. Liu. Real-Time Systems. Prentice Hall, 2000
17. R. Muntz and E. Coffman. Optimal preemptive scheduling on two-processor systems. Computers, IEEE Transactions on, (11):1014-1020, Nov. 1969
18. B. Srivastava. An effective heuristic for minimizing makespan on unrelated parallelmachines. The Journal of the Operational Research Society, 49(8):886-894, Aug. 1998 (Pubitemid 128592258)