• Publications
  • Influence
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. This paper contains twoExpand
  • 148
  • 42
The Digraph Real-Time Task Model
Models for real-time systems have to balance the inherently contradicting goals of expressiveness and analysis efficiency. Current task models with tractable feasibility tests have limitedExpand
  • 138
  • 13
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's. Since then, it has been a long standing open problem to findExpand
  • 105
  • 12
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms; the way ofExpand
  • 127
  • 7
Combining Abstract Interpretation with Model Checking for Timing Analysis of Multicore Software
It is predicted that multicores will be increasingly used in future embedded real-time systems for high performance and low energy consumption. The major obstacle is that we may not predict andExpand
  • 115
  • 6
Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems
An increasing trend in embedded system design is to integrate components with different levels of criticality into a shared hardware platform for better cost and power efficiency. SuchExpand
  • 122
  • 6
Building timing predictable embedded systems
A large class of embedded systems is distinguished from general-purpose computing systems by the need to satisfy strict requirements on timing, often under constraints on available resources.Expand
  • 101
  • 5
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
We study the schedulability analysis problem for nonpreemptive scheduling algorithms on multiprocessors. To our best knowledge, the only known work on this problem is the test condition proposed byExpand
  • 54
  • 5
Service guarantee exploration for mixed-criticality systems
Most mixed-criticality scheduling algorithms have the problem of service interruption for low-critical tasks, which has prompted several recent studies on providing various service guarantees forExpand
  • 37
  • 5
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Non-preemptive scheduling is usually considered inferior to preemptive scheduling for time critical systems, because the non-preemptive block would lead to poor task responsiveness. Although this isExpand
  • 39
  • 4