Dynamic priority scheduling
- Dynamic priority scheduling
-
Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of dynamic priority scheduling is to adapt to dynamically changing progress and form an optimal configuration in self-sustained manner. It can be very hard to produce well-defined policies to achieve the goal depends on difficulty of given problem.
Earliest deadline first scheduling and Least slack time scheduling are examples of Dynamic priority scheduling algorithms.
Measurement on effectiveness of scheduling
The idea of dynamic priority scheduling is to confine focus on algorithms that assign priorities based on temporal parameters and maximize of resources utilization; This utilization measurement of a certain scheduling, called schedulable utilization, is scaled from 0 to 1, and the higher the schedulable utilization means the better algorithm. Every set of periodic tasks with total utilization less or equal than the schedulable utilization of an algorithm can be feasibly scheduled by that algorithm.
References
Categories:
- Scheduling algorithms
- Computer science stubs
Wikimedia Foundation.
2010.
Look at other dictionaries:
Scheduling algorithm — In computer science, a scheduling algorithm is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or … Wikipedia
Rate-monotonic scheduling — In computer science, rate monotonic scheduling [citation|first1=C. L.|last1=Liu|authorlink1=Chung Laung Liu|first2=J.|last2=Layland|title=Scheduling algorithms for multiprogramming in a hard real time environment|journal=Journal of the ACM|volume … Wikipedia
Earliest deadline first scheduling — Earliest deadline first (EDF) scheduling is a dynamic scheduling algorithm used in real time operating systems. It places processes in a priority queue. Whenever a scheduling event occurs (task finishes, new task released, etc.) the queue will be … Wikipedia
Maximum throughput scheduling — is a procedure for scheduling data packets in a packet switched best effort communications network, typically a wireless network, in view to maximize the total throughput of the network, or the system spectral efficiency in a wireless network.… … Wikipedia
Windows NT Processor scheduling — Without processor scheduling the Microprocessor would give attention to jobs based on when they arrived in the queue. This is not always optimal. Some applications should be given more time with the processor because that program is more critical … Wikipedia
Real time database — A real time database is a processing system designed to handle workloads whose state is constantly changing (Buchmann). This differs from traditional databases containing persistent data, mostly unaffected by time. For example, a stock market… … Wikipedia
OS-9 — For the Macintosh operating system, see Mac OS 9. OS 9 Company / developer Microware (now owned by RadiSys Corporation) Programmed in C, Assembly language OS family Unix like Working state Current … Wikipedia
Linux kernel — Linux Linux kernel 3.0.0 booting Company / developer Linus Torvalds and thousands … Wikipedia
Technical features new to Windows Vista — This article is part of a series on Windows Vista New features Overview Technical and core system Security and safety Networking technologies I/O technologies Management and administration Removed features … Wikipedia
MUSE QoS solution — MUSE advocates the introduction of QoS into IP networks as this allows better resource utilization while at the same time it allows to serve multiple and different applications with the transport quality they actually need.The solution needs to… … Wikipedia
