Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2004, Pages 37-46

  Baruah, Sanjoy ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Feasibility analysis; Global Scheduling; Heterogeneous Multiprocessors; Periodic tasks; Preemptive Scheduling

Indexed keywords

FEASIBILITY ANALYSIS; GLOBAL SCHEDULING; HETEROGENEOUS MULTIPROCESSORS; PERIODIC TASKS; PREEMPTIVE SCHEDULING;

ALGORITHMS; CONSTRAINT THEORY; EMBEDDED SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MICROPROCESSOR CHIPS; POLYNOMIALS; PROGRAM PROCESSORS; SCHEDULING; THEOREM PROVING;

REAL TIME SYSTEMS;

EID: 21644431756     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/REAL.2004.20     Document Type: Conference Paper

References (30)

1. ANDBRSSON, B., AND JONSSON, J. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In Proceedings of the EuroMicro Conference on Real-Time Systems (Porto, Portugal, July 2003), IEEE Computer Society Press, pp. 33-40.
2. BAKER, T. Multiprocessor EDF and deadline monotonic schedulability analysis. In Proceedings of the IEEE Real-Time Systems Symposium (December 2003), IEEE Computer Society Press, pp. 120-129.
3. BARUAH, S. Partitioning real-time tasks among heterogeneous multiprocessors. In Proceedings of the Thirty-third Annual International Conference on Parallel Processing (Montreal, Canada, August 2004), IEEE Computer Society Press, pp. 467-474.
4. BARUAH, S., COHEN, N., PLAXTON, G., AND VARVBL, D. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 6 (June 1996), 600-625.
5. BARUAH, S., FUNK, S., AND GOOSSBNS, J. Robustness results concerning EDF scheduling upon uniform multiprocessors. IEEE Transactions on Computers 52, 9 (2003), 1185-1195.
6. BARUAH, S., AND GOOSSENS, J. The static-priority scheduling of periodic task systems upon identical multiprocessor platforms. In Proceeding of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems (Marina del Rey, CA, November 2003), IASTED, pp. 427-432.
7. BRAUN, T. D., SIEGEL, H. J., AND MACIEJEWSKI, A. A. Static mapping heuristics for tasks with dependencies, priorities, deadlines, and multiple versions in heterogeneous environments. In Proceedings of the 16th International Parallel and Distributed Processing Symposium (Fort Lauderdale, FL, April 2002).
8. BRAUNAND, T. D., SIEGEL, H. J., AND MACIEJEWSKI, A. A. Heterogeneous computing: Goals, methods, and open problems. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (June 2001), pp. 1-12.
9. DANTZIG, G. B. Linear Programming and Extensions. Princeton University Press, 1963.
10. E. COFFMAN, J., AND DENNING, P. J. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, NJ, 1973.
11. FREUND, R. F., AND SIEGEL, H. J. Heterogeneous processing. IEEE Computer 26 (June 1993), 13-17.
12. FUNK, S., GOOSSENS, J., AND BARUAH, S. On-line scheduling on uniform multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium (December 2001), IEEE Computer Society Press, pp. 183-192.
13. GOOSSENS, J., FUNK, S., AND BARUAH, S. Priority-driven scheduling of periodic task systems on multiprocessors. Real Time Systems 25, 2-3 (2003), 187-205.
14. HALL, P. On representation of subsets. Journal of the London Mathematical Society 10 (1935), 26-30.
15. KARMAKAR, N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984), 373-395.
16. KHACHIYAN, L. A polynomial algorithm in linear programming. Dokklady Akademiia Nauk SSSR 244 (1979), 1093-1096.
17. KIM, J.-K., SHIVLE, S., SIEGEL, H. J., MACIEJEWSKI, A. A., BRAUN, T. D., SCHNEIDER, M., TIDEMAN, S., CHITTA, R., DILMAGHANI, R. B., JOSHI, R., KAUL, A., SHARMA, A., SRIPADA, S., VANGARI, P., AND YELLAMPALLI, S. S. Dynamic mapping in a heterogeneous environment with tasks having priorities and multiple deadlines. In Proceedings of the 12th Hetereogeneous Computing Workshop (Nice, France, April 2003), IEEE Computer Society.
18. LENSTRA, J. K., SHMOYS, D. B., AND TARDOS, E. Approximation algorithms for scheduling unrelated parallel machines. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science (Los Angeles, CA, Oct. 1987), A. K. Chandra, Ed., IEEE Computer Society Press, pp. 217-224.
19. LEUNG, J. A new algorithm for scheduling periodic real-time tasks. Algorithmica 4 (1989), 209-219.
20. LEUNG, J., AND WHITEHEAD, J. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2 (1982), 237-250.
21. LIU, C., AND LAYLAND, J. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1 (1973), 46-61.
22. Liu, C. L. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60 II (1969), 28-31.
23. Liu, J. W. S., AND LIU, C. L. Bounds on scheduling algorithms for heterogeneous computing platforms. In Proceedings of the IFIP Congress (Stockholm, Sweden, 1974), vol. 30, North-Holland Publishing Company, pp. 483-485.
24. Liu, J. W. S., AND YANG, A. T. Optimal scheduling of independent tasks on heterogeneous computing systems. In Proceedings ACM National Conference (N. Y., 1974), vol. 1, ACM, pp. 38-45.
25. LOPEZ, J. M., GARCIA, M., DIAZ, J. L., AND GARCIA, D. F. Worst-case utilization bound for EDF scheduling in 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.
26. MAHESWARAN, M., BRAUN, T. D., AND SIEGEL, H. J. Heterogeneous distributed computing. In Encyclopedia of Electrical and Electronic Engineering, J. G. Webster, Ed., vol. 8. John Wiley, New York, NY, 1999.
27. OH, D.-I., AND BAKER, T. P. Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems: The International Journal of Time-Critical Computing 15 (1998), 183-192.
28. POTTS, C. N. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics 10 (1985), 155-164.
29. SCHRIJVER, A. Theory of Linear and Integer Programming. John Wiley and Sons, 1986.
30. WEST, D. B. Introduction to Graph Theory (2nd Edition). Prenctice Hall, 2001.