A Window Protocol for Transmission of Time-Constrained Messages
IEEE Transactions on Computers
Improved algorithms for synchronizing computer network clocks
IEEE/ACM Transactions on Networking (TON)
A scheduling algorithm for tasks described by time value function
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
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
Proof-Based System Engineering and Embedded Systems
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Switched Real-Time Ethernet and Earliest Deadline First Scheduling - Protocols and Traffic Handling
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Achieving Real-Time Communication over Ethernet with Adaptive Traffic Smoothing
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
Probabilistic approach to switched Ethernet for real-time control applications
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
EtheReal: A Host-Transparent Real-Time Fast Ethernet Switch
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Table Driven Proportional Access Based Real-Time Ethernet for Safety-Critical Real-Time Systems
PRDC '01 Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing
IEEE Transactions on Software Engineering
IEEE Transactions on Computers
Utility Accrual Channel Establishment in Multihop Networks
IEEE Transactions on Computers
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Fair and efficient scheduling in data ferrying networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
BPF and MPF-based packet scheduling for AMC-based OFDMA wireless communication systems
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time
Proceedings of the 2010 ACM Symposium on Applied Computing
Opportunistic packet scheduling in body area networks
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
Proceedings of the 2011 ACM Symposium on Applied Computing
IdleChat: enabling high bandwidth real-time applications in residential broadband networks
ACM SIGMOBILE Mobile Computing and Communications Review
Deploying π-calculus technology in Inter-organizational process
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
On-line scheduling of target sensitive periodic tasks with the gravitational task model
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.01 |
Abstract--We present a MAC-layer, soft real-time packet scheduling algorithm called UPA. UPA considers a message model where message packets have end-to-end timeliness requirements that are specified using Jensen's Time-Utility Functions (TUFs). The algorithm seeks to maximize system-wide, aggregate packet utility. Since this scheduling problem is NP-hard, UPA heuristically computes schedules with a quadratic worst-case cost, faster than the previously best CMA algorithm. Our simulation studies show that UPA performs the same as or significantly better than CMA for a broad set of TUFs. Furthermore, we implement UPA and prototype a TUF-driven switched Ethernet system. The performance measurements of UPA from the implementation reveal its strong effectiveness. Finally, we derive timeliness feasibility conditions of TUF-driven switched Ethernet systems that use the UPA algorithm.