Algorithms For Scheduling Tasks With Input Error And End To End Deadlines
Download Algorithms For Scheduling Tasks With Input Error And End To End Deadlines PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Algorithms For Scheduling Tasks With Input Error And End To End Deadlines book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Algorithms for Scheduling Tasks with Input Error and End-to-end Deadlines
Abstract: "This paper describes heuristic algorithms for scheduling preemptive, imprecise, composite tasks with input error and end- to-end timing constraints. Each composite task consists of a chain of component tasks, where each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the mandatory and optional parts of the component task may be extended in order to compensate for input error. We use a two-level scheduler. At the high level, the scheduler schedules the composite tasks preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The result is the total amount of time budgeted to each composite task in order for all composite tasks to meet their end-to-end deadlines. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of each composite task."
Analytical and Stochastic Modeling Techniques and Applications
Author: Khalid Al-Begain
language: en
Publisher: Springer Science & Business Media
Release Date: 2011-06-14
This book constitutes the refereed proceedings of the 18th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2011, held in Venice, Italyin June 2011. The 24 revised full papers presented were carefully reviewed and selected from many submissions.The papers are organized in topical sections on queueing theory, software and computer systems, statistics and inference, telecommunication networks, and performance and performability.
Handbook of Scheduling
This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.