Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1289927.1289970acmconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
Article

SIRAP: a synchronization protocol for hierarchical resource sharingin real-time open systems

Published: 30 September 2007 Publication History

Abstract

This paper presents a protocol for resource sharing in a hierarchical real-time scheduling framework. Targeting real-time open systems, the protocol and the scheduling framework significantly reduce the efforts and errors associated with integrating multiple semi-independent subsystems on a single processor. Thus, our proposed techniques facilitate modern software development processes, where subsystems are developed by independent teams (or subcontractors) and at a later stage integrated into a single product. Using our solution, a subsystem need not know, and is not dependent on, the timing behaviour of other subsystems; even though they share mutually exclusive resources. In this paper we also prove the correctness of our approach and evaluate its efficiency.

References

[1]
L. Almeida and P. Pedreiras. Scheduling within temporal partitions: response-time analysis and server design. In Proc. of the Fourth ACM International Conference on Embedded Software, September 2004.
[2]
D. Andrews, I. Bate, T. Nolte, C. M. O. Pérez, and S. M. Petters. Impact of embedded systems evolution on RTOS use and design. In GLipari, editor, Proceedings of the 1st International Workshop Operating System Platforms for Embedded Real-Time Applications (OSPERT'05) in conjunction with the 17th Euromicro International Conference on Real-Time Systems (ECRTS'05), pages 13--19, Palma deMallorca, Balearic Islands, Spain, July 2005.
[3]
T. P. Baker. Stack-based scheduling of realtime processes. Real-Time Systems, 3(1):67--99, March 1991.
[4]
M. Bertogna, N. Fisher, and S. Baruah. Static-priority scheduling and resource hold times. In Proceedings of the 15th International Workshop on Parallel and Distributed Real-Time Systems, Long Beach, CA, March 2007.
[5]
R. J. Bril, W. F. J. Verhaegh, and C. C. Wust. A cognac-glass algorithm for conditionally guaranteed budgets. In RTSS '06: Proceedings of the 27th IEEE International Real-Time Systems Symposium, pages 388--400, 2006.
[6]
M. Caccamo and L. Sha. A periodic servers with resource constraints. In IEEE Real-Time Systems Symposium, pages 161--170, 2001.
[7]
R. I. Davis and A. Burns. Hierarchical fixed priority pre-emptive scheduling. In Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05), December 2005.
[8]
R. I. Davis and A. Burns. Resource sharing in hierarchical fixed priority pre-emptive systems. In Proceedings of the 27th IEEE International Real-Time Systems Symposium (RTSS'06), December 2005.
[9]
Z. Deng and J. W.-S. Liu. Scheduling real-time applications in an open environment. In Proc. of IEEE Real-Time Systems Symposium, pages 308--319, December 1997.
[10]
X. Feng and A. Mok. A model of hierarchical real-time virtual resources. In Proc. of IEEE Real-Time Systems Symposium, pages 26--35, December 2002.
[11]
N. Fisher, M. Bertogna, and S. Baruah. Resource-locking durations in edf-scheduled systems. In 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07), pages 91--100, 2007.
[12]
P. Holman and J. H. Anderson. Locking under pfair scheduling. ACM Trans. Comput. Syst., 24(2):140--174, 2006.
[13]
M. Joseph and P. Pandya. Finding response times in a real-time system. The Computer Journal (British Computer Society), 29(5):390--395, October 1986.
[14]
H. Kopetz, R. Obermaisser, P. Peti, and N. Suri. From a federated to an integrated architecture for dependable embedded real-time systems. Technical Report 22, Technische Universität at Wien, Institut für Technische Informatik, Treitlstr. 1-3/182-1, 1040 Vienna, Austria, 2004.
[15]
T.-W. Kuo and C. Li. A fixed-priority-driven open environment for real-time applications. In Proc. of IEEE Real-Time Systems Symposium, pages 256--267, December 1999.
[16]
G. Lipari and S. Baruah. Efficient scheduling of real-time multi-task applications in dynamic systems. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 166--175, May 2000.
[17]
G. Lipari and E. Bini. Resource partitioning among real-time applications. In Proc. of Euromicro Conference on Real-Time Systems, July 2003.
[18]
G. Lipari, J. Carpenter, and S. Baruah. A framework for achieving inter-application isolation in multiprogrammed hard-real-time environments. In Proc. of IEEE Real-Time Systems Symposium, December 2000.
[19]
G. Lipari, P. Gai, M. Trimarchi, G. Guidi, and P. Ancilotti. A hierarchical framework for component-based real-time systems. In Component-Based Software Engineering, volume LNCS-3054/2004, pages 209--216. Springer Berlin / Heidelberg, May 2005.
[20]
S. Matic and T. A. Henzinger. Trading end-to-end latency for composability. In Proc. of IEEE Real-Time Systems Symposium, pages 99--110, December 2005.
[21]
A. Mok, X. Feng, and D. Chen. Resource partition for real-time systems. In Proc. of IEEE Real-Time Technology and Applications Symposium, pages 75--84, May 2001.
[22]
R. Rajkumar, L. Sha, and J. P. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proceedings of the 9th IEEE International Real-Time Systems Symposium (RTSS'88), pages 259--269, December 1988.
[23]
S. Saewong, R. Rajkumar, J. Lehoczky, and M. Klein. Analysis of hierarchical fixed-priority scheduling. In Proc. of Euromicro Conference on Real-Time Systems, June 2002.
[24]
L. Sha, J. P. Lehoczky, and R. Rajkumar. Task scheduling in distributed real-time systems. In Proceedings of the International Conference on Industrial Electronics, Control, and Instrumentation, pages 909--916, Cambridge, MA, USA, November 1987.
[25]
I. Shin and I. Lee. Periodic resource model for compositional real-time guarantees. In Proc. of IEEE Real-Time Systems Symposium, pages 2--13, December 2003.
[26]
I. Shin and I. Lee. Compositional real-time scheduling framework. In Proc. of IEEE Real-Time Systems Symposium, December 2004.

Cited By

View all
  • (2023)On the QNX IPC: Assessing Predictability for Local and Distributed Real-Time Systems2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS58335.2023.00030(289-302)Online publication date: May-2023
  • (2023)Handling Overload ConditionsHard Real-Time Computing Systems10.1007/978-3-031-45410-3_9(263-322)Online publication date: 25-Sep-2023
  • (2021)TimeWall: Enabling Time Partitioning for Real-Time Multicore+Accelerator Platforms2021 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS52674.2021.00048(455-468)Online publication date: Dec-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EMSOFT '07: Proceedings of the 7th ACM & IEEE international conference on Embedded software
September 2007
304 pages
ISBN:9781595938251
DOI:10.1145/1289927
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 September 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. SIRAP
  2. hierarchical scheduling
  3. real-time open systems
  4. real-time subsystem integration
  5. resource sharing
  6. synchronization protocol

Qualifiers

  • Article

Conference

ESWEEK07
ESWEEK07: Third Embedded Systems Week
September 30 - October 3, 2007
Salzburg, Austria

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)13
  • Downloads (Last 6 weeks)0
Reflects downloads up to 27 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)On the QNX IPC: Assessing Predictability for Local and Distributed Real-Time Systems2023 IEEE 29th Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS58335.2023.00030(289-302)Online publication date: May-2023
  • (2023)Handling Overload ConditionsHard Real-Time Computing Systems10.1007/978-3-031-45410-3_9(263-322)Online publication date: 25-Sep-2023
  • (2021)TimeWall: Enabling Time Partitioning for Real-Time Multicore+Accelerator Platforms2021 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS52674.2021.00048(455-468)Online publication date: Dec-2021
  • (2021)AI Meets Real-Time: Addressing Real-World Complexities in Graph Response-Time Analysis2021 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS52674.2021.00019(82-96)Online publication date: Dec-2021
  • (2021)Toward Practical Weakly Hard Real-Time Systems: A Job-Class-Level Scheduling ApproachIEEE Internet of Things Journal10.1109/JIOT.2021.30582158:8(6692-6708)Online publication date: 15-Apr-2021
  • (2020)Timing isolation and improved scheduling of deep neural networks for real‐time systemsSoftware: Practice and Experience10.1002/spe.284050:9(1760-1777)Online publication date: Jun-2020
  • (2019)Job-Class-Level Fixed Priority Scheduling of Weakly-Hard Real-Time Systems2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2019.00028(241-253)Online publication date: Apr-2019
  • (2018)An industrial view on the common academic understanding of mixed-criticality systemsReal-Time Systems10.1007/s11241-018-9308-954:3(745-795)Online publication date: 1-Jul-2018
  • (2017)Deriving the average-case performance of bandwidth-like interfaces for tasksets with infinite minimum inter-arrival time, equal task density, uniformly distributed deadlines, and infinite number of tasksACM SIGBED Review10.1145/3166227.316622914:3(16-23)Online publication date: 22-Nov-2017
  • (2017)Toward a Practical Regularity-based ModelACM Transactions on Embedded Computing Systems10.1145/309294516:4(1-25)Online publication date: 14-Aug-2017
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media