Abstract
Both analysis and design optimisation of real-time systems has predominantly concentrated on considering hard real-time constraints. For a large class of applications, however, this is both unrealistic and leads to unnecessarily expensive implementations. This paper addresses the problem of task priority assignment and task mapping in the context of multiprocessor applications with stochastic execution times and in the presence of constraints on the percentage of missed deadlines. We propose a design space exploration strategy together with a fast method for system performance analysis. Experiments emphasize the efficiency of the proposed analysis method and optimisation heuristic in generating high-quality implementations of soft real-time systems with stochastic task execution times and constraints on deadline miss ratios.
- Abeni, L. and Butazzo, G. 1999. QoS guarantee using probabilistic deadlines. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. 242--249.Google Scholar
- 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. Google Scholar
Digital Library
- 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.).Google Scholar
- 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.Google Scholar
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Bosch. 1991. CAN Specification. Bosch, Robert Bosch GmbH, Postfach 50, D-7000 Stuttgart 1, Germany.Google Scholar
- Broster, I., Burns, A., and Rodriguez-Navas, G. 2002. Probabilistic analysis of CAN with faults. In Proceedings of the 23rd Real-Time Systems Symposium. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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 2855 in Lecture Notes in Computer Science. 1--15.Google Scholar
- Buttazzo, G. C. 1997. Hard Real-Time Computing Systems. Kluwer Academic Publ., Norwell, MA. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- European telecommunications standards institute. http://www.etsi.org/.Google Scholar
- Gardner, M. 1999. Probabilistic analysis and scheduling of critical soft real-time systems. Ph.D. thesis, University of Illinois at Urbana-Champaign. Google Scholar
Digital Library
- Gardner, M. and Liu, J. W. 1999. Analyzing Stochastic Fixed-Priority Real-Time Systems. Springer, New York. 44--58. Google Scholar
Digital Library
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability. Freeman, San Francisco, CA.Google Scholar
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- Glover, F. 1989. Tabu search---Part I. ORSA Journal on Computing 1, 3, 190--206.Google Scholar
Cross Ref
- 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.Google Scholar
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Kim, J. and Shin, K. G. 1996. Execution time analysis of communicating tasks in distributed systems. IEEE Transactions on Computers 45, 5 (May), 572--579. Google Scholar
Digital Library
- Kleinrock, L. 1964. Communication Nets: Stochastic Message Flow and Delay. McGraw-Hill, New York. Google Scholar
Digital Library
- 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.Google Scholar
- Lehoczky, J. P. 1996. Real-time queueing theory. In Proceedings of the 18th Real-Time Systems Symposium. 186--195. Google Scholar
Digital Library
- Lehoczky, J. P. 1997. Real-time queueing network theory. In Proceedings of the 19th Real-Time Systems Symposium. 58--67. Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Mouly, M. and Pautet, M.-B. 1992. The GSM System for Mobile Communication. Palaiseau. Google Scholar
Digital Library
- 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.Google Scholar
- Nissanke, N., Leulseged, A., and Chillara, S. 2002. Probabilistic performance analysis in multiprocessor scheduling. Computing and Control Engineering Journal 13, 4 (Aug.), 171--179.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Schmitz, M. 2003. Energy minimisation techniques for distributed embedded systems. Ph.D. thesis, Dept. of Computer and Electrical Enginieering, Univ. of Southampton, UK.Google Scholar
- 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. Google Scholar
Digital Library
- Sun, J. 1997. Fixed-priority end-to-end scheduling in distributed real-time systems. Ph.D. thesis, University of Illinois at Urbana-Champaign.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- van Gemund, A. J. 1996. Performance modelling of parallel systems. Ph.D. thesis, Delft University of Technology.Google Scholar
- van Gemund, A. 2003a. Symbolic performance modeling of parallel systems. IEEE Transactions on Parallel and Distributed Systems 14, 2 (Feb.), 154--165. Google Scholar
Digital Library
- van Gemund, A. J. C. 2003b. Symbolic performance modeling of parallel systems. IEEE Transactions on Parallel and Distributed Systems 14, 2, 154--165. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
Index Terms
Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints
Recommendations
A review of priority assignment in real-time systems
It is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling. Since then, huge progress has been made in the field of real-time scheduling with more complex models and schedulability ...
Schedulability analysis of applications with stochastic task execution times
In the past decade, the limitations of models considering fixed (worst-case) task execution times have been acknowledged for large application classes within soft real-time systems. A more realistic model considers the tasks having varying execution ...
Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways
Controller Area Network (CAN) is widely used in automotive applications. Existing schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into ...








Comments