On utility accrual processor scheduling with wait-free synchronization for embedded real-time software

Authors:
Hyeonjoong Cho;Binoy Ravindran;E. Douglas Jensen
Affiliations:
Virginia Tech Blacksburg, VA;Virginia Tech Blacksburg, VA;The MITRE Corporation Bedford, MA
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 7
Cited 0

Real-time computing with lock-free shared objects

ACM Transactions on Computer Systems (TOCS)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time")

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Improving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Scheduling dependent real-time activities

Scheduling dependent real-time activities
A Formally Verified Application-Level Framework for Real-Time Scheduling on POSIX Real-Time Operating Systems

IEEE Transactions on Software Engineering
A Space-Optimal Wait-Free Real-Time Synchronization Protocol

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first wait-free utility accrual (UA) real-time scheduling algorithms for embedded real-time systems. UA scheduling algorithms allow application activities to be subject to time/utility function (TUF) time constraints, and optimize criteria such as maximizing the sum of the activities' attained utilities. We present UA algorithms that use wait-free synchronization for mutually exclusively accessing shared data objects. We derive lower bounds on the possible accrued utility with wait-free over their lock-based counterparts, while incurring the minimum possible additional space costs. Our implementation measurements on a POSIX RTOS reveal that (during under-loads), the wait-free algorithms yield optimal utility for step TUFs and significantly higher utility (than lock-based) for non-step TUFs.