Technical Report Number
Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedofﬂine. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms we have developed for TAO’sfederated event channel. Finally, we present empirical re-sults from a Linux testbed that demonstrate the efﬁciency ofthose deferrable server mechanisms.
Zhang, Yuanfang; Lu, Chenyang; Gill, Christopher; Lardieri, Patrick; and Thaker, Gautum, "End-to-End Scheduling Strategies for Aperiodic Tasks in Middleware" Report Number: WUCSE-2005-57 (2005). All Computer Science and Engineering Research.
Permanent URL: http://dx.doi.org/10.7936/K7BC3WX4