DOCSLIB.ORG

Generalized Rate-Monotonic Scheduling Theory: a Framework for Developing Real-Time Systems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Generalized Rate-Monotonic Scheduling Theory: a Framework for Developing Real-Time Systems Generalized Rate-Monotonic Scheduling Theory: A Framework for Developing Real-Time Systems LUI SHA, SENIOR MEMBER, IEEE, RAGUNATHAN RAJKUMAR, AND SHIRISH S. SATHAYE Invited Paper Real-time computing systems are used to control telecommuni- Stability under transient overload. When the system is cation systems, defense systems, avionics, and modern factories. overloaded by events and it is impossible to meet all Generalized rate-monotonic scheduling theory is a recent devel- the deadlines, we must still guarantee the deadlines of opment that has had large impact on the development of real-time systems and open standards. In this paper we provide an up- selected critical tasks. to-date and selfcontained review of generalized rate-monotonic Real-time scheduling is a vibrant field. Several important scheduling theory. We show how this theory can be applied in research efforts are summarized in [25] and [26]. Among practical system development, where special attention must be them, Generalized Rate Monotonic Scheduling (GRMS) given to facilitate concurrent development by geographically dis- tributed programming teams and the reuse of existing hardware theory is a useful tool that allows system developers to and software components. meet the above measures by managing system concur- rency and timing constraints at the level of tasking and message passing’. In essence, this theory ensures that I. INTRODUCTION as long as the system utilization of all tasks lies below Real-time computing systems are critical to an industrial- a certain bound, and appropriate scheduling algorithms ized nation’s technological infrastructure. Modern telecom- are used, all tasks meet their deadlines. This puts the munication systems, factories, defense systems, aircraft development and maintenance of real-time systems on an and airports, space stations, and high-energy physics ex- analytic, engineering basis, making these systems easier to periments cannot operate without them. Indeed, real-time develop and maintain. GRMS was used by several major computing systems control the very systems that keep high-technology projects including Space Station Program us productive, and enable us to explore new frontiers of [ 111 and the European Space Agency on-board operating science and engineering. systems [8]. It is a recommended approach for using the In real-time applications, the correctness of a computation IEEE Futurebus+ in real-time applications [ 101. Some basic depends upon not only its results but also the time at which primitives of GRMS such as the basic priority inheritance outputs are generated. The measures of merit in a real-time protocol [23] and the priority ceiling protocol emulation system include: [20] have been selectively adopted in POSIX.4a, POSIXAb, Predictably fast response to urgent events. and Ada9x. High degree of schedulability. Schedulability is the To apply GRMS in the real world, some practical prob- degree of resource utilization at or below which the lems must be addressed. For example, the development timing requirements of tasks can be ensured. It can of large, complex systems requires several teams of pro- be thought as a measure of the number of timely grammers, often distributed across several geographical transactions per second. regions. To facilitate the practice of concurrent engineering, we introduce the principle of decoupling in our soft- Manuscript received July 13, 1993.The Software Engineering Institute, ware architecture. First, when possible we structure the Camegie Mellon University, Pittsburgh, PA, is sponsored by the U.S. Department of Defense (DoD). This work is funded in part by the Office ’ The GRMS approach is cited in the Selected Accomplishments section of Naval Research. The work of S. S. Sathaye was done while the author of the National Research Council’s 1992 report, “A broader agenda for was a Ph.D. candidate at Camegie Mellon University, supported by Digital computer science and engineering.” Furthermore, DoD’s 1991 Software Equipment Corporation’s Graduate Engineering Education Program. Technology Strategy Plan page 8-15 refers to the GRMS approach as L. Sha and R. Rajkumar are with the Software Engineering Institute, a “major payoff’ and states that “system designers can use this theory Camegie Mellon University, Pittsburgh PA 15213. to predict whether task deadlines will be met long before the costly S. S. Sathaye is with Digital Equipment Corporation, Network Archi- implementation phase of a project begins. It also eases the process of tecture & Performance Group, Littleton, MA 01460. making modifications to application software because changes are made IEEE Log Number 9214155. in a well-understood conceptual framework ... .” 00 18-92 19/94$O4.00 0 1994 IEEE 68 PROCEEDINGS OF THE IEEE, VOL. 82. NO. I, JANUARY 1994 Remote AudioWib 11. OF GRMS THEORY Sensor Monitoring SECTIONOVERVIEW In this section, we review basic results which allow us to design a distributed real-time system. We give a brief I I overview of scheduling independent tasks in a centralized environment. We then address the issue of task synchro- FDDI NETWORK nization and the effect of having task deadlines before the end of their periods. A periodic task T~ is characterized by a worst case computation time C, and a period T,. Unless mentioned otherwise, we assume that a periodic task must be finished by the end of its period. Tasks are independent if they do not need to synchronize with each other. A real-time system I typically consists of both periodic and aperiodic tasks. By ink+--- using either a simple polling procedure or a more advanced I- technique, such as a sporadic server [24], the scheduling Fig. 1. Block diagram of distributed real-time system. of aperiodic tasks can be treated within the rate-monotonic framework. A. Scheduling Independent Tasks system in such a way that the scheduling of each re- source can be viewed as if it were a stand-alone re- To analyze if a set of independent periodic tasks is source. Secondly, we separate the software constructs deal- schedulable, we introduce the following theorem [ 141. ing with timing (e.g., tasking) from constructs deadling Theorem I A set of n independent periodic tasks sched- with functionality. This helps to contain the impact of uled by the rate-monotonic algorithm will always meet their deadlines for all task start times, if changes. Budget considerations often require that off-the- C1 c2 c,, shelf hardware and software components be used in place - + - +.. + - 5 n(2'/" - 1) of custom-crafted solutions. To deal with the software reuse TI Tl T,, problem, we develop the notion of scheduling abstraction where C, is the execution time and Ti is the period of task r, . for hardware and software so that application developers C,/T, is the utilization of the resource by task 7%.The have a consistent scheduling interface that allows them bound on the utilization n (2'ln - 1) rapidly converges to to develop applications as if every sub-system supports In 2 = 0.69 as n becomes large. The bound of Theorem GRMS. 1 is very pessimistic because the worst case task set is Figure 1 represents a high-level view of our example contrived and is unlikely to be encountered in practice. The application, which will be presented and solved in detail average schedulable utilization is 88% [12]. The remaining later in this paper. Since there is no current widely utilization can still be used by background tasks with low available standard network that supports GRMS, we priority. Finally, the schedulable utilization of a given task build our example system around the ANSI X3T9.5 set can be improved by the use of the period transformation FDDI network as shown. Since Futurebus+ (IEEE 896 technique illustrated in Section 11-C. To determine if tasks family of standards) and POSIX.4a support the use scheduled on a resource with utilization greater than the of GRMS for real-time applications, we use them in bound of Theorem 1 can meet their deadlines, we can use an our example as the station backplane and operating exact schedulability test based on the critical zone theorem system, respectively. From the application viewpoint, (rephrased from [ 141): our example consists of both classical real-time surveil- Theorem 2 For a set of independent periodic tasks, if a lance and control applications, and emerging multimedia task r, meets its first deadline D, 5 T,,when all the higher priority tasks are started at the same time, then it meets all its applications. future deadlines with any other task start times. The rest of the paper is organized as follows. Section I1 It is important to note that Theorem 2 applies to any presents an overview of generalized rate-monotonic theory static priority assignment, not just rate-monotonic priority for centralized systems. Section 111 describes the theoretical assignment. To check if a task can meet its first deadline extensions necessary for applying GRMS to a distributed we describe the following argument from [12]. Consider system. Section IV discusses some key architectural con- any task r, with a period T,, deadline T,, and cepts for real-time software, and introduces the notion of D, 5 computation C,. Let tasks 71 to r,-1 have higher priorities scheduling abstractions, which is a technique to use and than 7,. Note that at any time t, the total cumulative analyze existing subsystems that are not designed to support demand on CPU time by these n tasks is GRMS. This is a very important aspect in the application of this theory to real-world systems. Section V describes a comprehensive example that illustrates task scheduling within subsystems as well as end-to-end scheduling in a large real-time system. Finally, we make our concluding The term [t/Tjl represents the number of times task 7, remarks in Section VI. arrives in time t and therefore C,rt/Tj1 represents its SHA er U/.: GENERALIZED RATE-MONOTONIC SCHEDULING THEORY 69 B.
Load more

Recommended publications
  • Last Time Today Response Time Vs. RM Computing Response Time More Second-Priority Task I Response Time
    Last Time Today Priority-based scheduling Response time analysis Static priorities Blocking terms Dynamic priorities Priority inversion Schedulable utilization And solutions Rate monotonic rule: Keep utilization below 69% Release jitter Other extensions Response Time vs. RM Computing Response Time Rate monotonic result WC response time of highest priority task R Tells us that a broad class of embedded systems meet their 1 time constraints: R1 = C 1 • Scheduled using fixed priorities with RM or DM priority Hopefully obvious assignment • Total utilization not above 69% WC response time of second-priority task R 2 However, doesn’t give very good feedback about what is Case 1: R 2 ≤ T1 going on with a specific system • R2 = C 2 + C 1 Response time analysis R T T Tells us for each task, what is the longest time between R1 2 1 2 when it is released and when it finishes Then these can be compared with deadlines 1 1 Gives insight into how close the system is to meeting / not 2 meeting its deadline Is more precise (rejects fewer systems) More Second-Priority Task i Response Time Case 2: T 1 < R 2 ≤ 2T 1 General case: R = C + 2C Ri 2 2 1 Ri = Ci + ∑ Cj j ∀j∈hp (i) T R1 T1 R2 2T 1 T2 1 1 1 hp(i) is the set of tasks with priority higher than I 2 2 Only higher-priority tasks can delay a task Case 3: 2T 1 < R 2 ≤ 3T 1 Problem with using this equation in practice? R2 = C 2 + 3C 1 General case of the second-priority task: R2 = C 2 + ceiling ( R 2 / T 1 ) C 1 1 Computing Response Times Response Time Example Rewrite
    [Show full text]
  • Preemption-Based Avoidance of Priority Inversion for Java
    Preemption-Based Avoidance of Priority Inversion for Java Adam Welc Antony L. Hosking Suresh Jagannathan [email protected] [email protected] [email protected] Department of Computer Sciences Purdue University West Lafayette, IN 47906 Abstract their actions via mutual exclusion locks. The resulting programming model is reasonably simple, Priority inversion occurs in concurrent programs when but unfortunately unwieldy for large-scale applications. A low-priority threads hold shared resources needed by some significant problem with using low-level, lock-based syn- high-priority thread, causing them to block indefinitely. chronization primitives is priority inversion. We propose a Shared resources are usually guarded by low-level syn- new solution for priority inversion that exploits close coop- chronization primitives such as mutual-exclusion locks, eration between the compiler and the run-time system. Our semaphores, or monitors. There are two existing solu- approach is applicable to any language that offers the fol- tions to priority inversion. The first, establishing high- lowing mechanisms: level scheduling invariants over synchronization primitives to eliminate priority inversion a priori, is difficult in practice • Multithreading: concurrent threads of control execut- and undecidable in general. Alternatively, run-time avoid- ing over objects in a shared address space. ance mechanisms such as priority inheritance still force • Synchronized sections: lexically-delimited blocks high-priority threads to wait until desired resources are re- of code, guarded by dynamically-scoped monitors. leased. Threads synchronize on a given monitor, acquiring it We describe a novel compiler and run-time solution to on entry to the block and releasing it on exit.
    [Show full text]
  • Real-Time Operating Systems (RTOS)
    Real-Time Operating Systems (RTOS) 101 Real-Time System Characteristics RTOS Architecture Rate Monotonic • A real-time system is a computer system which is required by its specification to adhere to: Scheduling (RMS) – functional requirements (behavior) • A priority is assigned based on the inverse of its pe- – temporal requirements (timing constraints, deadlines) riod • Specific deterministic timing (temporal ) requirements – Shorter execution periods = higher priority – “Deterministic" timing means that RTOS services consume only – Longer execution periods = lower priority known and expected amounts of time. • Common way to assign fixed priorities • Small size (footprint) – If there is a fixed-priority schedule that meets all dead- lines, then RMS will produce a feasible schedule Types of Real-Time Systems • Simple to understand and implement • A generic real-time system requires that results be produced RTOS Task Services • P1 is assigned a higher priority than P2. within a specified deadline period. • An embedded system is a computing device that is part of a • Scheduling and Dispatching larger system. • Inter-task Communication • A safety-critical system is a real-time system with catastro- phic results in case of failure. • Memory System Management • A hard real-time system guarantees that real-time tasks be Earliest Deadline First (EDF) • Input / Output System Management completed within their required deadlines. Failure to meet a single deadline may lead to a critical catastrophic system • Scheduling Time Management & Timers failure such as physical damage or loss of life. • Priorities are assigned according to deadlines: • Error Management • A firm real-time system tolerates a low occurrence of missing – the earlier the deadline, the higher the priority a deadline.
    [Show full text]
  • Real-Time Operating System (RTOS)
    Real-Time Operating System ELC 4438 – Spring 2016 Liang Dong Baylor University RTOS – Basic Kernel Services Task Management • Scheduling is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communication bandwidth). • The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (executing more than one process at a time) and multiplexing (transmit multiple data streams simultaneously across a single physical channel). Task Management • Polled loops; Synchronized polled loops • Cyclic Executives (round-robin) • State-driven and co-routines • Interrupt-driven systems – Interrupt service routines – Context switching void main(void) { init(); Interrupt-driven while(true); } Systems void int1(void) { save(context); task1(); restore(context); } void int2(void) { save(context); task2(); restore(context); } Task scheduling • Most RTOSs do their scheduling of tasks using a scheme called "priority-based preemptive scheduling." • Each task in a software application must be assigned a priority, with higher priority values representing the need for quicker responsiveness. • Very quick responsiveness is made possible by the "preemptive" nature of the task scheduling. "Preemptive" means that the scheduler is allowed to stop any task at any point in its execution, if it determines that another task needs to run immediately. Hybrid Systems • A hybrid system is a combination of round- robin and preemptive-priority systems. – Tasks of higher priority can preempt those of lower priority. – If two or more tasks of the same priority are ready to run simultaneously, they run in round-robin fashion. Thread Scheduling ThreadPriority.Highest ThreadPriority.AboveNormal A B ThreadPriority.Normal C ThreadPriority.BelowNormal D E F ThreadPriority.Lowest Default priority is Normal.
    [Show full text]
  • Guaranteeing Real-Time Performance Using Rate Monotonic Analysis
    Carnegie Mellon University Software Engineering Institute Guaranteeing Real-Time Performance Using Rate Monotonic Analysis Embedded Systems Conference September 20-23, 1994 Presented by Ray Obenza Software Engineering Institute Carnegie Mellon University Pittsburgh PA 15213 Sponsored by the U.S. Department of Defense Carnegie Mellon University Software Engineering Institute Rate Monotonic Analysis Introduction Periodic tasks Extending basic theory Synchronization and priority inversion Aperiodic servers Case study: BSY-1 Trainer 1 Introduction Carnegie Mellon University Software Engineering Institute Purpose of Tutorial Introduce rate monotonic analysis Explain how to perform the analysis Give some examples of usage Convince you it is useful 2 Introduction Carnegie Mellon University Software Engineering Institute Tutorial Format Lecture Group exercises Case study Questions welcome anytime 3 Introduction Carnegie Mellon University Software Engineering Institute RMARTS Project Originally called Real-Time Scheduling in Ada Project (RTSIA). • focused on rate monotonic scheduling theory • recognized strength of theory was in analysis Rate Monotonic Analysis for Real-Time Systems (RMARTS) • focused on analysis supported by (RMS) theory • analysis of designs regardless of language or scheduling approach used Project focused initially on uniprocessor systems. Work continues in distributed processing systems. 4 Introduction Carnegie Mellon University Software Engineering Institute Real-Time Systems Timing requirements • meeting deadlines Periodic
    [Show full text]
  • RTOS Northern Real Time Applications (NRTA)
    By N.J. Keeling, Director of Marketing, RTOS Northern Real Time Applications (NRTA). Missed it! - How Priority Inversion messes up real-time performance and how the Priority Ceiling Protocol puts it right. In hard real-time systems it is important that everything runs on-time, every time. To do this efficiently it is necessary to make sure urgent things are done before less urgent things. When code is developed using a real-time operating system (RTOS) that offers pre-emptive scheduling, each task can be allocat- ed a level of priority. The best way to set the priority of each task is according to the urgency of the task: the most urgent task gets the highest priority (this ordering scheme is known as Deadline Monotonic). PRE-EMPTIVE MULTI-TASKING there is a requirement for data to be shared between ulti-tasking through use of an RTOS sched- the various tasks in the application. Clearly this is a typ- uler enables the processor to be shared ical situation: imagine an I/O data stream that is imple- M between a number of tasks in an applica- mented with two tasks. The first (called H) is a high pri- tion. In most priority schemes the scheduler is pre- ority task and drives communications hardware. It emptive: a task of a higher priority will 'break in' on the takes data from a buffer and places it onto a network. execution of lower priority tasks and take over the The task needs to run and finish by a short deadline, processor until it finishes or is pre-empted in its turn by which is why it has a high priority.
    [Show full text]
  • Multitasking and Real-Time Scheduling
    Multitasking and Real-time Scheduling EE8205: Embedded Computer Systems http://www.ee.ryerson.ca/~courses/ee8205/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrical and Computer Engineering Ryerson University Overview • RTX - Preemptive Scheduling • Real-time Scheduling Techniques . Fixed-Priority and Earliest Deadline First Scheduling • Utilization and Response-time Analysis • Priority Inversion • Sporadic and Aperiodic Process Scheduling Chapter 6 of the Text by Wolf, Chapter 13 of Text by Burns and Wellings and Keil-RTX documents © G. Khan Embedded Computer Systems–EE8205: Real-time Scheduling Page: 1 Priority-driven Scheduling Rules: • each process has a fixed priority (1 lowest); • highest-priority ready process gets CPU; • process continues until done. Processes • P1: priority 3, execution time 10 • P2: priority 2, execution time 30 • P3: priority 1, execution time 20 P3 ready t=18 P2 ready t=0 P1 ready t=15 P2 P1 P2 P3 time 0 10 20 30 40 50 60 © G. Khan Embedded Computer Systems–EE8205: Real-time Scheduling Page: 2 RTX Scheduling Options RTX allows us to build an application with three different kernel- scheduling options: • Pre-Emptive scheduling Each task has a different priority and will run until it is pre- empted or has reached a blocking OS call. • Round-Robin scheduling Each task has the same priority and will run for a fixed period, or time slice, or until has reached a blocking OS call. • Co-operative multi-tasking Each task has the same priority and the Round-Robin is disabled. Each task will run until it reached a blocking OS call or uses the os_tsk_pass() call.
    [Show full text]
  • Lock-Free Programming
    Lock-Free Programming Geoff Langdale L31_Lockfree 1 Desynchronization ● This is an interesting topic ● This will (may?) become even more relevant with near ubiquitous multi-processing ● Still: please don’t rewrite any Project 3s! L31_Lockfree 2 Synchronization ● We received notification via the web form that one group has passed the P3/P4 test suite. Congratulations! ● We will be releasing a version of the fork-wait bomb which doesn't make as many assumptions about task id's. – Please look for it today and let us know right away if it causes any trouble for you. ● Personal and group disk quotas have been grown in order to reduce the number of people running out over the weekend – if you try hard enough you'll still be able to do it. L31_Lockfree 3 Outline ● Problems with locking ● Definition of Lock-free programming ● Examples of Lock-free programming ● Linux OS uses of Lock-free data structures ● Miscellanea (higher-level constructs, ‘wait-freedom’) ● Conclusion L31_Lockfree 4 Problems with Locking ● This list is more or less contentious, not equally relevant to all locking situations: – Deadlock – Priority Inversion – Convoying – “Async-signal-safety” – Kill-tolerant availability – Pre-emption tolerance – Overall performance L31_Lockfree 5 Problems with Locking 2 ● Deadlock – Processes that cannot proceed because they are waiting for resources that are held by processes that are waiting for… ● Priority inversion – Low-priority processes hold a lock required by a higher- priority process – Priority inheritance a possible solution L31_Lockfree
    [Show full text]
  • Comparison of CPU Scheduling in Vxworks and Lynxos
    Comparison of CPU scheduling in VxWorks and LynxOS Henrik Carlgren Ranjdar Ferej [email protected] [email protected] Abstract The main objective of a scheduler in a hard real-time system is that tasks are finished before their deadline. A secondary objective is to do this as effective as possible. This comparison will look into how the two well known hard real-time systems; VxWorks and LynxOS handle the CPU scheduling problem. This comparison will also look into reason to why some problems are solved in similar ways and why some are solved in different ways. Introduction The CPU scheduling problem in hard real-time systems consists of a few smaller problems, to most of the problems there is a few standardised robust solutions all with their pros and cons. With this knowledge we can assume that the solutions will be quite similar and the differences will depend on the fact that the two products to some extent have different definitions of what are the most important things in a real-time operating system. The algorithms that we describe for each of the real-time operating systems will be described as clear as possible so we can see the differences that are expected to be quite small. Also reason for these differences will be explained as clearly as possible. Another interesting side of this comparison is if there are any significant differences that can be important to take into consideration when choosing a hard real-time operating system for a project with real-time requirements. LynxOS The details of the algorithms presented here are based on version 4.2 of LynxOS which conceptually should be the same as version 4.0 but with minor improvements and bug fixes.
    [Show full text]
  • Real-Time and Embedded Operating Systems What Is Real Time?
    Real-Time and Embedded Operating Systems What is Real Time? Real-time: Systems where the correctness of computation depends on the timing of the results Embedded: Systems that tightly interact with the physical world 1 Embedded and Real-Time Computing Classical Applications Advanced Embedded Systems The Next Frontier Trend: • Invisible (embedded) computing, implicit interfaces (users need only 1 mobile device – rest should be non-intrusive) • Context-aware computing (new sensors, new effectors) • Ubiquitous – instrument what we use most (attire, personal effects, …) Processors Embedded Everywhere - Transparent - Context-aware - Mobile - Miniature - Ubiquitous (Smart attire, smart spaces, …) Today 2 Embedded Networked Systems RFID Embedded Networks Device Applications Industrial Networks Networks Remote Sensing Networks Medical Networks Smart Space Networks Embedded Computing Computing occurs in physical context. It must be aware of physical real-world properties: Time Energy Physical space and context 3 So What Does “Real-Time” Mean Again? Why Predictability? Example: Going to the Airport Which route would you choose? •Route 1: 15 min ($1 Toll) •Route 2: 5 min - 45 min, with 15 min average (Free) You pay for predictability 4 The Task Model Typically, periodic tasks Each task invocation must complete before the next one starts (deadlines = periods) How to Ensure Predictability? Real-time operating systems are distinguished by mechanisms they use to ensure predictable task execution 5 Predictability: Mechanism #1: Scheduling Real-time operating systems feature predictable scheduling policies Utilization Bounds Intuitively, for a given scheduling policy: The lower the processor utilization, U, the easier it is to meet deadlines. The higher the processor utilization, U, the more difficult it is to meet deadlines.
    [Show full text]
  • Alleviating Priority Inversion and Non-Determinism in Real-Time CORBA ORB Core Architectures 1 Introduction 2 Real-Time ORB Core
    Alleviating Priority Inversion and Non-determinism in Real-time CORBA ORB Core Architectures Douglas C. Schmidt, Sumedh Mungee, Sergio Flores-Gaitan, and Aniruddha Gokhale g fschmidt,sumedh,sergio,gokhale @cs.wustl.edu Department of Computer Science, Washington University St. Louis, MO 63130, USA th This paper appeared in the proceedings of 4 IEEE Real- is the component in the CORBA reference model that man- time Technology and Applications Symposium (RTAS), Den- ages transport connections, delivers client requests to an Ob- ver, Colorado, June 3-5, 1998. ject Adapter, and returns responses (if any) to clients. The ORB Core also typically implements the transport endpoint Abstract demultiplexing and concurrency architecture used by applica- tions. Figure 1 illustrates how an ORB Core interacts with There is increasing demand to extend Object Request Bro- other CORBA components. [2] describes each of these com- ker (ORB) middleware to support distributed applications with stringent real-time requirements. However, conventional ORB in args operation() implementations, such as CORBA ORBs, exhibit substantial CLIENT SERVANT priority inversion and non-determinism, which makes them un- out args + return value suitable for applications with deterministic real-time require- ments. This paper provides two contributions to the study and IDL DSI design of real-time ORB middleware. First, it illustrates em- SKELETON IDL DII ORB OBJECT pirically why conventional ORBs do not yet support real-time STUBS quality of service. Second, it evaluates connection and concur- INTERFACE ADAPTER rency software architectures to identify strategies that reduce ORB /IIOP priority inversion and non-determinism in real-time CORBA GIOP CORE ORBs. STANDARD INTERFACE STANDARD LANGUAGE Keywords: Real-time CORBA Object Request Broker, QoS- MAPPING enabled OO Middleware, Performance Measurements ORB-SPECIFIC INTERFACE STANDARD PROTOCOL 1 Introduction Figure 1: Components in the CORBA Reference Model Meeting the QoS needs of next-generation distributed appli- ponents in more detail.
    [Show full text]
  • Investigation of Real-Time Operating Systems : OSEK/VDX and Rubus
    ISSN 0280-5316 ISRN LUTFD2/TFRT--5731--SE Investigation of Real-Time Operating Systems : OSEK/VDX and Rubus Pontus Evertsson Department of Automatic Control Lund Institute of Technology December 2004 Department of Automatic Control Document name MASTER THESIS Lund Institute of Technology Date of issue Box 118 December 2004 SE-221 00 Lund Sweden Document Number ISRNLUTFD2/TFRT--5731--SE Author(s) Supervisor Pontus Evertsson Karl-Erik Årzén at LTH in Lund Clas Emanuelsson at Haldex Traction in Landskrona. Sponsoring organization Title and subtitle Investigation of Real-Time Operating Systems: OSEK/VDX and Rubus (Analys av realtidsoperativsystem: OSEK/VDX and Rubus) Abstract The aim of this work was to investigate the possibilities and consequences for Haldex Traction of starting to use the OSEK/VDX standard for realtime operating systems. This report contains a summary of the realtime operating system documents produced by OSEK/VDX. OSEK/VDX is a committee that produces standards for realtime operating systems in the European vehicle industry. The report also contains a market evaluation of different OSEK/VDX realtime operating systems. The main differences between OSEK/VDX OS and a realtime operating system named Rubus OS are also discussed. There is a design suggestion of how to change an application that runs under Rubus OS to make it work with an OSEK/VDX OS. Finally a test of changing a small test application’s realtime operating system from Rubus OS to the OSEK OS osCAN is presented. Keywords Classification system and/or index terms (if any) Supplementary bibliographical information ISSN and key title ISBN 0280-5316 Language Number of pages Recipient’s notes English 48 Security classification The report may be ordered from the Department of Automatic Control or borrowed through:University Library, Box 3, SE-221 00 Lund, Sweden Fax +46 46 222 42 43 Contents Contents.....................................................................................................................................
    [Show full text]