Filters








23 Hits in 1.8 sec

Page 360 of IEEE Transactions on Computers Vol. 52, Issue 3 [page]

2003 IEEE Transactions on Computers  
Goossens “Liu and Layland’s Schedulabilit 5 Test Revisited,” Information Processing Letters, vol. 73, nos. 5 pp. 157-161, Mar. 2000 [8] C.-C.  ...  Utilization bound is a good online test method where a task set is guaranteed schedulability if its utilization is no more than a bound In this paper, we revisited the utilization bounds for Eb, P)-type  ... 

Page 942 of IEEE Transactions on Computers Vol. 52, Issue 7 [page]

2003 IEEE Transactions on Computers  
Devillers and J. Goossens, “Liu and Layland’s Schedulability Test Revisited,” Information Processing Letters, vol. 73, no 5, pp. 157-161, Mar. 2000 [12] J.P. Lehoczky, L. Sha, and J.K.  ...  Real-Time Computing Systems and Applications, Dec. 1997 {2} C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multi- programming in a Hard Real-Time Environment,” |.  ... 

Page 6625 of Mathematical Reviews Vol. , Issue 2001I [page]

2001 Mathematical Reviews  
test revisited.  ...  This very interesting paper analyses once more the Liu-Layland schedulability test for hard-real-time systems.  ... 

A dynamic scheduling approach to designing flexible safety-critical systems

Luis Almeida, Sebastian Fischmeister, Madhukar Anand, Insup Lee
2007 Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07  
Such local bound is derived off-line for the specific set of possible configurations, and can be significantly higher than any generic non-necessary utilization bound such as the well known Liu and Layland's  ...  Such local bound is derived off-line for the specific set of possible configurations, and can be significantly higher than any generic non-necessary utilization bound such as the well known Liu and Layland's  ...  To give a notion of the relative efficiency achievable with this bound, we can compare it with the Liu and Layland's utilization bound for Rate-Monotonic, which computes to 0.7241 for a set of 8 tasks  ... 
doi:10.1145/1289927.1289942 dblp:conf/emsoft/AlmeidaFAL07 fatcat:e3fwh6r4uvh7pfl3yxzjyy3nde

Utilization bound revisited

Deji Chen, A.K. Mok, Tei-Wei Kuo
2003 IEEE transactions on computers  
Goossens “Liu and Layland’s Schedulabilit 5 Test Revisited,” Information Processing Letters, vol. 73, nos. 5 pp. 157-161, Mar. 2000 [8] C.-C.  ...  Tei-Wei Kuo, Member, [EEE Computer Society Abstract—Utilizaiion bound is a well-known concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability  ... 
doi:10.1109/tc.2003.1183949 fatcat:ju3qv2mztjdgra6oyesestcjxu

From Instantaneous Schedulability to Worst Case Schedulability: A Significant Moment Approach [article]

Ningshi Yao, Fumin Zhang
2021 arXiv   pre-print
The method of significant moment analysis has been employed to derive instantaneous schedulability tests for real-time systems.  ...  However, the instantaneous schedulability can only be checked within a finite time window. On the other hand, worst-case schedulability guarantees schedulability of systems for infinite time.  ...  We revisit Liu and Layland's canonical task sets and utilize the significant moment analysis to derive the same set of worst case schedulability conditions under RMS.  ... 
arXiv:2109.05375v1 fatcat:ivcccelhlfhd5pfr4iqgdermby

Many suspensions, many problems: a review of self-suspending tasks in real-time systems

Jian-Jia Chen, Geoffrey Nelissen, Wen-Hung Huang, Maolin Yang, Björn Brandenburg, Konstantinos Bletsas, Cong Liu, Pascal Richard, Frédéric Ridouard, Neil Audsley, Raj Rajkumar, Dionisio de Niz (+1 others)
2018 Real-time systems  
To provide a correct platform on which future research can be built, this paper reviews the state of the art in the design and analysis of scheduling algorithms and schedulability tests for self-suspending  ...  ; (3) an assessment of the influence of such flawed analyses on partitioned multiprocessor fixed-priority scheduling when tasks synchronize access to shared resources; and (4) a discussion of the computational  ...  reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s11241-018-9316-9 fatcat:6t2d2ux4xzhern2try32c65zvy

Schedulability analysis of a graph-based task model for mixed-criticality systems

Pontus Ekberg, Wang Yi
2015 Real-time systems  
We present an optimal scheduling algorithm and an exact schedulability test. Third, we address a pair of longstanding open problems in real-time scheduling theory.  ...  We present sufficient schedulability tests, i.e., methods used to prove that a given collection of tasks will meet their timing constraints under a particular scheduling algorithm.  ...  Distribution: publications.uu.se urn:nbn:se:uu:diva-267017 ACTA UNIVERSITATIS UPSALIENSIS UPPSALA 2015 Liu and Layland's result was actually for the related periodic task model.  ... 
doi:10.1007/s11241-015-9225-0 fatcat:cy6d3r3ljbb4lmi26ov2o54tcq

A Note on the Period Enforcer Algorithm for Self-Suspending Tasks [article]

Jian-Jia Chen, Björn B. Brandenburg
2016 arXiv   pre-print
This note revisits the algorithm in the light of recent developments in the analysis of self-suspending tasks, carefully re-examines and explains its underlying assumptions and limitations, and points  ...  The period enforcer algorithm for self-suspending real-time tasks is a technique for suppressing the "back-to-back" scheduling penalty associated with deferred execution.  ...  Anderson and Raj Rajkumar for their comments on early drafts of this paper. This work has been supported by DFG, as part of the Collaborative Research Center SFB876.  ... 
arXiv:1606.04386v1 fatcat:4z7a5cqyj5cs5ivrhrkkfvmje4

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Laurent George, Pierre Courbin, Yves Sorel
2011 Journal of systems architecture  
In this paper, we focus on the semi-partitioned scheduling of sporadic tasks with constrained deadlines and identical processors.  ...  We compare the performance of these semi-partitioned heuristics with the performance of classical partitioned scheduling algorithms and with a global scheduling heuristic which is currently considered  ...  The authors show that the utilization bound obtained with SPA2 is equal to n(2 1 n − 1), the Liu & Layland's bound defined in [37] , that tends towards 69.3%, where n is the number of tasks. • In [38  ... 
doi:10.1016/j.sysarc.2011.02.008 fatcat:za3nyr7rsff4pdtgsbso5jqzpi

Exact utilization bounds for real-time systems design

Ying Fang
1998
The utilization test is an effective means to determine schedulability of a real time system prior to implementation and to assign the time budget to individual tasks in the design phase.  ...  In this thesis, a novel approach is proposed to compute the exact utilization bound for a task set with known task periods and deadlines using a fixed priority scheduling algorithm.  ...  ): Liu and Layland's bound for the rate monotonic algorithm.  ... 
doi:10.14288/1.0064807 fatcat:rrxnbsnr5reztf5ir5hnlv4kim

Page 1922 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
(English summary) 20011:68025 — (with Goossens, Joél) Liu and Layland’s schedulability test revisited.  ...  H.; Chan, Fun Ting; Chen, Tsong Yueh) Test case selection with and without replacement. (English summary) Liu, Huan Ping (with Yang, Yi Xian) Connectivity of undirected double loop networks (Chinese.  ... 

Page 2535 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
J.) see Industrial constraint-directed scheduling, 2001d:90006 Dell’Olmo, Paolo see Drozdowski, Maciej, 2001¢:68021 Devillers, Raymond (with Goossens, Joél) Liu and Layland’s schedulability test revisited  ...  ., 2001¢:90032 Yu, Wenci see Liu, Zhaohui, 2001d:90041 and 2001¢:90028 Yue, Minyi see Li, Rong Heng, 2001m:90043 Zalyubovskil, V. V. see Gimadi, E.  ... 

Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks

Hakan Aydin
2007 IEEE transactions on computers  
We develop a necessary and sufficient test using a dynamic programming technique.  ...  We extend the well-known processor demand approach to take into account the extra overhead that may be induced by potential recovery operations under Earliest-Deadline-First scheduling.  ...  A well-known result established by Liu and Layland's seminal paper [27] is that, in the absence of faults, a periodic task set is feasible if and only if its total utilization, defined as U tot ðÞ ¼  ... 
doi:10.1109/tc.2007.70739 fatcat:ox7pjq4uo5gonnukjyiv3zzpwu

Efficient implementation of tight response-times for tasks with offsets

Jukka Mäki-Turja, Mikael Nolin
2008 Real-time systems  
Real-Time Syst Existing offset RTA This section revisits the existing response-time analysis for tasks with offsets (Tindell 1992; Palencia Gutiérrez and González Harbour 1998) and illustrates some intuition  ...  As discussed in (Mäki-Turja et al. 2005) , RTA of tasks with offsets is useful to analyze hybrid scheduled systems with static and FPS (Fixed Priority Scheduling).  ...  The concept of interference Classical response time analysis for Liu and Layland's periodic task model (Liu and Layland 1973) (where a task τ i has a period T i and worst-case execution-time C i ), presented  ... 
doi:10.1007/s11241-008-9050-9 fatcat:zjlk3tdk5zgyvosan464fw3sea
« Previous Showing results 1 — 15 out of 23 results