Scheduling real-time applications in an open environment

Zhong, Dan; Liu, J.W.-S.

doi:10.1109/real.1997.641292

Cited by 300 publications

(231 citation statements)

References 11 publications

Supporting

Mentioning

227

Contrasting

Unclassified

Order By: Relevance

“…The work presented in this paper differs from the last work in [20] in the sense that it implements a hierarchical scheduling framework in a commercial operating system like VxWorks for multicore systems. Furthermore, the work can be considered as an extension from the above approaches in the sense that it implements a hierarchical scheduling framework intended for open environments [1], and Symmetric Multiprocessing (SMP) systems where real-time applications may be developed independently and unaware of each other and still there should be no problems in the integration of these applications into one environment. A key here is the use of well-defined interfaces representing the collective resource requirements by an application, rich enough to allow for integration with an arbitrary set of other applications without having to redo any kind of application internal analysis.…”

Section: Related Workmentioning

confidence: 99%

“…Since a two-level HSF [1] has been introduced for open environments, many studies have been proposed for its schedulability analysis of HSFs [2]- [3]. Various processor models, such as bounded-delay [4] and periodic [5], have been proposed for multi-level HSFs, and schedulability analysis techniques have been developed for the proposed processor models [6]- [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

Chakma¹,

Debbarma²,

Kar³

et al. 2013

LNSE

View full text Add to dashboard Cite

Previously, several works have been carried out on hierarchical scheduling frameworks from a theoretical point of view. In the recent past, hierarchical scheduling frameworks have been implemented on VxWorks for uniprocessor system. In this paper we present our initial proposal of the implementation of our hierarchical scheduling framework in a commercial operating system like VxWorks for Symmetric Multiprocessing based (SMP) Real Time Systems. The purpose of the implementation is twofold: (1) we would like to identify the limitations of the previous implementations and (2) we would like to demonstrate feasibility of our implementation in a commercial operating system, without having to modify the kernel source code. We present SMP structure of VxWorks and how it can be used in our proposal. Finally, we present the design of our hierarchical scheduling framework, and we discuss our current status in the project

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

Chakma¹,

Debbarma²,

Kar³

et al. 2013

LNSE

View full text Add to dashboard Cite

show abstract

“…For real-time systems, there has been a growing attention to hierarchical scheduling frameworks [5,10,11,8,15,12,1,2,13,20,18] that support hierarchical resource sharing under different scheduling algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…Deng and Liu [5] proposed a two-level real-time scheduling framework for open systems, where the systemlevel scheduler schedules independently developed application components and each component has its own component-level scheduler for its internal tasks. Kuo and Li [10] presented an exact schedulability condition for such a two-level framework with the RM system scheduler and Lipari and Baruah [11] presented similar conditions with the EDF system scheduler.…”

Section: Introductionmentioning

confidence: 99%

Compositional Schedulability Analysis of Hierarchical Real-Time Systems

Easwaran

Lee

Shin

et al. 2007

10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07)

View full text Add to dashboard Cite

Embedded systems are complex as a whole but consist of smaller independent modules interacting with each other. This structure makes them amenable to compositional design. Real-time embedded systems consist of realtime workloads having deadlines. Compositional design of such systems can be done using real-time components arranged in a scheduling hierarchy. Each component consists of some real-time workload and a scheduling policy for the workload. To simplify schedulability analysis for such systems, analysis should be done compositionally using interfaces that abstract timing requirement of components. To facilitate analysis of dynamically changing systems, the framework should also support incremental analysis. In this paper, we overview our approach to compositional and incremental schedulability analysis of hierarchical real-time systems. We describe a compositional analysis technique that abstracts resource requirement of components using periodic resource models. To support incremental analysis and resource bandwidth minimization, we describe an extension to this interface model. Each extended interface consists of multiple periodic resource models for different periods. This allows the selection of a periodic model that can schedule the system using minimum bandwidth. We also account for context switch overhead of components in these extended interfaces. We then describe an associative composition technique for such interfaces, that supports incremental analysis. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

show abstract

“…If multiple tasks are run on a single server, one may first divide the available resources over the servers, and in a second stage schedule the tasks that run on each server independently of what runs on the other servers. Recent theory about the schedulability of tasks under different kinds of budgeting servers was presented in [2,3,7,9]. In the beginning of section 3 we have shown that there is a connection between the modeling of individual tasks and the modeling of servers.…”

Section: Conclusive Remarks and Future Workmentioning

confidence: 98%

Towards Budgeting in Real-Time Calculus: Deferrable Servers

Cuijpers

Bril

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Budgeting of resources is an often used solution for guaranteeing performance of lower priority tasks. In this paper, we take a formal approach to the modeling of a deferrable server budgeting strategy, using real-time calculus. We prove a scheduling theorem for deferrable servers, and as a corollary show that an earlier claim of Davis and Burns, that periodic servers dominate deferrable servers with respect to schedulability, no longer holds when the context of the comparison is slightly generalized.

show abstract

Scheduling real-time applications in an open environment

Cited by 300 publications

References 11 publications

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks

Compositional Schedulability Analysis of Hierarchical Real-Time Systems

Towards Budgeting in Real-Time Calculus: Deferrable Servers

Contact Info

Product

Resources

About