skip to main content
10.1145/1363686.1363766acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

A behavior priority driven approach for resource reservation scheduling

Published:16 March 2008Publication History

ABSTRACT

In this paper a behavioral distinction of soft real-time tasks is introduced. The distinction is based on the behavior of the previous instance of each task and it is used to propose a scheduling algorithm. The algorithm, called BIDS, uses well-known server mechanisms with an extension to handle two priority queues within each server. The priority of a server is managed accordingly to the result that its associated task produce. Along with the formal presentation of the algorithm and the proofs of its properties some performance evaluations based on simulations are included.

References

  1. L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proceedings of the 19th IEEE RTSS, Madrid, Spain, 1998. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Cervin and J. Eker. The control server: A computational model for real-time control tasks. In Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS'03), page 113, Los Alamitos, CA, USA, 2003. IEEE Computer Society.Google ScholarGoogle ScholarCross RefCross Ref
  3. R. Davis and A. J. Wellings. Dual priority scheduling. In In Proceedings of the 16th IEEE RTSS, Pisa, Italy, 1995. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Institute of Electrical and Electronics Engineers. IEEE P1451.2 D2.01 IEEE Draft Standard for A Smart Transducer Interface for Sensors and Actuators - Transducer to Microprocessor Communication Protocols and Transducer Electronic Data Sheet (TEDS) Formats, august 1996.Google ScholarGoogle Scholar
  5. H. Jin, Q. Hu, X. Liao, H. Chen, and D. Deng. Imac: an importance-level based adaptive cpu scheduling scheme for multimedia and non-real time applications. In Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005). IEEE Computer Society, January 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. Kosugi, A. Mitsuzawa, and M. Tokoro. Importance-based scheduling for predictable real-time systems using mart. In Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems, pages 95--100, Washington, DC, USA, April 1996. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Marzario, G. Lipari, P. Balbastre, and A. Crespo. Iris: A new reclaiming algorithm for server-based real-time systems. In Proceedings of the 10th IEEE RTAS, Toronto, Canada, 2004. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Nolte, M. Nolin, and H. Hansson. Real-time server-based communication with can. IEEE Transactions on Industrial Informatics, 1(3):192--201, august 2005.Google ScholarGoogle Scholar
  10. J. Real and A. Crespo. Mode change protocols for real-time systems: A survey and a new proposal. Real-Time Systems, 26(2):161--197, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A behavior priority driven approach for resource reservation scheduling

      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
        SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
        March 2008
        2586 pages
        ISBN:9781595937537
        DOI:10.1145/1363686

        Copyright © 2008 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: 16 March 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

        Upcoming Conference

        SAC '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader