skip to main content
10.1145/2513228.2513236acmconferencesArticle/Chapter ViewAbstractPublication PagesracsConference Proceedingsconference-collections
research-article

Scheduling algorithm with energy-response trade-off considerations for mixed task sets

Authors Info & Claims
Published:01 October 2013Publication History

ABSTRACT

This paper aims to investigate the scheduling problem of a mixed task set consisting of periodic tasks and aperiodic jobs in a real-time system. When a mixed task set is executed, a scheduling algorithm has to consider not only the system energy consumption but also the response time of the aperiodic jobs which do not want to be prolonged seriously. This paper proposes the Ratio Reclaim Algorithm (RRA) that reclaims the unused execution time for periodic jobs based on a user-defined ratio. For the convenience of maintaining effectively unused execution time left by early completed jobs, the earliness-queue is presented to reduce the memory space that the earliness-queue occupies. A series of experiments are conducted to evaluate the proposed algorithm. The experimental results demonstrate that the RRA scheme with a suitable user-defined value has a better performance than the compared scheme.

References

  1. H. Aydin, R. Melhem, D. Mosse, and P. Alvarez. Power-aware scheduling for periodic real-time tasks. IEEE TRANSACTIONS ON COMPUTERS, 53(5):584--600, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. Aydin and Q. Yang. Energy-responsiveness tradeoffs for real-time systems with mixed workload. In IEEE Real-Time and Embedded Technology and Applications Symposium, pages 74--83, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Ellis. The case for higher-level power management. In Workshop on Hot Topics in Operating Systems, pages 162--167, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. I. Hong, G. Qu, M. Potkonjak, and M. Srivastava. Synthesis techniques for low-power hard real-time systems on variable voltage processors. In The 19th IEEE Real-Time Systems Symposium, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Li and C. Ding. Instruction balance and its relation to program energy consumption. In Proceeding of International Workshop on Languages and Compilers for Parallel Computing, pages 71--85, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, January 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. Martin and D. Siewiorek. The impact of battery capacity and memory bandwidth on cpu speed-setting: a case study. In Proceedings of the 1999 International Symposium Low Power Electronics and Design, pages 200--205, Aug. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Shin and K. Choi. Power conscious fixed priority scheduling for hard real-time systems. In Proceedings of 36th Design Automation Conference, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Spuri and G. Buttazzo. Scheduling aperiodic tasks in dynamic priority systems. Real-Time Systems, 10(2):179--210, 1996.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Scheduling algorithm with energy-response trade-off considerations for mixed task sets

      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
        RACS '13: Proceedings of the 2013 Research in Adaptive and Convergent Systems
        October 2013
        529 pages
        ISBN:9781450323482
        DOI:10.1145/2513228

        Copyright © 2013 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: 1 October 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        RACS '13 Paper Acceptance Rate73of317submissions,23%Overall Acceptance Rate393of1,581submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader