Sciweavers

90
Voted
RTSS
2015
IEEE
9 years 11 months ago
When Is CAN the Weakest Link? A Bound on Failures-in-Time in CAN-Based Real-Time Systems
—A method to bound the Failures In Time (FIT) rate of a CAN-based real-time system, i.e., the expected number of failures in one billion operating hours, is proposed. The method ...
Arpan Gujarati, Björn B. Brandenburg
87
Voted
RTSS
2015
IEEE
9 years 11 months ago
Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization
—A central problem in real-time scheduling theory is to decide whether a sporadic task system with constrained deadlines is feasible on a preemptive uniprocessor. It is known tha...
Pontus Ekberg, Wang Yi 0001
78
Voted
RTSS
2015
IEEE
9 years 11 months ago
Relaxing Resource-Sharing Constraints for Improved Hardware Management and Schedulability
Modern computer architectures, particularly multicore systems, include shared hardware resources such as caches and interconnects that introduce timing-interference channels. Unma...
Bryan C. Ward
84
Voted
RTSS
2015
IEEE
9 years 11 months ago
A Quadratic-Time Response Time Upper Bound with a Tightness Property
—The response time analysis (RTA) is one of the fundamental tools used to guarantee the schedulability of sets of real-time tasks scheduled by Fixed Priorities. Also, several ana...
Enrico Bini, Andrea Parri, Giacomo Dossena
81
Voted
RTSS
2015
IEEE
9 years 11 months ago
Optimal Real-Time Scheduling on Two-Type Heterogeneous Multicore Platforms
Abstract—Motivated by the cutting-edge two-type heterogeneous multicore chips, such as ARM’s big.LITTLE, that offer a practical support for migration, this paper studies the gl...
Hoon Sung Chwa, Jaebaek Seo, Jinkyu Lee, Insik Shi...