Loading...
Please wait, while we are loading the content...
Similar Documents
1time/utility function decomposition techniques for utility accrual scheduling algorithms in real-time distributed systems.
| Content Provider | CiteSeerX |
|---|---|
| Abstract | We consider Real-Time CORBA 1.2’s distributable threads (DTs), whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources—both physical and logical—are shared among time-critical DTs and local applications that may also be time-critical. Hence, DTs that are sched-uled using their propagated TUFs, as mandated by Real-Time CORBA 1.2’s Case 2 approach, may suffer performance degradation, if a node utility accrual (UA) scheduler achieves higher locally accrued utility by giving higher eligibility to local threads than to DTs. To alleviate this, we consider decomposing TUFs of DTs into “sub-TUFs ” for scheduling segments of DTs. We present decomposition techniques called UT, SCEQF, SCALL, OPTCON, and TUFS, which are specific to different classes of UA algorithms, such as those that use utility density, and those that use deadline as their key decision metric. Our experimental studies show that OPTCON and TUFS perform best for utility density-based UA algorithms, and SCEQF and SCALL perform best for deadline-based UA algorithms. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Real-time Distributed System Utility Accrual Scheduling Algorithm Utility Function Decomposition Technique Real-time Corba Legacy Environment Local Application Time Utility Function Utility Density-based Ua Algorithm System Node Resource Local Thread Node Utility Propagated Tufs Utility Density Time-critical Dts Present Decomposition Technique Deadline-based Ua Algorithm Performance Degradation Ua Algorithm Time Constraint Different Class Experimental Study Distributable Thread Key Decision |
| Content Type | Text |
