Skip to main content
SpringerLink
Log in

Resource access control for dynamic priority distributed real-time systems

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Many of today’s complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this demand, the Object Management Group’s (OMG) Real-Time Special Interest Group (RT SIG) has worked to extend the Common Object Request Broker Architecture (CORBA) standard to include real-time specifications. This group’s most recent efforts focus on the requirements of dynamic distributed real-time systems. One open problem in this area is resource access synchronization for tasks employing dynamic priority scheduling.

This paper presents two resource synchronization protocols that meet the requirements of dynamic distributed real-time systems as specified by Dynamic Scheduling Real-Time CORBA 2.0 (DSRT CORBA). The proposed protocols can be applied to both Earliest Deadline First (EDF) and Least Laxity First (LLF) dynamic scheduling algorithms, allow distributed nested critical sections, and avoid unnecessary runtime overhead. These protocols are based on (i) distributed resource preclaiming that allocates resources in the message-based distributed system for deadlock prevention, (ii) distributed priority inheritance that bounds local and remote priority inversion, and (iii) distributed preemption ceilings that delimit the priority inversion time further.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baker TP (1990) A stack-based resource allocation policy for realtime processes. In Proc. 11th IEEE real-time systems symposium

  • Burns A, Prasad D, Bondavalli A, Di. Giandomenico F, Ramamritham K, Stankovic JA, Strigini L (2000) The meaning and role of value in scheduling flexible real-time systems. Journal of Systems Architecture 46:305–325

    Article  Google Scholar 

  • Buttazzo G, Spuri M, Sensini F (1995) Value vs. deadline scheduling in overload conditions. In: Proc. 16th IEEE real-time systems symposium, pp 90–99

  • Chen MI, Lin KJ (1990) Dynamic priority ceiling: A concurrency control protocol for real-time systems. Real-Time Systems 2:325–346

    Article  Google Scholar 

  • Dertouzos ML (1974) Control robotics: The procedural control of physical processes. In: Proc. international federation for information processing, pp 807–813

  • Gill CD, Levine DL, Schmidt DC (2001) The design and performance of a real-time CORBA scheduling service. Real-Time Systems, special issue on Real-Time Middleware

  • Goosens J, Devillers R, Funk S (2002) Tie-breaking for EDF on multiprocessor platforms. In: Proc. of the 23rd IEEE real-time systems symposium, austin, Texas

  • Hermant JF, Leboucher L, Rivierre N (1996) Real-time fixed and dynamic priority driven scheduling algorithms: Theory and experience. INRIA Research Report RR-3081

  • Hou ESH, Ansari N, Ren H (1994) A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 5(2):113–120

    Google Scholar 

  • Korf R (1985) Depth first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27(3):97–109

    Article  MATH  MathSciNet  Google Scholar 

  • Leinbaugh DW (1980) Guaranteed response time in a hard real-time environment. IEEE Transactions on Software Engineering SE-6

  • Leung JYT, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic real-time Tasks. Journal of Performance Evaluation 4(2):237–250

    Article  MathSciNet  Google Scholar 

  • Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1):46–61

    Article  MATH  MathSciNet  Google Scholar 

  • Locke CD (1985) Best-effort decision making for real-time scheduling, Ph.D. dissertation, Carnegie Mellon University.

  • Lu C, Stankovic JA, Tao G, Son SH (1999) Design and evaluation of a feedback control EDF scheduling algorithm. In: 20th IEEE real-time systems symposium

  • Mok AK (1983) Fundamental design problems of distributed systems for the hard real-time environment, Ph.D. Thesis, Dept. of EECS, MIT

  • Montana D, Brinn M, Bidwell G, Moore S (1998) Genetic algorithms for complex, real-time scheduling. IEEE Conference on Systems, Man, and Cybernetics

  • Mueller F (1999) Priority inheritance and ceilings for distributed mutual exclusion. IEEE Real-Time Systems Symposium, 340–349

  • Nossal R, Galla T (1997) Solving NP-complete problems in real-time system design by multichromosome genetic algorithms. In: Proc. of the ACM SIGPLAN workshop on languages, compilers, and tools for real-time systems, pp 68–76

  • OMG (1999) Real-time CORBA 2.0: Dynamic Scheduling Specification

  • OMG (2001) Common Object Request Broker Architecture (CORBA), v2.4.1

  • OMG (2004) Common Object Request Broker Architecture (CORBA), v3.0.3

  • Rajkumar R (1991) Synchronization in real-time systems: A priority inheritance approach. Kluwer

  • Ramamritham K, Stankovic JA, Shiah PF (1990) Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 1(2):184–194

    Google Scholar 

  • Ramamritham K, Stankovic JA (1994) Scheduling algorithms and operating systems support for real-time systems. Proc. of the IEEE 55–67

  • Rhee I, Martin G (1995) A scalable real-time synchronization protocol for distributed systems. In 16th IEEE real-time systems symposium, pp 18–27

  • Sha L, Rajkumar R, Lehoczky J, Ramamritham K (1988) Mode change protocols for priority-driven preemptive scheduling. Technical Report, Carnegie Mellon University, CMU/SEI-88-TR-034/ESD-TR-88-035

  • Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Transactions on Computers 39(9):1175–1185

    Article  MathSciNet  Google Scholar 

  • Spuri M, Stankovic JA (1994) How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Transactions on Computers 43(12):1407–1412

    Article  Google Scholar 

  • Squadrito M, Esibov L, DiPippo LC (1998) The affected set priority ceiling protocols for real-time object-oriented concurrency control. University of Rhode Island Technical Report TR96-250

  • Stankovic J, Ramamritham K (1991) The spring kernel: A new paradigm for real-time systems. IEEE Software 8(3):62–72

    Article  Google Scholar 

  • Sun J (1997) Fixed-priority end-to-end Scheduling in distributed real-time systems, Ph.D. Thesis, Computer Science, UIUC

  • Zhang C, Cordes D (2004) Simulation of resource synchronization in a dynamic real-time distributed computing environment. Concurrency and Computation: Practice and Experience. John Wiley & Sons, Ltd, vol. 16, pp 1433–1451

Download references

Author information

Authors and Affiliations

  1. Department of CIS, Bryant University, 1150 Douglas Pike, Smithfield, RI, 02917-1284

    Chen Zhang & David Cordes

Authors
  1. Chen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Cordes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chen Zhang.

Additional information

Chen Zhang is an Assistant Professor of Computer Information Systems at Bryant University. He received his M.S. and Ph.D. in Computer Science from the University of Alabama in 2000 and 2002, a B.S. from Tsinghua University, Beijing, China. Dr. Zhang’s primary research interests fall into the areas of distributed systems and telecommunications. He is a member of ACM, IEEE and DSI.

David Cordes is a Professor of Computer Science at the University of Alabama; he has also served as Department Head since 1997. He received his Ph.D. in Computer Science from Louisiana State University in 1988, an M.S. in Computer Science from Purdue University in 1984, and a B.S. in Computer Science from the University of Arkansas in 1982. Dr. Cordes’s primary research interests fall into the areas of software engineering and systems. He is a member of ACM and a Senior Member of IEEE.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, C., Cordes, D. Resource access control for dynamic priority distributed real-time systems. Real-Time Syst 34, 101–127 (2006). https://doi.org/10.1007/s11241-006-8642-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-006-8642-5

Keywords

Search

Navigation