Task assignment on uniform heterogeneous multiprocessors

Proceedings - Euromicro Conference on Real-Time Systems

Volumn 2005, Issue , 2005, Pages 219-226

  Funk, Shelby ^a   Baruah, Sanjoy ^b  

^a UNIVERSITY OF GEORGIA   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE UTILIZATION BOUND; BIN PACKING PROBLEMS; PERIODIC TASK SYSTEMS; TASK ASSIGNMENT;

APPROXIMATION THEORY; COMPUTER OPERATING SYSTEMS; PROBLEM SOLVING; SCHEDULING; SPEED; TIME VARYING SYSTEMS;

MULTIPROCESSING SYSTEMS;

EID: 33744804897     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2005.31     Document Type: Conference Paper

References (6)

1. FUNK, S., GOOSSENS, J., AND BARUAH, S. K. On-line scheduling on uniform multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium (December 2001), IEEE Computer Society Press, pp. 183-192.
2. HOCHBAUM, D. S., AND SHMOYS, D. B. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM 34, 1 (Jan. 1987), 144-162.
3. HOCHBAUM, D. S., AND SHMOYS, D. B. A polynomial time approximation scheme for scheduling on uniform processors using the dual approximation approach. SIAM Journal on Computing 17, 3 (June 1988), 539-551.
4. JOHNSON, D. Fast algorithms for bin packing. Journal of Computer and Systems Science 8, 3 (1974), 272-314.
5. JOHNSON, D. S. Near-optimal Bin Packing Algorithms. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology, 1973.
6. LÓPEZ, J. M., GARCIA, M., DIAZ, J. L., AND GARCIA, D. F. Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In Proceedings of the EuroMicro Conference on Real-Time Systems (Stockholm, Sweden, June 2000), IEEE Computer Society Press, pp. 25-34.