Sha, L., Klein, M., Goodenough, J.: Rate Monotonic Analysis for Real-Time Systems. 129-155. Foundations of Real-Time Computing: Scheduling and Resource Management. Boston, MA: Kluwer Academic Publishers (1991)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....code, or through commercial vendors who provide documentation and support. Real time system development requires selecting a realtime operating system that provides scheduling guarantees, and designing the software to ensure that deadlines are met. Techniques such as rate monotonic analysis (RMA) [6, 7, 8] are commonly used to derive task scheduling based on task worstcase execution time (WCET) However, worst case execution time is difficult to obtain analytically for tasks running on general purpose microprocessors like the Intel Pentium, due to unpredictable effects from external sources like ....

Sha, Klein & Goodenough, "Rate Monotonic Analysis for Real-Time Systems," Foundations of Real-Time Computing: Scheduling and Resource Management, pp. 129-155. Boston, MA: Kluwer Academic Publishers. 1991. Copyright #### by ASME

....system, more precisely the respect of every deadline, has been since the beginning considered out of reach of the automata approach, as time could be in no way unfolded in a so wide range of periods : some tasks have a frequency of 50 kHz, some others a period of 6 months. A Rate Monotonic Analysis[12] had been successfully used in a previous development, and it has been considered suitable to ensure desired timing properties. Unfortunately the Rate Monotonic Scheduling hypotheses (perfect scheduler, instantaneous preemption, periodic and independant tasks, etc) were not met, and the load of ....

L. Sha, M.H. Klein, J.B. Goodenough. Rate Monotonic Analysis for real-time systems. Tech. report, CMU/SEI 91 TR 6, Mar. 1991.

....p Priority , order: componentname String ) Figure 3 Passive vs Active components Passive outer ports Active Event inner ports Peng Liang, et al. 5. The timing bundles for the example would be expressed as follows: 3. 2 Rate Monotonic Analysis Rate Monotonic Analysis (RMA) [5] consists of a number of simple, practical techniques to generate or verify schedules for a set of real time tasks. RMA provides different algorithms depending on whether the tasks are (i) periodic and independent, ii) mixed periodic and aperiodic, or (iii) interacting. For a brief discussion, ....

Sha, Klein and Goodenough, J. Rate Monotonic Analysis for Real-Time Systems. Foundations of Real-Time Computing: Scheduling and Resource Management. Boston, MA: Kluwer Academic Publishers, pp. 129-155, 1991.

....server process S with a given period TS and execution time budget CS assigned to service the non periodic activities. Server tasks are scheduled as regular periodic processes, according to fixed priority scheduling. Several server methods have been proposed, including, the Poll server (PS) [13, 14], the Priority Exchange (PE) the Extended Priority Exchange (EPE) 15, 16] the Deferrable (DS) 15, 17] and the Sporadic (SS) 18] server. However, periodic tasks often finish earlier than their worst case execution time. In a periodic task schedule one may temporarily delay the periodic tasks ....

Lui Sha, Mark H. Klein, and John B. Goodenough, Rate Monotonic Analysis for Real-Time Systems, pp. 129--156, In van Tilborg and Koob [8], 1991.

....(MAST[13] PERTS[14] or STRESS[15] offers a rich environment suited to the evaluation of a set of tasks, which supports the synchronization constraints for instance. But everything is oriented toward off line evaluation in the form of an off line feasibility (or what if ) test (typically: RMA[16]) the simulator s role is to have some visual feedback of what will happen on line. However, apart from a work still in progress in MAST[13] which seems to be oriented towards synthetic workload simulation, no actual simulation for the evaluation of a real time system in a varying environment ....

L. Sha, M. Klein, and J. Goodenough. Rate monotonic analysis for real-time systems. Technical report, 1991.

....using BDDs. These tools, however, do not allow the quantitative analysis of systems as the proposed method. In [14] quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real time systems also exist, such as the rate monotonic scheduling theory [22, 19, 26]. In this method a real time system is characterized by a set of periodic tasks, each having a period and an execution time. Assumptions about system behavior are made (such as no task preempts itself) and if these assumptions are satisfied, simple formulas determine the schedulability of the ....

L. Sha, M. H. Klein, and J. B. Goodenough. Rate monotonic analysis for real-time systems. In Foundations of Real-Time Computing --- Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

....An other subset of scheduling simulators (MAST[8] PERTS[9] o#ers a rich environment for evaluating a set of tasks, defining the synchronization constraints for instance. But everything is oriented toward o# line evaluation in the form of an o# line feasibility (or what if ) test (typically: RMA[10]) Apart from a work still in progress in MAST[8] but oriented towards synthetic workload simulation, no actual simulation for evaluation in a varying environment can be carried out, which is one of our goals. Concerning the RTOS simulators, it is noticeable that almost any RTOS proposes its own ....

L. Sha, M. Klein, and J. Goodenough. Rate monotonic analysis for realtime systems. Technical report, 1991.

....comparison purposes. Feasibility algorithms fall broadly into two categories, namely, the slack stealing and the schedule construction methods. A third approach, the server based methods, preallocate o# line portions of the schedule via the use of aperiodic servers, such as, the Poll server (PS) [9, 10], the Priority Exchange (PE) the Extended Priority Exchange (EPE) 11, 12] the Deferrable (DS) 11, 13] and the Sporadic (SpS) 14] server. These methods represent important milestones as algorithms for the scheduling of aperiodic tasks. However, they are not feasibility algorithms per se, and, ....

Lui Sha, Mark H. Klein, and John B. Goodenough, "Rate monotonic analysis for real-time systems," in Foundations of Real-Time Computing: Scheduling and Resource Management, Andre M. van Tilborg and Gary M. Koob, Eds., chapter 5, pp. 129--155. Kluwer Academic Publishers, Norwell, MA, 1991.

....using BDDs. These tools, however, do not allow the quantitative analysis of systems as the proposed method. In[10] quantitative analysis is implemented, but with a more limited scope. Analytical methods for analyzing real time systems also exist, such as the rate monotonic scheduling theory[16,17,21]. In this method a real time system is characterized by a set of periodic tasks, each having a period and an execution time. Assumptions about system behavior are made (such as no task preempts itself) and if these assumptions are satisfied, simple formulas determine the schedulability of the ....

L. Sha, M. H. Klein, and J. B. Goodenough. Rate monotonic analysis for real-time systems. In Foundations of Real-Time Computing - Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

....computing research has focused on the scheduling and analysis of real time systems whose timing properties and execution behavior are known a priori. This is not without justification, since static approaches to the engineering of real time systems have utility in many application domains [14]. Furthermore, the pre deployment guarantee afforded by such approaches is highly desirable. However, there are numerous applications which must operate in highly dynamic environments, thereby precluding accurate characterization of the applications properties by static models. In such contexts, ....

....to resource allocation may be necessary. In existing real time computing models, the execution time of a job is often used to characterize workload, and is usually considered to be known a priori. Typically, execution time is assumed to be an integer worst case execution time (WCET) as in [11, 13, 23, 22, 21, 14, 3]. While [14] establishes the utility of WCET based approaches by listing their domains of successful application, others [10, 8, 6, 9, 19, 13, 20, 18, 17, 12, 1, 2, 4] cite the drawbacks, and in some cases the inapplicability, of the approaches in certain domains. In [13, 20, 10, 6, 1] it is ....

[Article contains additional citation context not shown here]

L. Sha, M. H. Klein, and J.B. Goodenough, "Rate monotonic analysis for real-time systems," in Scheduling and Resource Management, Kluwer, 1991, 129-156, edited by A. M. van Tilborg and G. M. Koob.

....is constant. Run time denotes the maximum time which is required by a processor to execute the task without interruption. 5) Any non periodic task in the system has no required deadline. Further work has shown that not all of these assumptions are mandatory to employ the rate monotonic algorithm [14]. Static priorities are assigned to tasks once during call set up phase according to their request rates. The priority corresponds to the importance of a task relatively to other tasks. Tasks with higher request rates will have higher priorities. The task with the shortest period gets the highest ....

L. Sha, M. H. Klein, J. B. Goodenough, "Rate Monotonic Analysis for Real-Time Systems", Foundations of Real-Time Computing, Scheduling and Resource Management; Kluwer Academic Publisher; Norwell, 1991; pp. 129-156.

....load characteristics of the application. Most of the past efforts on real time scheduling and resource management have focused on realtime systems that are static (in both the above senses) and perform device level, sampled data monitoring and regulatory control that is usually centralized [Bak91, LRT92, LSS87, RCF97, RTL93, SB96, SKG91, SLS88, SSL89, TLS96, XP90], but occasionally distributed [CSR86, HS92, Kao95, KDK89, RSZ89, Shi91, SR91, SRC85, Ver95, WSM95] These techniques cannot be practically employed or adapted for systems that are dynamic [Jen99, Koob96, Sta96, SK97] Dynamic real time computer systems and their applications have workload ....

....Real Time Scheduling and Resource Management Algorithms Based on Data Stream Sizes In a number of real time scheduling algorithms, the execution time of a job is considered to be known completely a priori. Typically, execution time is assumed to be an integer worst case execution time, as in [Bak91, Cla90, LL73, RSZ89, SKG91, Ver95, WSM95, XP90]. Therefore, we classify these scheduling algorithms as deterministic, as the algorithms model the number of data items processed by periodic tasks as integer, discrete values that are known a priori. Paradigms that generalize execution times have also been developed. Execution time is modeled as ....

[Article contains additional citation context not shown here]

L. Sha, M. H. Klein, and J. B. Goodenough, "Rate Monotonic Analysis for Real-Time Systems," In A. M. van Tilborg and G. M. Koob (Editors), Scheduling and Resource Management, pages 129--156. 1991.

.... temporal and execution characteristics can only be determined accurately by empirical observation or experience (i.e. a posteriori) In most real time computing models, the execution time of a job is used to characterize workload a priori as an integer worst case execution time (WCET) [9, 16, 11, 3]. While [11] establishes the utility of WCET based approaches by listing their domains of successful application, others [8, 6, 5, 7, 14, 15, 13, 12, 10, 1, 2, 4] cite the drawbacks, and in some cases the inapplicability, of the approaches in certain domains. In [15, 8, 5, 1] it is mentioned that ....

.... characteristics can only be determined accurately by empirical observation or experience (i.e. a posteriori) In most real time computing models, the execution time of a job is used to characterize workload a priori as an integer worst case execution time (WCET) 9, 16, 11, 3] While [11] establishes the utility of WCET based approaches by listing their domains of successful application, others [8, 6, 5, 7, 14, 15, 13, 12, 10, 1, 2, 4] cite the drawbacks, and in some cases the inapplicability, of the approaches in certain domains. In [15, 8, 5, 1] it is mentioned that ....

L. Sha, M. H. Klein, and J.B. Goodenough, "Rate monotonic analysis for real-time systems," in Scheduling and Resource Management, Kluwer, 1991, 129-156, edited by A. M. van Tilborg and G. M. Koob.

....times are characterized in the related efforts for comparison. In most of the existing real time scheduling and resource management models, task execution times are assumed to be a priori known. Typically, execution time is assumed to be an integer worst case execution time (WCET) as in [Bak91, LL73, RSZ89, SKG91, VWHL96, WSM95, XP90]. While [SKG91] establishes the utility of WCET based approaches by listing some of its domains of successful application, others [AB98, AB98a, BN 98, JRR94, HS90, KM97, Leh96, LL 91, RSZ89, SK97, SG97, SL96, TD 95] cite the drawbacks, and in some cases the inapplicability of the approaches in ....

....comparison. In most of the existing real time scheduling and resource management models, task execution times are assumed to be a priori known. Typically, execution time is assumed to be an integer worst case execution time (WCET) as in [Bak91, LL73, RSZ89, SKG91, VWHL96, WSM95, XP90] While [SKG91] establishes the utility of WCET based approaches by listing some of its domains of successful application, others [AB98, AB98a, BN 98, JRR94, HS90, KM97, Leh96, LL 91, RSZ89, SK97, SG97, SL96, TD 95] cite the drawbacks, and in some cases the inapplicability of the approaches in certain domains. ....

L. Sha, M. H. Klein, and J. B. Goodenough, "Rate Monotonic Analysis for RealTime Systems," In A. M. van Tilborg and G. M. Koob, Editors, Scheduling and Resource Management, pages 129-156, 1991.

....computing research has focused on the scheduling and analysis of real time systems whose timing properties and execution behavior are known a priori. This is not without justification, since static approaches to the engineering of real time systems have utility in many application domains [Sha91]. Furthermore, the pre deployment guarantee afforded by such approaches is highly desirable. However, there are numerous applications which must operate in highly dynamic environments (such as battle environments) thereby precluding accurate characterization of the applications properties by ....

....to accommodate dynamic workload changes. In existing real time computing models, the execution time of a job is often used to characterize workload, and is usually considered to be known a priori. Typically, execution time is assumed to be an integer worst case execution time (WCET) as in [Liu73, Ram89, Xu90, Wel95, Ver95, Sha91, Bak91]. While [Sha91] establishes the utility of WCET based approaches by listing some of its domains of successful application, others [Leh96, Jah95, Hab90, Kuo97, Sun96, Ram89, Tia95, Str97, Ste97, Liu91, Abe98, Atl98, Bra98] cite the drawbacks, and in some cases the inapplicability, of the approaches ....

[Article contains additional citation context not shown here]

L. Sha, M. H. Klein, and J.B. Goodenough, "Rate monotonic analysis for real-time systems," in Scheduling and Resource Management, Kluwer, 1991, 129-156, edited by A. M. van Tilborg and G. M. Koob.

....the computational economy. 3.2 Resource Managers Resource managers are the operating system entities which provide resource allocations with associated performance guarantees. Examples of possible design choices for resource managers include priority schedulers [24, 29, 31] real time schedulers [21, 28], fair share schedulers [19, 20] proportional share schedulers [22, 33, 35, 36] and rate based schedulers [9, 38] Which resource manager to choose for each resource in a computational economy depends on several factors including resource allocation precision, flexibility, and overhead. ....

SHA, L., KLEIN, M. H., AND GOODENOUGH, J. B. Rate Monotonic Analysis for Real-time Systems. In Andre M. van Tilborg and Gary M. Koob, editors, Foundations of Real-time Computing: Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

.... projects, among them we can cite the BSY 1 Submarine Combat System trainer developed by IBM, and the space station data management system of NASA [4] It has also been used to analyze systems developed with the help of some open standards like the IEEE FutureBus or the POSIX real time extensions [9, 13]. 3 Contribution and novelties 3.1 The Project This electricity meter monitors the electric installation of a customer for billing purposes, but also in order to allow for some actions to be performed on the installation itself (e.g. circuit switching, tariff programming) The functions of the ....

L. Sha, M.H. Klein, and J.B. Goodenough. Rate monotonic analysis for realtime systems. Technical Report CMU/SEI-91-TR-6, ESD-91-TR-6, SEI, CMU, March 1991.

....tool[3] settled it. The formal approach to temporal aspects of the system, and more precisely the respect of every deadline, was, since the beginning, considered out of reach of the automata approach, as time could not be in no way unfolded in a so wide range of periods. A Rate Monotonic Analysis[25] had been successfully used in a previous development, and it has been considered suitable to ensure desired timing properties. As it happened during the development, a coupling of both Formal Methods has been successfully studied and used to achieved a fine study of the loaded system. This ....

.... projects, among them we can cite the BSY 1 Submarine Combat System trainer developed by IBM, and the space station data management system of NASA [12] It has also been used to analyze systems developed with the help of some open standards like the IEEE FutureBus or the POSIX real time extensions [19, 25]. It was also the basis of a previous and much simpler study at Schlumberger Industries. 3.2.1 Rate Monotonic Scheduling The RM scheduling algorithm has been defined by Liu and Layland [21] on periodic and fully preemptable tasks, having no more interaction than the share of a common processor. ....

L. Sha, M.H. Klein, J.B. Goodenough. Rate Monotonic Analysis for real-time systems. Tech. report, CMU/SEI 91 TR 6, Mar. 1991.

....the type of information computed by our algorithms allows us to identify inefficiencies, to suggest optimizations to the design, and to analyze the performance of these proposed changes. Several other methods for analyzing real time systems exist. The rate monotonic scheduling theory (RMS) [13, 10] proposes a schedulability test based on total CPU utilization. However, there are a number of limitations on the type of processes that can be analyzed by this method, including restrictions on periodicity and synchronization. Another approach to schedulability analysis uses algorithms for ....

L. Sha, M. H. Klein, and J. B. Goodenough. Rate monotonic analysis for real-time systems. In Foundations of Real-Time Computing --- Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

....tools described above. The system consists of set of priority driven processes, where each process is responsible for a subsystem of the aircraft. Subsystems being controlled include navigation, display, radar and weapons. We use the algorithm defined by the rate monotonic scheduling theory (RMS) [12, 15, 20] to make the system predictable. This algorithm assigns higher priorities to processes with shorter periods. Optimal response time is guaranteed by the RMS theory if priorities are assigned according to this rule [15] The RMS theory proposes a schedulability test based on total CPU utilization; a ....

L. Sha, M. H. Klein, and J. B. Goodenough. Rate monotonic analysis for real-time systems. In Foundations of Real-Time Computing --- Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

No context found.

Sha, L., Klein, M. H., and Goodenough, J. B. Rate Monotonic Analysis for Real-Time Systems. In M., Ed., Kluwer Academic Publishers, 1991, pp. 129-155.

No context found.

Sha, L., Klein, M., Goodenough, J.: Rate Monotonic Analysis for Real-Time Systems. 129-155. Foundations of Real-Time Computing: Scheduling and Resource Management. Boston, MA: Kluwer Academic Publishers (1991)

No context found.

Sha, Klein, and Goodenough. Rate Mono- 13 tonic Analysis for Real-Time Systems. Foundations of Real-Time Computing: Scheduling and Resource Management. Kluwer Academic Publishers, 1991.

No context found.

L. Sha, M. H. Klein, and J. B. Goodenough, "Rate Monotonic Analysis for Real-Time Systems," In A. M. van Tilborg and G. M. Koob (Editors), Scheduling and Resource Management, pp. 129-156. 1991.

No context found.

Lui Sha, Mark H. Klein, and John B. Goodenough, "Rate monotonic analysis for real-time systems," in Foundations of Real-Time Computing: Scheduling and Resource Management, Andre M. van Tilborg and Gary M. Koob, Eds., chapter 5, pp. 129--155. Kluwer Academic Publishers, Norwell, MA, 1991.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC