Strayer, W. T., "Function-Driven Scheduling: A General Framework for Expression and Analysis of Scheduling," Dissertation, University of Virginia, Department of Computer Science, May 1992.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Analysis of Deadline-Driven Scheduling Algorithms Using.. - Strayer (1992) (Correct)
....or system characteristics for discriminating among competing tasks. The task set is comprised of tasks that either are dependent on the particular attributes or are forced to be. Expression of scheduling algorithms using function driven techniques, in particular the importance abstraction [STRA92] employs functions to profile task importance; the scheduler greedily chooses the most important task at every point in time. We explore the use of this abstraction for the class of task sets that have at least some deadline driven tasks but are not limited to tasks with only deadlines as ....
....task sets only, much work has been done to modify the algorithm to include aperiodic tasks, tasks with a secondary level of criticality, and task sets with unknown sizes. The techniques used to modify rate monotonic theory to include these cases are surveyed in [SHA90] The importance abstraction [STRA92] is a framework for describing scheduling policies by focusing on how importance each task is to the system. Every system has a goal and the tasks within the system are processed with the intent of meeting the system goal. A task within the system is viewed as important to the system vis a vis ....
Strayer, W. T., "Function-Driven Scheduling: A General Framework for Expression and Analysis of Scheduling," Dissertation, University of Virginia, Department of Computer Science, May 1992.
Concurrency Control Algorithms for Real-Time Database Systems - Lee (1994) (9 citations) (Correct)
....to reactor. With respect to the effect of missing a transaction s deadline, we divide real time 5 transactions into three groups: hard deadline, soft deadline, and firm deadline transactions. This categorization can be shown clearly by using the value function model for realtime scheduling [Jens85, Lock86, Stra92]. The key idea of the value function model is that the completion of a transaction has a value, i.e. importance to the application that can be expressed as a function of the completion time. Whereas in reality arbitrary types of value functions can be associated with activities, the above ....
Strayer, W. T., "Function-Driven Scheduling: A General Framework for 142 Expression and Analysis of Scheduling," Ph.D. Dissertation, Department of Computer Science, University of Virginia, May 1992.
Adaption of Time-Sensitive Tasks on Shared Memory.. - Andersson (1999) (Correct)
....the timing requirements and the quality delivered by the algorithm. As shown in the last sentence, timing requirements depend on the state of the environment. Some researchers have taken advantage of this, and let the scheduling algorithm depend on the current state of the environment at run time [32]. We believe that performance measures that are dependent on the environment are more relevant for ranking adaptive real time systems than artificial performance measures such as: success ratio, maximum lateness, and utilization. However, truthfully modeling all interactions of the external ....
W. Strayer. Function-Driven Scheduling: A General Framework for Expression and Analysis of Scheduling. PhD thesis, University of Virginia, 1992.
Analysis of Deadline-Driven Scheduling Algorithms Using.. - Strayer (1992) Self-citation (Strayer) (Correct)
....or system characteristics for discriminating among competing tasks. The task set is comprised of tasks that either are dependent on the particular attributes or are forced to be. Expression of scheduling algorithms using function driven techniques, in particular the importance abstraction [STRA92] employs functions to profile task importance; the scheduler greedily chooses the most important task at every point in time. We explore the use of this abstraction for the class of task sets that have at least some deadline driven tasks but are not limited to tasks with only deadlines as ....
....task sets only, much work has been done to modify the algorithm to include aperiodic tasks, tasks with a secondary level of criticality, and task sets with unknown sizes. The techniques used to modify rate monotonic theory to include these cases are surveyed in [SHA90] The importance abstraction [STRA92] is a framework for describing scheduling policies by focusing on how importance each task is to the system. Every system has a goal and the tasks within the system are processed with the intent of meeting the system goal. A task within the system is viewed as important to the system vis a vis ....
Strayer, W. T., "Function-Driven Scheduling: A General Framework for Expression and Analysis of Scheduling," Dissertation, University of Virginia, Department of Computer Science, May 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC