## Periodic Resource Model for Compositional Real-Time Guarantees (2003)

Citations: | 131 - 29 self |

### BibTeX

@MISC{Shin03periodicresource,

author = {Insik Shin and Insup Lee},

title = {Periodic Resource Model for Compositional Real-Time Guarantees},

year = {2003}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

3070 | Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment
- Liu, Layland
- 1973
(Show Context)
Citation Context ...he EDF and RM scheduling algorithms. Using this exact schedulability analysis, the real-time guarantees demanded by a child model to a parent model can be derived as a traditional periodic task model =-=[11]-=-. With a scheduling interface model that is specified in terms of a periodic resource model and a periodic task model, we introduce a composition method to develop a parent scheduling model from its c... |

348 |
Aperiodic task scheduling for hard real-time systems
- Sprunt, Sha, et al.
- 1989
(Show Context)
Citation Context ...r proposed periodic resource model. x In this paper, we do not address the issue of modeling a non-periodic application as a single periodic task. This issue has been addressed well in the literature =-=[9, 14, 15, 4]-=-. 3|ƒ '$„(* C‚ ' C ‹ ŒGŽW |ƒ '$„(* ‘' '$„(* |’ ' ‹ ŒGŽ |4?X '’„(*|4' ’ 'I-(* C ' C ( † C p … Q … … C '$„(* 4?X ' ' ( '$!(* ’ ' … '$-(* |ƒ ' … p '$„(* |’ ' … … “ … Q t Π Θ t −(Π− Θ) Π (a) . Θ ε s reso... |

340 | Applying New Scheduling Theory to Static Priority Preemptive
- Audsley, Burns, et al.
- 1993
(Show Context)
Citation Context ...kloads when it is released together with all of its higher-priority workloads at the same time, which is called a critical instant. Using the iterative response time analysis method introduced in ® o =-=[1]-=-, can be computed as follows: o ®;¯±°) o " k2Mm>´ & k l n¶µ ¡· ®E¯¸° °»º † ° where / e0 ° 5 ° T (10) o ,-€/ , / o ®Eēb o ®E¯¸°) ®E¯¸°M ( 'ab(* ' ,- +3 where ' )(*) V + /No ®Mo ' )(* den... |

293 |
Finding response times in a real-time system
- Joseph, Pandya
- 1986
(Show Context)
Citation Context ...< C ` < p C < < 6 C C ` C C ˜ † : a fixed-priority scheduling +¬ algorithm, is schedulable if and only if the worst-case response time of each workload , in is no greater than its relative deadline =-=[7]-=-. The worst-case response ®Lo time of a /No workload occurs when experiences the worst-case interference from its higher/=o priority /No workloads. is maximally interfered by its higherpriority worklo... |

215 |
Enhanced aperiodic responsiveness in hard real-time environments
- Lehoczky, Sha, et al.
- 1987
(Show Context)
Citation Context ...r proposed periodic resource model. x In this paper, we do not address the issue of modeling a non-periodic application as a single periodic task. This issue has been addressed well in the literature =-=[9, 14, 15, 4]-=-. 3|ƒ '$„(* C‚ ' C ‹ ŒGŽW |ƒ '$„(* ‘' '$„(* |’ ' ‹ ŒGŽ |4?X '’„(*|4' ’ 'I-(* C ' C ( † C p … Q … … C '$„(* 4?X ' ' ( '$!(* ’ ' … '$-(* |ƒ ' … p '$„(* |’ ' … … “ … Q t Π Θ t −(Π− Θ) Π (a) . Θ ε s reso... |

194 | Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
- BARUAH, HOWELL, et al.
- 1990
(Show Context)
Citation Context ... schedulable with the EDF scheduling algorithm if and only if the resource demand during a time interval is no greater than the length of the time interval for all time intervals during a hyperperiod =-=[2]-=-, i.e., where ¢Ÿ£ for all P‡^ƒ p ) n is the least common multiplier of the periods + of all the workloads in the workload , set . Now, we consider a sufficient and necessary schedulability condition f... |

154 | Scheduling real-time applications in an open environment
- Deng, Liu
- 1997
(Show Context)
Citation Context ...del that consists of three elements: a resource model, a scheduling algorithm, and a workload model. In real-time scheduling, there has been a growing attention to a hierarchical scheduling framework =-=[4, 8, 10, 12, 5]-=- that supports hierarchical resource sharing under different scheduling algorithms for different scheduling services. A hierarchical scheduling framework can be generally represented as a tree, or a h... |

144 | A dynamic priority Assignment technique for Streams with (m,k)-Firm Deadlines
- Hamdaoui, Ramanathan
- 1999
(Show Context)
Citation Context ...l-time applications. Our future work is to extend our resource model and its scheduling theory to different task workload models for soft real-time applications such as ç©bwR the -firm deadline model =-=[6]-=- and the weakly hard task model [3]. In this paper, we assume that each task is independent. However, tasks may interact with each other through communications and synchronizations. The study of this ... |

123 | Scheduling aperiodic tasks in dynamic priority systems
- Spuri, Buttazzo
- 1996
(Show Context)
Citation Context ...r proposed periodic resource model. x In this paper, we do not address the issue of modeling a non-periodic application as a single periodic task. This issue has been addressed well in the literature =-=[9, 14, 15, 4]-=-. 3|ƒ '$„(* C‚ ' C ‹ ŒGŽW |ƒ '$„(* ‘' '$„(* |’ ' ‹ ŒGŽ |4?X '’„(*|4' ’ 'I-(* C ' C ( † C p … Q … … C '$„(* 4?X ' ' ( '$!(* ’ ' … '$-(* |ƒ ' … p '$„(* |’ ' … … “ … Q t Π Θ t −(Π− Θ) Π (a) . Θ ε s reso... |

77 | HLS: A framework for composing soft real-time schedulers
- REGEHR, STANKOVIC
(Show Context)
Citation Context ...del that consists of three elements: a resource model, a scheduling algorithm, and a workload model. In real-time scheduling, there has been a growing attention to a hierarchical scheduling framework =-=[4, 8, 10, 12, 5]-=- that supports hierarchical resource sharing under different scheduling algorithms for different scheduling services. A hierarchical scheduling framework can be generally represented as a tree, or a h... |

73 | A model of hierarchical real-time virtual resources
- Feng, Mok
- 2002
(Show Context)
Citation Context ...del that consists of three elements: a resource model, a scheduling algorithm, and a workload model. In real-time scheduling, there has been a growing attention to a hierarchical scheduling framework =-=[4, 8, 10, 12, 5]-=- that supports hierarchical resource sharing under different scheduling algorithms for different scheduling services. A hierarchical scheduling framework can be generally represented as a tree, or a h... |

56 | Compositional real-time scheduling framework with periodic model
- Shin, Lee
- 2008
(Show Context)
Citation Context ...ains an error, and we leave out the proofs of the theorem. We recognized this error while working on extending this technical report to a journal paper in 2004 3 . We refer to our ACM TECS 2008 paper =-=[13]-=- for a new RM utilization bound that resolves the error. - Added in Jan. 2010. 3 This error was rediscovered by van Renssen et. al, ”On Utilization Bounds for a Periodic Resource under Rate Monotonic ... |

53 | A fixed-priority-driven open environment for realtime applications
- Kuo, Li
- 1999
(Show Context)
Citation Context |

49 | Weakly hard real-time systems
- BERNAT, BURNS, et al.
- 2001
(Show Context)
Citation Context ...k is to extend our resource model and its scheduling theory to different task workload models for soft real-time applications such as ç©bwR the -firm deadline model [6] and the weakly hard task model =-=[3]-=-. In this paper, we assume that each task is independent. However, tasks may interact with each other through communications and synchronizations. The study of this issue remains as a topic of future ... |

22 |
A hierarchical extension to the constant bandwidth server framework
- Lipari, Baruah
- 2001
(Show Context)
Citation Context |

3 |
A Llamosi. Weakly hard real-time systems
- Bernat, Burns
(Show Context)
Citation Context ...k is to extend our resource model and its scheduling theory to different task workload models for soft real-time applications such as the (m, k)-firm deadline model [6] and the weakly hard task model =-=[3]-=-. In this paper, we assume that each task is independent. However, tasks may interact with each other through communications and synchronizations. The study of this issue remains as a topic of future ... |

2 |
On utilization bounds for a periodic resource under rate monotonic scheduling
- Renssen, Geuns, et al.
- 2009
(Show Context)
Citation Context ...und that resolves the error. - Added in Jan. 2010. 3 This error was rediscovered by van Renssen et. al, ”On Utilization Bounds for a Periodic Resource under Rate Monotonic Scheduling”, ECRTS 2009 WIP =-=[16]-=- 12Definition 6.1 (Composition Method) Given multiple scheduling models M1, · · · , Mn, we derive a scheduling model MP (WP , ΓP , AP ) from M1, · · · , Mn as follows: In this subsection, we derive a... |