Modeling of Software Partition for Distributed Real-Time Applications
IEEE Transactions on Software Engineering
Specification and design of embedded systems
Specification and design of embedded systems
Fixed-priority scheduling of real-time systems using utilization bounds
Journal of Systems and Software
Predicting timing behavior in architectural design exploration of real-time embedded systems
DAC '97 Proceedings of the 34th annual Design Automation Conference
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Hardware-Software Cosynthesis for Digital Systems
IEEE Design & Test
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Performance estimation for real-time distributed embedded systems
ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Allocation and scheduling of real-time periodic tasks with relative timing constraints
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
A generalized utilization bound test for fixed-priority real-time scheduling
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient performance estimation for general real-time task systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
During design exploration, many implementations of the same system specification may need to be evaluated. In this paper, we present an approach to construct sufficient and necessary conditions for a given system specifications. These conditions can be employed in the design exploration process to rapidly determine if an implementation of the system satisfies the timing constraints. We prove that our conditions always outperform the existing respective conditions. Experimental results are also provided to compare our approach with known scheduling results.