Partitioned EDF scheduling on a few types of unrelated multiprocessors

Real-Time Systems

Volumn 49, Issue 2, 2013, Pages 219-238

  Wiese, Andreas ^a   Bonifaci, Vincenzo ^b   Baruah, Sanjoy ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Multiprocessor scheduling; Polynomial time approximation scheme; Unrelated multiprocessors

Indexed keywords

EDF SCHEDULING; MULTI PROCESSOR SCHEDULING; MULTI-PROCESSOR PLATFORMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SPORADIC TASK SYSTEMS; UNRELATED MULTIPROCESSORS;

MULTIPROCESSING SYSTEMS; PROGRAM PROCESSORS; SCHEDULING; TREES (MATHEMATICS);

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 84876287164     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-012-9164-y     Document Type: Article

References (16)

1. Andersson B, Raravi G, Bletsas K (2010) Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. In: Proceedings of the real-time systems symposium, San Diego, CA. IEEE Comput Soc, Los Alamitos, pp 239-248
2. Baruah S (2004) Partitioning real-time tasks among heterogeneous multiprocessors. In: Proceedings of the thirty-third annual international conference on parallel processing, Montreal, Canada. IEEE Comput Soc, Los Alamitos, pp 467-474
3. Birkhoff G (1946) Tres observaciones sobre el algebra lineal. Rev Univ Nac Tucumán Ser A, Mat Fis Teor, 5, 147-151
4. Chattopadhyay B, Baruah S (2011) A lookup-table driven approach to partitioned scheduling. In: Proceedings of the IEEE real-time technology and applications symposium (RTAS), Chicago. IEEE Comput Soc, Los Alamitos
5. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton
6. Hochbaum D, Shmoys D (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34(1):144-162
7. Hochbaum D, Shmoys D (1988) A polynomial time approximation scheme for scheduling on uniform processors using the dual approximation approach. SIAM J Comput 17(3):539-551
8. Jansen K, Porkolab L (1999) Improved approximation schemes for scheduling unrelated parallel machines. In: Proceedings of the thirty-first annual ACM symposium on theory of computing. ACM, New York, pp 408-417
9. Karmakar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373-395
10. Khachiyan L (1979) A polynomial algorithm in linear programming. Dokl Akad Nauk SSSR 244:1093-1096
11. Lenstra J-K, Shmoys D, Tardos E (1987) Approximation algorithms for scheduling unrelated parallel machines. In: Chandra AK (ed) Proceedings of the 28th annual symposium on foundations of computer science, Los Angeles, CA. IEEE Comput Soc, Los Alamitos, pp 217-224
12. Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46-61
13. Lopez JM, Diaz JL, Garcia DF (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Syst 28(1):39-68
14. Papadimitriou CH (1981) On the complexity of integer programming. J ACM 28(4):765-768
15. Verschae J, Wiese A (2011) On the configuration-LP for scheduling on unrelated machines. In: Demetrescu C, Halldórsson MM (eds) ESA. Lecture notes in computer science, vol 6942. Springer, Berlin, pp 530-542
16. Williamson D, Shmoys D (2011) The design of approximation algorithms. Cambridge University Press, Cambridge