Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints

Transactions on Embedded Computing Systems

Volumn 7, Issue 2, 2008, Pages

  Manolache, Sorin ^a   Eles, Petru ^a   Peng, Zebo ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Mapping; Priority assignment; Schedulability analysis; Soft real time systems; Stochastic task execution times

Indexed keywords

CONSTRAINT THEORY; MULTIPROCESSING SYSTEMS; RANDOM PROCESSES; SYSTEMS ANALYSIS;

PRIORITY ASSIGNMENT; SCHEDULABILITY ANALYSIS; SOFT REAL-TIME SYSTEMS; STOCHASTIC TASK EXECUTION TIMES;

REAL TIME SYSTEMS;

EID: 40549113085     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1331331.1331343     Document Type: Conference Paper

References (61)

1. ABENI, L. AND BUTAZZO, G. 1999. QoS guarantee using probabilistic deadlines. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. 242-249.
2. ALIPPI, C., GALBUSERA, A., AND STELLINI, M. 2003. An application-level synthesis methodology for multidimensional embedded processing systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22, 11, 1457-1470.
3. AUDSLEY, N. C. 1991. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. Rep. YCS 164, Department of Computer Science, University of York. (Dec).
4. AUDSLEY, N. C., BURNS, A., DAVIS, R. I., TINDELL, K. W., AND WELLINGS, A. J. 1991. Hard real-time scheduling: The deadline monotonic approach. In Proceedings of the 8th IEEE Workshop on Real-Time Operating Systems and Software. 133-137.
5. AUDSLEY, N., BURNS, A., RICHARDSON, M., TINDELL, K., AND WELLINGS, A. 1993a. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal 8, 5, 284-292.
6. AUDSLEY, N. C., BURNS, A., RICHARDSON, M. F., AND WELLINGS, A. J. 1993b. Incorporating unbounded algorithms into predictable real-time systems. Computer Systems Science and Engineering 8, 3, 80-89.
7. BERNAT, G., COLIN, A., AND PETTERS, S. 2002. WCET analysis of probabilistic hard real-time systems. In Proceedings of the 23rd Real-Time Systems Symposium. 279-288.
8. BINI, E., BUTAZZO, G., AND BUTAZZO, G. 2001. A hyperbolic bound for the rate monotonic algorithm. In Proceedings of the 13th Euromicro Conference on Real-Time Systems. 59-66.
9. BLAZEWICZ, J. 1976. Scheduling dependent tasks with different arrival times to meet deadlines. In Modeling and Performance Evaluation of Computer Systems, E. Gelenbe and H. Bellner, Eds. North-Holland, Amsterdam.
10. Bosch. 1991. CAN Specification. Bosch, Robert Bosch GmbH, Postfach 50, D-7000 Stuttgart 1, Germany.
11. BROSTER, I., BURNS, A., AND RODRIGUEZ-NAVAS, G. 2002. Probabilistic analysis of CAN with faults. In Proceedings of the 23rd Real-Time Systems Symposium.
12. BURNS, A., PUNNEKKAT, S., STRIGINI, L., AND WRIGHT, D. 1999. Probabilistic scheduling guarantees for fault-tolerant real-time systems. In Proceedings of the 7th International Working Conference on Dependable Computing for Critical Applications. 339-356.
13. BURNS, A., BERNAT, G., AND BROSTER, I. 2003. A probabilistic framework for schedulability analysis. In Proceedings of the Third International Embedded Software Conference, EMSOFT, R. Alur and I. Lee, Eds. Number LNCS 2865 in Lecture Notes in Computer Science. 1-15.
14. BUTTAZZO, G. C. 1997, Hard Real-Time Computing Systems. Kluwer Academic Publ., Norwell, MA.
15. CARDOSO, R., KREUTZ, M., CARRO, L., AND SUSIN, A. 2005, Design space exploration on heterogeneous network-on-chip. In Proceedings of the IEEE International Symposium on Circuits and Systems. Vol. 1. 428-431.
16. DÍAZ, J. L., GARCÍA, D. F., KIM, K., LEE, C.-G., LO BELLO, L., LÓPEZ, J. M., MIN, S. L., AND MIRABELLA, O. 2002. Stochastic analysis of periodic real-time systems. In Proceedings of the 23rd Real-Time Systems Symposium.
17. ELES, P., PENG, Z., KUCHCINSKY, K., AND DOBOLI, A. 1997. System-level hardware/software partitioning based on simulated annealing and tabu search. Journal on Design Automation for Embedded Systems 2, 5-32.
18. European telecommunications standards institute. http://www.etsi.org/.
19. GARDNER, M. 1999. Probabilistic analysis and scheduling of critical soft real-time systems. Ph.D. thesis, University of Illinois at Urbana-Champaign.
20. GARDNER, M. AND LIU, J. W. 1999. Analysing Stochastic Fixed-Priority Real-Time Systems. Springer, New York. 44-58.
21. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability. Freeman, San Francisco, CA.
22. GAUTAMA, H. 1998. A probabilistic approach to the analysis of program execution time. Tech. Rep. 1-68340-44(1998)06, Faculty of Information Technology and Systems, Delft University of Technology.
23. GAUTAMA, H. AND VAN GEMUND, A. J. C. 2000. Static performance prediction of data-dependent programs. In Proceedings of the 2nd International Workshop on Software and Performance. 216-226.
24. GLOVER, F. 1989. Tabu search - Part I. ORSA Journal on Computing 1, 3, 190-206.
25. GONZÁLEZ HARBOUR, M., KLEIN, M. H., AND LEHOCZKY, J. P. 1991. Fixed priority scheduling of periodic rasks with varying execution priority. In Proceedings of the IEEE Real Time Systems Symposium. 116-128.
26. HAJJI, O., BRISSET, S., AND BROCHET, P. 2002. Comparing stochastic optimization methods used in electrical engineering. IEEE Transactions on Systems, Man and Cybernetics 7, 6-9, 6.
27. HU, X. S., ZHOU, T., AND SHA, E. H.-M. 2001. Estimating probabilistic timing performance for real-time embedded systems. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 9, 6 (Dec.), 833-844.
28. HUA, S., QU, G., AND BHATTACHARYYA, S. 2003. Exploring the probabilistic design space of multimedia systems. In Proceedings of the 14th IEEE International Workshop on Rapid Systems Prototyping.
29. HUGHES, C., KAUL, P., ADVE, S., JAIN, R., PARK, C., AND SRINIVASAN, J. 2001. Variability in the execution of multimedia applications and implications for architecture. In Proceedings of the 28th International Symposium on Computer Architecture. 254-265.
30. KALAVADE, A. AND MOGHÉ, P. 1998. A tool for performance estimation of networked embedded end-systems. In Proceedings of the 35th Design Automation Conference. 257-262.
31. KIM, J. AND SHIN, K. G. 1996. Execution time analysis of communicating tasks in distributed systems. IEEE Transactions on Computers 46, 5 (May), 572-579.
32. KLEINROCK, L. 1964. Communication Nets: Stochastic Message Flow and Delay. McGraw-Hill, New York.
33. KRISHNAMACHARI, B. AND WICKER, S. 2000. Optimization of fixed network design in cellular systems using local search algorithms. In Proceedings of the 52nd Vehicular Technology Conference. Vol. 4. 1632-1638.
34. LEHOCZKY, J. P. 1996. Real-time queueing theory. In Proceedings of the 18th Real-Time Systems Symposium. 186-195.
35. LEHOCZKY, J. P. 1997. Real-time queueing network theory. In Proceedings of the 19th Real-Time Systems Symposium. 58-67.
36. LEHOCZKY, J., SHA, L., AND DING, Y. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behaviour. In Proceedings of the 11th Real-Time Systems Symposium. 166-171.
37. LEUNG, J. Y. T. AND WHITEHEAD, J. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 4, 237-250.
38. LI, Y. A. AND ANTONIO, J. K. 1997. Estimating the execution time distribution for a task graph in a heterogeneos computing system. In Proceedings of the Heterogeneous Computing Workshop.
39. LIU, C. L. AND LAYLAND, J. W. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20, 1 (Jan.), 47-61.
40. MANOLACHE, S., ELES, P., AND PENG, Z. 2001. Memory and time-efficient schedulability analysis of task sets with stochastic execution time. In Proceedings of the 13th Euromicro Conference on Real Time Systems. 19-26.
41. MANOLACHE, S., ELES, P., AND PENG, Z. 2002. Schedulability analysis of multiprocessor real-time applications with stochastic task execution times. In Proceedings of the 20th International Conference on Computer Aided Design. 699-706.
42. MANOLACHE, S., ELES, P., AND PENG, Z. 2004a. Optimization of soft real-time systems with deadline miss ratio constraints. In Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium. 562-570.
43. MANOLACHE, S., ELES, P., AND PENG, Z. 2004b. Schedulability analysis of applications with stochastic task execution times. ACM Transactions on Embedded Computing Systems 3, 4, 706-735.
44. MOULY, M. AND PAUTET, M.-B. 1992. The GSM System for Mobile Communication. Palaiseau.
45. NG, J., LEUNG, K., WONG, W., LEE, V. C., AND HUI, C. K. 2002. Quality of service for MPEG video in human perspective. In Proceedings of the 8th International Conference on Real-Time Computing Systems and Applications. 233-241.
46. NISSANKE, N., LEULSEGED, A., AND CHILLARA, S. 2002. Probabilistic performance analysis in multi-processor scheduling. Computing and Control Engineering Journal 13, 4 (Aug.), 171-179.
47. PALENCIA GUTIÉRREZ, J. C. AND GONZÁLEZ HARBOUR, M. 1998. Schedulability analysis for tasks with static and dynamic offsets. In Proceedings of the 19th IEEE Real Time Systems Symposium. 26-37.
48. PIERRE, S. AND HOUETO, F. 2002. Assigning cells to switches in cellular mobile networks using taboo search. IEEE Transactions on Systems, Man and Cybernetics 32, 3, 351-356.
49. SCHMITZ, M. 2003. Energy minimisation techniques for distributed embedded systems. Ph.D. thesis, Dept. of Computer and Electrical Engineering, Univ. of Southampton, UK.
50. SPURI, M. AND STANKOVIC, J. A. 1994. How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Transactions on Computers 43, 12 (Dec.), 1407-1412.
51. SUN, J. 1997. Fixed-priority end-to-end scheduling in distributed real-time systems. Ph.D. thesis, University of Illinois at Urbana-Champaign.
52. SUN, J. AND LIU, J. W. S. 1995. Bounding the end-to-end response time in multiprocessor real-time systems. In Proceedings of the Workshop on Parallel and Distributed Real-Time Systems. 91-98.
53. SUN, J., GARDNER, M. K., AND LIU, J. W. S. 1997. Bounding completion times of jobs with arbitrary release times, variable execution times, and resource sharing. IEEE Transactions on Software Engineering 23, 10 (Oct.), 604-615.
54. TIA, T.-S., DENG, Z., SHANKAR, M., STORCH, M., SUN, J., WU, L.-C., AND LIU, J. W. S. 1995. Probabilistic performance guarantee for real-time tasks with varying computation times. In Proceedings of the IEEE Real-Time Technology and Applications Symposium. 164-173.
55. TINDELL, K. AND CLARK, J. 1994. Holistic schedulability analysis for distributed real-time systems. Euromicro Jurnal on Microprocessing and Microprogramming (Special Issue on Parallel Embedded Real-Time Systems) 40, 117-134.
56. TRAFERRO, S., CAPPARELLI, F., PIAZZA, F., AND UNCINI, A. 1999. Efficient allocation of power of two terms in FIR digital filter design using tabu search. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 3, 411-414.
57. VAN GEMUND, A. J. 1996. Performance modelling of parallel systems. Ph.D. thesis, Delft University of Technology.
58. VAN GEMUND, A. 2003a. Symbolic performance modeling of parallel systems. IEEE Transactions on Parallel and Distributed Systems 14, 2 (Feb.), 154-165.
59. VAN GEMUND, A. J. C. 2003b. Symbolic performance modeling of parallel systems. IEEE Transactions on Parallel and Distributed Systems 14, 2, 154-165.
60. WILD, T., FOAG, J., PAZOS, N., AND BRUNNBAUER, W. 2003. Mapping and scheduling for architecture exploration of networking SoCs. In Proceedings of the 16th International Conference on VLSI Design. 376-381.
61. ZHOU, T., HU, X. S., AND SHA, E. H.-M. 1999. A probabilistic performace metric for real-time system design. In Proceedings of the 7th International Workshop on Hardware-Software Co-Design. 90-94.