Constraint-Based Schedulability Analysis in Multiprocessor Real-Time Systems
نویسندگان
چکیده
منابع مشابه
Symbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the anal...
متن کاملSchedulability Analysis of Hierarchical Real-Time Systems
Embedded systems are complex as a whole but consist of smaller independent modules interacting with each other. This structure makes embedded systems amenable to compositional design. Real-time embedded systems consist of real-time workloads having temporal deadlines. Compositional design of real-time embedded systems can be done using systems consisting of real-time components arranged in a sc...
متن کاملModel-Based Schedulability Analysis of Real-Time Systems
BasicBlock SimpleBasicBlock BranchingBasicBlock EmptyBasicBlock IfBasicBlock LoopBasicBlock MethodCallingBasicBlock MonitorEnterBasicBlock MonitorExitBasicBlock SporadicInvokeBasicBlock Figure 9.3: Basic block hierarchy AbstractBasicBlock has a WCET attribute, denoting the execution time of the Java bytecode the block represents. This is used in the schedu-BasicBlock has a WCET attribute, denot...
متن کاملSchedulability Analysis of Multiprocessor Sporadic Task Systems
In this chapter we consider the scheduling of systems of independent sporadic tasks to meet hard deadlines upon platforms comprised of several identical processors. Although this field is very new, a large number of interesting and important results have recently been obtained. We focus on presenting the results within the context of what seems to be a natural classification scheme (described i...
متن کاملA Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor realtime scheduling that hold independent of the scheduling algorithms employ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3022847