DOCSLIB.ORG

Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation Thomas E. Hart1,∗ Paul E. McKenney2, and Angela Demke Brown1 1University of Toronto 2IBM Beaverton Dept. of Computer Science Linux Technology Center Toronto, ON M5S 2E4 CAN Beaverton, OR 97006 USA {tomhart, demke}@cs.toronto.edu [email protected] Abstract Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many pro- grammers avoid locking to improve performance, while oth- ers replace locks with non-blocking synchronization to pro- tect against deadlock, priority inversion, and convoying. In Figure 1. Read/reclaim race. both cases, dynamic data structures that avoid locking, re- quire a memory reclamation scheme that reclaims nodes Locking is also susceptible to priority inversion, convoying, once they are no longer in use. deadlock, and blocking due to thread failure [3, 10], leading The performance of existing memory reclamation researchers to pursue non-blocking (or lock-free) synchro- schemes has not been thoroughly evaluated. We conduct nization [6, 12, 13, 14, 16, 29]. In some cases, lock-free the first fair and comprehensive comparison of three recent approaches can bring performance benefits [25]. For clar- schemes—quiescent-state-based reclamation, epoch-based ity, we describe all strategies that avoid locks as lockless. reclamation, and hazard-pointer-based reclamation—using A major challenge for lockless synchronization is han- a flexible microbenchmark. Our results show that there is dling the read/reclaim races that arise in dynamic data no globally optimal scheme. When evaluating lockless syn- structures. Figure 1 illustrates the problem: thread T1re- chronization, programmers and algorithm designers should moves node N from a list while thread T2 is referencing it. thus carefully consider the data structure, the workload, N’s memory must be reclaimed to allow reuse, lest memory and the execution environment, each of which can dramati- exhaustion block all threads, but such reuse is unsafe while cally affect memory reclamation performance. T2 continues referencing N. For languages like C, where memory must be explicitly reclaimed (e.g. via free()), 1 Introduction programmers must combine a memory reclamation scheme with their lockless data structures to resolve these races.1 As multiprocessors become mainstream, multithreaded Several such reclamation schemes have been proposed. applications will become more common, increasing the Programmers need to understand the semantics and the need for efficient coordination of concurrent accesses to performance implications of each scheme, since the over- shared data structures. Traditional locking requires expen- head of inefficient reclamation can be worse than that of sive atomic operations, such as compare-and-swap (CAS), locking. For example, reference counting [5, 29] has high even when locks are uncontended. For example, acquiring overhead in the base case and scales poorly with data- and releasing an uncontended spinlock requires over 400 structure size. This is unacceptable when performance is TM cycles on an IBMR POWER CPU. Therefore, many re- the motivation for lockless synchronization. Unfortunately, searchers recommend avoiding locking [2, 7, 22]. Some there is no single optimal scheme and existing work is rela- TM systems, such as Linux ,useconcurrently-readable syn- tively silent on factors affecting reclamation performance. chronization, which uses locks for updates but not for reads. 1 Reclamation is subsumed into automatic garbage collectors in envi- TM ∗Supported by an NSERC Canada Graduate Scholarship. ronments that provide them, such as Java . 1-4244-0054-6/06/$20.00 ©2006 IEEE Authorized licensed use limited to: The University of Toronto. Downloaded on April 9, 2009 at 00:36 from IEEE Xplore. Restrictions apply. Figure 2. Illustration of QSBR. Black boxes Figure 3. QSBR is inherently blocking. represent quiescent states. We address this deficit by comparing three recent recla- mation schemes, showing the respective strengths and weaknesses of each. In Sections 2 and 3, we review these schemes and describe factors affecting their performance. Section 4 explains our experimental setup. Our analysis, in Section 5, reveals substantial performance differences be- Figure 4. Illustration of EBR. tween these schemes, the greatest source of which is per- operation atomic instructions. In Section 6, we discuss the 2.1.1 Quiescent-State-Based Reclamation (QSBR) relevance of our work to designers and implementers. We show that lockless algorithms and reclamation schemes are QSBR uses quiescent states to detect grace periods. A mostly independent, by combining a blocking reclamation quiescent state for thread T is a state in which T holds scheme and a non-blocking algorithm, then comparing this no references to shared nodes; hence, a grace period for combination to a fully non-blocking equivalent. We also QSBR is any interval of time during which all threads pass present a new reclamation scheme that combines aspects of through at least one quiescent state. The choice of quies- two other schemes to give good performance and ease of cent states is application-dependent. Many operating sys- use. We close with a discussion of related work in Section 7 tem kernels contain natural quiescent states, such as volun- and summarize our conclusions in Section 8. tary context switch, and use QSBR to implement read-copy update (RCU) [22, 20, 7]. Figure 2 illustrates the relationship between quiescent 2 Memory Reclamation Schemes states and grace periods in QSBR. Thread T1 goes through quiescent states at times t1 and t5, T2 at times t2 and t4, and T3 at time t3. Hence, a grace period is any time interval This section briefly reviews the reclamation schemes we containing either [t1,t3] or [t3,t5]. consider: quiescent-state-based reclamation (QSBR) [22, QSBR must detect grace periods so that removed nodes 2], epoch-based reclamation (EBR) [6], hazard-pointer- may be reclaimed; however, detecting minimal grace peri- based reclamation (HPBR) [23, 24], and reference count- ods is unnecessary. In Figure 2, for example, any interval ing [29, 26]. We provide an overview of each scheme to containing [t1,t3] or [t3,t5] is a quiescent state; implemen- help the reader understand our work; further details are tations which check for grace periods only when threads en- available in the papers cited. ter quiescent states would detect [t1,t5],sinceT1’s two qui- escent states form the only pair from a single thread which 2.1 Blocking Schemes enclose a grace period. Figure 3 shows why QSBR is blocking. Here, T 2 goes through no quiescent states (for example, due to blocking We discuss two blocking schemes, QSBR and EBR, on I/O). Threads T 1 and T 3 are then prevented from re- which use the concept of a grace period.Agrace period claiming memory, since no grace periods exist. The ensuing is a time interval [a,b] such that, after time b, all nodes memory exhaustion will eventually block all threads. removed before time a may safely be reclaimed. These methods force threads to wait for other threads to complete 2.1.2 Epoch-Based Reclamation (EBR) their lockless operations in order for a grace period to oc- cur. Failed or delayed threads can therefore prevent memory Fraser’s EBR [6] follows QSBR in using grace periods, but from being reclaimed. Eventually, memory allocation will uses epochs in place of QSBR’s quiescent states. Each fail, causing threads to block. thread executes in one of three logical epochs, and may lag Authorized licensed use limited to: The University of Toronto. Downloaded on April 9, 2009 at 00:36 from IEEE Xplore. Restrictions apply. 1 int search (struct list *l, long key) 2{ 3 node_t *cur; 4 critical_enter(); 5 for (cur = l->list_head; 6 cur != NULL; cur = cur->next) { 7 if (cur->key >= key) { 8 critical_exit(); 9 return (cur->key == key); 10 } 11 } Figure 6. Illustration of HPBR. 12 critical_exit(); 13 return (0); 1 int search (struct list *l, long key) 14 } 2{ 3 node_t **prev, *cur, *next; 4 /* Index of our first hazard pointer. */ 5 int base = getTID()*K; Figure 5. EBR concurrently-readable search. 6 /* Offset into our hazard pointer segment. */ 7 int off = 0; at most one epoch behind the global epoch. Each thread 8 try_again: 9 prev = &l->list_head; atomically sets a per-thread flag upon entry into a critical 10 for (cur = *prev; cur != NULL; cur = next & ˜1) { region, indicating that the thread intends to access shared 11 /* Protect cur with a hazard pointer. */ 12 HP[base+off] = cur; data without locks. Upon exit, the thread atomically clears 13 memory_fence(); its flag. No thread is allowed to access an EBR-protected 14 if (*prev != cur) 15 goto try_again; object outside of a critical region. 16 next = cur->next; Figure 4 shows how EBR tracks epochs, allowing safe 17 if (cur->key >= key) 18 return (cur->key == key); memory reclamation. Upon entering a critical region, a 19 prev = &cur->next; thread updates its local epoch to match the global epoch. 20 off = (off+1) % K; 21 } Hence, if the global epoch is e, threads in critical regions 22 return (0); can be in either epoch e or e-1, but not e+1 (all mod 3). Any 23 } node a thread removes during a given epoch may be safely reclaimed the next time the thread re-enters that epoch. Figure 7. HPBR concurrently-readable Thus, the time period [t1,t2] in the figure is a grace period. A thread will attempt to update the global epoch only if it search. has not changed for some pre-determined number of critical region entries. hence, we have H=NK hazard pointers in total. K is data- As with QSBR, reclamation can be stalled by threads structure-dependent, and often small. Queues and linked which fail in critical regions, but threads not in critical re- lists need K=2 hazard pointers, while stacks require only gions cannot stall EBR.
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]
  • 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.
    [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]