Algorithms and complexity for periodic real-time scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1350-1359

  Bonifaci, Vincenzo ^a,b   Chan, Ho Leung ^c   Marchetti Spaccamela, Alberto ^d   Megow, Nicole ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; PROFITABILITY; SCHEDULING;

ALGORITHMS AND COMPLEXITY; CONSTANT APPROXIMATION ALGORITHMS; MULTI-PROCESSOR PLATFORMS; MULTIPROCESSOR TASKS; POLYNOMIAL-TIME ALGORITHMS; PRE-EMPTIVE SCHEDULING; REAL - TIME SCHEDULING; SPORADIC TASK SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 77951677770     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.109     Document Type: Conference Paper

References (26)

1. K. Albers and F. Slomka. An event stream driven approximation for the analysis of real-time systems. In Proc. 16th Euromicro Conf. on Real-Time Systems, pages 187-195, 2004.
2. E. Bach and J. Shallit. Algorithmic number theory. Vol. I: Efficient algorithms. MIT Press, 1996.
3. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2):331-352, 2001. (Pubitemid 33782953)
4. S. K. Baruah and T. P. Baker. Schedulability analysis of global EDF. Real-Time Systems, 38(3):223-235, 2008.
5. S. K. Baruah, L. E. Rosier, and R. R. Howell. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, 2:301-324, 1990.
6. V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. A constant-approximate feasibility test for multiprocessor real-time scheduling. In D. Halperin and K. Mehlhorn, editors, Proc. 16th European Symp. on Algorithms, volume 5193 of Lecture Notes in Computer Science, pages 210-221. Springer, 2008.
7. S. Chakraborty, S. Künzli, and L. Thiele. Approximate schedulability analysis. In Proc. 23rd Real-Time Systems Symp., pages 159-168, 2002.
8. B. Doerr. Private communication, 2009.
9. F. Eisenbrand and T. Rothvoß. EDF-schedulability of synchronous periodic task systems is coNP-hard. In Proc. 21st ACM-SIAM Symposium on Discrete Algorithms, 2010.
10. K. M. Elbassioni, R. Raman, S. Ray, and R. Sitters. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. In Proc. of the 20th ACM-SIAM Symposium on Discrete Algorithms, pages 1210-1219, 2009.
11. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding and its applications to approximation algorithms. Journal of the ACM, 53(3):324-360, 2006.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
13. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
14. A. Kulik and H. Shachnai. On Lagrangian relaxation and subset selection problems. In Proc. 6th Workshop on Approximation and Online Algorithms, pages 160-173, 2009.
15. E. L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26:125-133, 1990.
16. E. L. Lawler and C. U. Martel. Scheduling periodically occurring tasks on multiple processors. Information Processing Letters, 12(1):9-12, 1981. (Pubitemid 11505351)
17. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.
18. J. Y.-T. Leung and M. L. Merrill. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 11(3):115-118, 1980.
19. J. Y.-T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2(4):237-250, 1982.
20. 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.
21. M. Mignotte. How to share a secret? In Proc. of the Workshop on Cryptography, pages 371-375, 1982.
22. I. Niven, H. Zuckerman, and H. Montgomery. An introduction to the theory of numbers. John Wiley & Sons, 1991.
23. C. H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, Reading, MA, 1994.
24. C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica, 32(2):163-200, 2002.
25. B. Rosser. Explicit bounds for some functions of prime numbers. American Journal of Mathematics, 63(1):211-232, 1941.
26. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(1):103-128, 2007.