3 edition of Scheduling periodic jobs using imprecise results found in the catalog.
Scheduling periodic jobs using imprecise results
|Series||Report no -- UIUCDCS-R-87-1307., NASA-CR -- 183120., Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) -- no. UIUCDCS-R-87-1307., NASA contractor report -- NASA CR-183120.|
|Contributions||Liu, Jane W. S., Lin, Kwei-Jay., United States. National Aeronautics and Space Administration.|
|The Physical Object|
The book begins by providing an introduction to and basic concepts from discrete mathematics. Single and multiple processor systems are covered, with a focus on multiprocessor tasks and hard real-time systems. Flow shop and open shop scheduling, as well as scheduling in job shops, are explained in detail. Stochastic Single Machine Family Scheduling To Minimize the Number of Risky Jobs. 23rd Annual POMS Conference. Suer, G., Erenay, B., Chen, M. (). Analysis of Evolutionary Process in a Lot Sizing Application. Complex Adaptive Systems Conference.
Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks Gang Chen, Nan Guan, Di Liu, Qingqiang He, Kai Huang, Todor Stefanov, Wang Yi Abstract—Mixed-criticalitymodels are an emerging paradigm for the design of real-timesystems because of theirsigniﬁcantly improved resource efﬁciency. Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy by:
Software Engineering in SRE. Written by Dave Helstroom and Trisha Weir with Evan Leonard and Kurt Delimon Edited by Kavita Guliani. Ask someone to name a Google software engineering effort and they’ll likely list a consumer-facing product like Gmail or Maps; some might even mention underlying infrastructure such as Bigtable or Colossus. D. Tandem scheduling B. Fast tracking is the process of allowing successor phases (or activities) to begin before predecessor phases (or activities) are complete. A is incorrect because crashing is the process of adding more resources to the project in an attempt to complete the project sooner.
The Interpretation of Dreams
The Truth You Know You Know
Desserts including beverages; 2000 favorite recipes from women of the United Church of Christ.
Navigation channel improvement, Columbia River, Oregon and Washington, Oak Point to Longview Reach, river miles 53 to 65
A bill to increase the efficiency of the Cavalry of the Confederate States.
A season at Brighton
Nuclear levels excited in neutron capture reactions and radioactive decays
Problems connected with the use of subsurface neutron moisture gauges and their solution
Why the apple doesnt fall far
Get this from a library. Scheduling periodic jobs using imprecise results. [Jen-Yao Chung; Jane W S Liu; Kwei-Jay Lin; United States. National Aeronautics and Space Administration.].
Get this from a library. Scheduling real-time, periodic jobs using imprecise results. [Jane W S Liu; Kwei-Jay Lin; Swaminathan Natarajan; United States. National Aeronautics and. Abstract. The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks.
This paper provides an overview of the problems in scheduling imprecise computations. It describes several workload models of imprecise computation that Cited by: We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems.
A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed by: Specifically, an imprecise mechanism for the generation and use of approximate results can be integrated in a natural way with traditional checkpointing and replication mechanisms.
Algorithms and process structures for this integration and rules for determining when approximate results can be used in place of the desired results are by: A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text.
The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Two workload models of imprecise computations are presented.
Scheduling algorithms that exploit this tradeoff are described. These include algorithms for scheduling to minimize total error, scheduling periodic jobs, and scheduling parallelizable tasks.
A queuing-theoretical formulation of the imprecise scheduling problem is by: Pont, M.J. and Ong, R.H.L. Using watchdog timers to improve the reliability of single-processor embedded systems: Seven new patterns and a case study. Proceedings of the First Nordic Conference on Pattern Languages Cited by: Optimal scheduling of imprecise computation tasks in the presence of multiple faults.
Proceedings Seventh International Conference on Real-Time Computing Systems and Applications, Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward by: () Scheduling periodic jobs that allow imprecise results. IEEE Transactions on Computers() A state-of-the-art review of Cited by: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced topics on the subject.
It assembles researchers from all relevant disciplines in order to facilitate cross-fertilization and create new scheduling insights. Search the catalogue for collection items held by the National Library of Australia New Search eResources User Lists Feedback Help Collection Delivery Times Visitor Update: COVID Ask a Librarian Due to the need to contain the spread of coronavirus (COVID) the Library building and reading rooms are closed to visitors until further notice.
Pfair algorithms produce schedules in which jobs are executed at a steady rate. This is similar to fair sequences in Chap except that the jobs are periodic, real-time jobs. Chapter 31 discusses several approaches in scheduling periodic. into periodic windows, each containing k consecutive jobs of a given task, and within each window, h jobs of that task must meet their deadlines.
(Any task system that is schedulable using the (h;k) model is also schedulable using the window-constrained model.) Lin and Natarajan () proposed the imprecise computation model for tasks.
Researchers in management, industrial engineering, operations, and computer science have intensely studied scheduling for more than 50 years, resulting in an astounding body of knowledge in this field.
Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced. Rate-monotonic scheduling for hard-real-time systems but also on the time at which the results are available.
A scheduling algorithm specifies an order in which all the tasks are to be executed, in a way that all the time deadlines are met.
focusing mainly on fixed priority, preemptive scheduling of periodic tasks on a single processor Cited by: Reservation-based scheduling. Embedded and 2 |57 Networked Systems Build an example of an EDF schedule with three jobs such that two jobs miss their deadline because of an overrun in the first job Periodic load can also be reduced by skipping some jobs, once in a while.
• jobs may depend on results of other jobs • e.g. producer / consumer scenarios • precedence graphs: • partial order relation on jobs • shared data: • jobs use some resource (e.g.
critical section) that can be used by one job at a time only. System performance in the various configurations is considered by using throughput and response-time distribution as reward rates.
Since the Markov chains used in computing the distribution of response time are often very large and complex, a higher level interface based on a variation of stochastic Petri nets called stochastic reward nets is by:. Scheduling jobs on dynamic parallel machines with sequence-dependent setup times 23 July | The International Journal of Advanced Manufacturing Technology, Vol.
47, No. Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline VersionCited by: Competitive on-line scheduling of imprecise computations.
Proceedings of the Hawaii International Conference on System Sciences, Kihei, Maui, Hawaii. January Sanjoy Baruah. Fairness in periodic real-time scheduling.
Proceedings of the Real-Time Systems Symposium, ppPisa, Italy. December IEEE Computer Society Press.Handbook of Scheduling: Algorithms, Models, and Performance Analysis collects all of the up-to-date information on approximation algorithms into one resource that will prove useful to a wide range of users from computer science, industrial engineering, operations research, and management science.