skip to main content
10.1145/1284480.1284563acmconferencesArticle/Chapter ViewAbstractPublication PagessbcciConference Proceedingsconference-collections
Article

A time petri net-based approach for hard real-time systems scheduling considering dynamic voltage scaling, overheads, precedence and exclusion relations

Authors Info & Claims
Published:03 September 2007Publication History

ABSTRACT

Over the last years, DVS (Dynamic Voltage Scaling) hasbeen adopted as an effective technique for reducing energyconsumption in embedded systems. In the context of hard real-time embedded systems, several scheduling approaches have been developed to address voltage scaling together with stringent timing constraints. However, intertask relations as well as overheads, such as preemptions and frequency/voltage switchings, have been neglected, in such a way that those approaches may generate schedules that may not properly meet system constraints. This work presents a method for hard real-time systems scheduling considering dynamic voltage scaling, overheads, precedence and exclusion relations. The proposed work adopts a formal model based on time Petri nets in order to find a feasible schedule using apre-runtime approach that satisfies timing and energy constraints.

References

  1. F. Yao et al. A scheduling model for reduced cpu energy. IEEE Annual Foundations of Computer Science, pages 374--382, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Barreto et al. A time petri net-based approach for software synthesis considering overheads. SBAC-PAD, pages 184--191, October 2005.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Chandrasena et al. An Energy Efficient Rate Selection Algorithm for Voltage Quantized Dynamic Voltage Scaling. ISSS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Garey and D. Johnson. Computer and Intractability: a Guide to the Theory of the NP-Completeness. W. H. Freeman and Company, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. N. Oliveira Jr. Desenvolvimento de Um Protótipo para a Medida Não Invasiva da Saturação Arterial de Oxigênio em Humanos-Oxímetro de Pulso (in portuguese). MSc Thesis, UFPE, August 1998.Google ScholarGoogle Scholar
  6. R. Jejurikar and R. Gupta. Energy Aware Non-preemptive Scheduling for Hard Real-Time Systems. ECRTS, pages 21--30, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. Leung et al. Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling. DATE, pages 634--639 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Xu. On inspection and verification of software with timing requirements. IEEE Trans. on Software Engineering, 29(8):705--720, August 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Kwon et al. Optimal Voltage Allocation Techniques for Dynamically Variable Voltage Processors. DAC, pages 2--6, June 2003Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems. PhD Thesis, Univ. of Liege, Nov. 1994.Google ScholarGoogle Scholar
  11. T. Murata. Petri nets: Properties, analysis and applications. Proc. IEEE, 77(4):541--580, April 1989.Google ScholarGoogle ScholarCross RefCross Ref
  12. H. Aydin et al. Power-aware scheduling for periodic real-time tasks. IEEE Trans. on Computers, 53(5):584--600, May 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. Shin and J. Kim. Power-Aware Scheduling of Conditional Task Graphs in Real-Time Multiprocessor Systems. ISLPED, August 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Xu and D. Parnas. Priority scheduling versus pre-run-time scheduling. Real-Time Systems, 18(1):7--23, Kluwer Academic Publishers, January 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Merlin and D. J. Faber. Recoverability of communication protocols. IEEE Trans. Comm., 24(9):1036--1043, Sep. 1976.Google ScholarGoogle ScholarCross RefCross Ref
  16. A. Valmari. The state explosion problem. newblock LNCS: Lectures on Petri Nets I: Basic Models, 1491:429--528, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. N. Kim et al. Visual Assessment of a Real-Time Systems Design: A Case Study on a CNC Controller. RTSS, pages 300--310, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. T. Ishihara and H. Yasuura. Voltage Scheduling Problem for Dynamically Variable Voltage Processors. ISLPED,1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Cai et al. Workload-Ahead-Driven Online Energy Minimization Techniques for Battery-Powered Embedded Systems with Time-Constraints. ACM Trans. on DAES , pages 1--23, July 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. B. Mochocki et al. A realistic variable voltage scheduling model for real-time applications. ICCAD , pages 726--731, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. Phatrapornnant et al. Reducing Jitter in Embedded Systems Employing a Time-Triggered Software Architecture and Dynamic Voltage Scaling. IEEE Trans. on Computers, 55(2):113--24 , 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A time petri net-based approach for hard real-time systems scheduling considering dynamic voltage scaling, overheads, precedence and exclusion relations

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SBCCI '07: Proceedings of the 20th annual conference on Integrated circuits and systems design
            September 2007
            382 pages
            ISBN:9781595938169
            DOI:10.1145/1284480

            Copyright © 2007 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 3 September 2007

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate133of347submissions,38%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader