Exact schedulability analysis for static-priority global multiprocessor scheduling using model-checking

Authors:
Nan Guan;Zonghua Gu;Qingxu Deng;Shuaihong Gao;Ge Yu
Affiliations:
Department of Computer Science and Engineering, Northeastern University, Shenyang, China;Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong, China;Department of Computer Science and Engineering, Northeastern University, Shenyang, China;Department of Computer Science and Engineering, Northeastern University, Shenyang, China;Department of Computer Science and Engineering, Northeastern University, Shenyang, China
Venue:
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Year:
2007

Citing 11
Cited 5

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Symbolic Schedulability Analysis of Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Rate-Monotonic Scheduling on Uniform Multiprocessors

IEEE Transactions on Computers
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems
An EDF schedulability test for periodic tasks on reconfigurable hardware devices

Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Schedulability analysis of fixed-priority systems using timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)

Model-Based Analysis of Contract-Based Real-Time Scheduling

SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Multiprocessor schedulability analyser

Proceedings of the 2011 ACM Symposium on Applied Computing
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

To determine schedulability of priority-driven periodic tasksets on multi-processor systems, it is necessary to rely on utilization bound tests that are safe but pessimistic, since there is no known method for exact schedulability analysis for multi-processor systems analogous to the response time analysis algorithm for single-processor systems. In this paper, we use model-checking to provide a technique for exact multiprocessor scheduability analysis by modeling the real-time multi-tasking system with Timed Automata (TA), and transforming the schedulability analysis problem into the reachability checking problem of the TA model.