Partitioned packing and scheduling for sporadic real-time tasks in identical multiprocessor systems

Proceedings - Euromicro Conference on Real-Time Systems

Volumn , Issue , 2012, Pages 24-33

  Chen, Jian Jia ^a   Chakraborty, Samarjit ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

approximation; resource augmentation; schedulability analysis; Sporadic real time tasks

Indexed keywords

APPROXIMATION; EXECUTION TIME; MODERN APPLICATIONS; MULTI PROCESSOR SYSTEMS; MULTI-PROCESSOR PLATFORMS; NEAR-OPTIMAL SOLUTIONS; NP COMPLETE; POLYNOMIAL TIME APPROXIMATION SCHEMES; REAL-TIME TASKS; RESOURCE AUGMENTATION; SCHEDULABILITY ANALYSIS; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

SCHEDULING;

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

References (20)

1. S. Baruah. Partitioning sporadic task systems upon memoryconstrained multiprocessors. to appear in ACM Transactions in Embedded Computing Systems.
2. S. Baruah. The partitioned edf scheduling of sporadic task systems. In Real-Time Systems Symposium (RTSS), pages 116-125, 2011.
3. S. K. Baruah and N. Fisher. The partitioned multiprocessor scheduling of sporadic task systems. In RTSS, pages 321-329, 2005.
4. S. K. Baruah and N. Fisher. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans. Computers, 55(7):918-923, 2006.
5. S. K. Baruah, A. K. Mok, and L. E. Rosier. Preemptively scheduling hard-real-time sporadic tasks on one processor. In IEEE Real-Time Systems Symposium, pages 182-190, 1990.
6. A. Bastoni, B. B. Brandenburg, and J. H. Anderson. Is semipartitioned scheduling practical? In Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems, ECRTS '11, pages 125-135, 2011.
7. V. Bonifaci, H.-L. Chan, A. Marchetti-Spaccamela, and N. Megow. Algorithms and complexity for periodic real-time scheduling. In SODA, pages 1350-1359, 2010.
8. C. Chekuri and S. Khanna. On multidimensional packing problems. SIAM J. Comput., 33(4):837-851, 2004.
9. J.-J. Chen and S. Chakraborty. Resource augmentation bounds for approximate demand bound functions. In IEEE Real-Time Systems Symposium, pages 272-281, 2011.
10. R. I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv., 43(4):35, 2011.
11. W. F. de la Vega and G. S. Lueker. Bin packing can be solved within 1+epsilon in linear time. Combinatorica, 1(4):349-355, 1981.
12. F. Eisenbrand and T. Rothvoß. Edf-schedulability of synchronous periodic task systems is coNP-hard. In SODA, pages 1029-1034, 2010.
13. N. W. Fisher. How hard is partitioning for the sporadic task model? In Proceedings of the 2009 International Conference on Parallel Processing Workshops, ICPPW '09, pages 2-5, 2009.
14. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Co., 1979.
15. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, 1969.
16. D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM, 34(1):144-162, 1987.
17. C. L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973.
18. A. K. Mok. Fundamental design problems of distributed systems for the hard-real-time environment. Technical report, Cambridge, MA, USA, 1983.
19. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
20. G. J. Woeginger. There is no asymptotic ptas for twodimensional vector packing. Inf. Process. Lett., 64(6):293-297, 1997.