Scheduling algorithm - Revision history

Jdaloner: Added specific article section that covers this topic/term.

2015-05-06T03:14:14Z

Added specific article section that covers this topic/term.

← Previous revision		Revision as of 03:14, 6 May 2015
Line 1:		Line 1:
	#REDIRECT [[Scheduling (computing)]]		#REDIRECT [[Scheduling (computing)#Scheduling disciplines]]

Kvng: merged to Scheduling (computing)

2011-11-25T19:12:59Z

merged to Scheduling (computing)

← Previous revision		Revision as of 19:12, 25 November 2011
Line 1:		Line 1:
		⚫	#REDIRECT [[Scheduling (computing)]]
	In [[computer science]], a '''scheduling algorithm''' is the method by which [[Thread (computer science)\|threads]], [[Process (computing)\|processes]] or data [[Flow (computer networking)\|flows]] are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to [[Load balancing (computing)\|load balance]] a system effectively or achieve a target [[quality of service]]. The need for a scheduling algorithm arises from the requirement for most modern systems to perform [[computer multitasking\|multitasking]] (execute more than one process at a time) and [[multiplexing]] (transmit multiple flows simultaneously).

	==In computing and multitasking==
	The algorithm used may be as simple as [[Round-robin scheduling\|round-robin]] in which each process is given equal time (for instance 1 ms, usually between 1 ms and 100 ms) in a cycling list. So, process A executes for 1 ms, then process B, then process C, then back to process A.

	More advanced algorithms take into account process priority, or the importance of the process. This allows some processes to use more time than other processes. The kernel always uses whatever resources it needs to ensure proper functioning of the system, and so can be said to have infinite priority. In [[Symmetric multiprocessing\|SMP]](symmetric multiprocessing) systems, [[processor affinity]] is considered to increase overall system performance, even if it may cause a process itself to run more slowly. This generally improves performance by reducing [[cache thrashing]].

	==In computer networks and multiplexing==
	In [[packet-switched]] [[computer networks]] and other [[statistical multiplexing]], the notion of a '''scheduling algorithm''' is used as an alternative to [[FIFO (computing)\|first-come first-served]] queuing of data packets.

	The simplest best-effort scheduling algorithms are [[round-robin scheduling\|round-robin]], [[fair queuing]] (a [[max-min fair]] scheduling algorithm), [[proportionally fair]] scheduling and [[maximum throughput scheduling\|maximum throughput]]. If differentiated or guaranteed [[quality of service]] is offered, as opposed to best-effort communication, [[weighted fair queuing]] may be utilized.

	In advanced packet radio wireless networks such as [[HSDPA]] (High-Speed Downlink Packet Access ) [[3.5G]] cellular system, '''channel-dependent scheduling''' may be used to take advantage of [[channel state information]]. If the channel conditions are favourable, the [[throughput]] and [[system spectral efficiency]] may be increased. In even more advanced systems such as [[LTE_Advanced\|LTE]], the scheduling is combined by channel-dependent packet-by-packet [[dynamic channel allocation]], or by assigning [[OFDMA]] multi-carriers or other [[frequency-domain equalization]] components to the users that best can utilize them.

	==In computer I/O==
	Determines the order in which disk I/O requests are pushed to the disk device.

	==See also==
	* [[Activity selection problem]]
	* [[Atropos scheduler]]
	* [[Completely Fair Scheduler]]
	* [[Dynamic priority scheduling]]
	* [[Earliest deadline first scheduling]]
	* [[Foreground-background]]
	* [[I/O scheduling]]
	* [[Job Shop Scheduling]]
	* [[Least slack time scheduling]]
	* [[Lottery scheduling]]
	* [[Multilevel feedback queue]]
	* [[O(1) scheduler]]
	* [[Rate-monotonic scheduling]]
	* [[Round-robin scheduling]]
	* [[Scheduling (communications)]]
⚫	* [[Scheduling (computing)]]

	==External links==
	* [http://joshaas.net/linux/ Josh Aas' introduction to the Linux 2.6.8.1 CPU scheduler implementation]
	* Peter Brucker, Sigrid Knust. Complexity results for scheduling problems [http://www.mathematik.uni-osnabrueck.de/research/OR/class/]
	*[http://rtime.felk.cvut.cz/scheduling-toolbox TORSCHE Scheduling Toolbox for Matlab] is a toolbox of scheduling and graph algorithms.

	[[Category:Scheduling algorithms\|*]]
	[[Category:Planning]]

	[[es:Algoritmo de planificación]]
	[[he:אלגוריתם תזמון]]
	[[ja:スケジューリング#スケジューリングアルゴリズム]]
	[[sl:Razvrščevalni algoritem]]

Exec second: fix inter-wiki link [ja].

2011-08-20T03:52:36Z

fix inter-wiki link [ja].

← Previous revision		Revision as of 03:52, 20 August 2011
Line 44:		Line 44:
	[[es:Algoritmo de planificación]]		[[es:Algoritmo de planificación]]
	[[he:אלגוריתם תזמון]]		[[he:אלגוריתם תזמון]]
	[[ja:パケ~~ット・~~スケジューリング]]		[[ja:スケジューリング#スケジューリングアルゴリズム]]
	[[sl:Razvrščevalni algoritem]]		[[sl:Razvrščevalni algoritem]]

ChE Fundamentalist: /* See also */

2011-08-05T04:43:58Z

Kvng: Reverted 1 edit by 122.252.234.214 (talk) identified as vandalism to last revision by Yerpo. (TW)

2011-07-30T16:31:49Z

Reverted 1 edit by 122.252.234.214 (talk) identified as vandalism to last revision by Yerpo. (TW)

← Previous revision		Revision as of 16:31, 30 July 2011
Line 1:		Line 1:
			In [[computer science]], a '''scheduling algorithm''' is the method by which [[Thread (computer science)\|threads]], [[Process (computing)\|processes]] or data [[Flow (computer networking)\|flows]] are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to [[Load balancing (computing)\|load balance]] a system effectively or achieve a target [[quality of service]]. The need for a scheduling algorithm arises from the requirement for most modern systems to perform [[computer multitasking\|multitasking]] (execute more than one process at a time) and [[multiplexing]] (transmit multiple flows simultaneously).

	==In computing and multitasking==		==In computing and multitasking==

122.252.234.214 at 03:49, 29 July 2011

2011-07-29T03:49:40Z

← Previous revision		Revision as of 03:49, 29 July 2011
Line 1:		Line 1:
	In [[computer science]], a '''scheduling algorithm''' is the method by which [[Thread (computer science)\|threads]], [[Process (computing)\|processes]] or data [[Flow (computer networking)\|flows]] are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to [[Load balancing (computing)\|load balance]] a system effectively or achieve a target [[quality of service]]. The need for a scheduling algorithm arises from the requirement for most modern systems to perform [[computer multitasking\|multitasking]] (execute more than one process at a time) and [[multiplexing]] (transmit multiple flows simultaneously).

	==In computing and multitasking==		==In computing and multitasking==

Yerpo: /* External links */ :sl:Razvrščevalni algoritem

2011-07-17T08:09:39Z

External links: sl:Razvrščevalni algoritem

← Previous revision		Revision as of 08:09, 17 July 2011
Line 44:		Line 44:
	[[he:אלגוריתם תזמון]]		[[he:אלגוריתם תזמון]]
	[[ja:パケット・スケジューリング]]		[[ja:パケット・スケジューリング]]
			[[sl:Razvrščevalni algoritem]]

Ida Shaw: Foreground-background

2010-08-09T05:47:48Z

Foreground-background

← Previous revision		Revision as of 05:47, 9 August 2010
Line 21:		Line 21:
	* [[Dynamic priority scheduling]]		* [[Dynamic priority scheduling]]
	* [[Earliest deadline first scheduling]]		* [[Earliest deadline first scheduling]]
			* [[Foreground-background]]
	* [[I/O scheduling]]		* [[I/O scheduling]]
	* [[Job Shop Scheduling]]		* [[Job Shop Scheduling]]

208.125.53.170: /* In computer networks and multiplexing */

2010-07-26T17:54:13Z

In computer networks and multiplexing

← Previous revision		Revision as of 17:54, 26 July 2010
Line 11:		Line 11:
	The simplest best-effort scheduling algorithms are [[round-robin scheduling\|round-robin]], [[fair queuing]] (a [[max-min fair]] scheduling algorithm), [[proportionally fair]] scheduling and [[maximum throughput scheduling\|maximum throughput]]. If differentiated or guaranteed [[quality of service]] is offered, as opposed to best-effort communication, [[weighted fair queuing]] may be utilized.		The simplest best-effort scheduling algorithms are [[round-robin scheduling\|round-robin]], [[fair queuing]] (a [[max-min fair]] scheduling algorithm), [[proportionally fair]] scheduling and [[maximum throughput scheduling\|maximum throughput]]. If differentiated or guaranteed [[quality of service]] is offered, as opposed to best-effort communication, [[weighted fair queuing]] may be utilized.

	In advanced packet radio wireless networks such as [[HSDPA]] (High-Speed Downlink Packet Access ) [[3.5G]] cellular system, '''channel-dependent scheduling''' may be used to take advantage of [[channel state information]]. If the channel conditions are favourable, the [[throughput]] and [[system spectral efficiency]] may be increased. In even more advanced systems such as [[~~long-term evolution~~\|LTE]], the scheduling is combined by channel-dependent packet-by-packet [[dynamic channel allocation]], or by assigning [[OFDMA]] multi-carriers or other [[frequency-domain equalization]] components to the users that best can utilize them.		In advanced packet radio wireless networks such as [[HSDPA]] (High-Speed Downlink Packet Access ) [[3.5G]] cellular system, '''channel-dependent scheduling''' may be used to take advantage of [[channel state information]]. If the channel conditions are favourable, the [[throughput]] and [[system spectral efficiency]] may be increased. In even more advanced systems such as [[LTE_Advanced\|LTE]], the scheduling is combined by channel-dependent packet-by-packet [[dynamic channel allocation]], or by assigning [[OFDMA]] multi-carriers or other [[frequency-domain equalization]] components to the users that best can utilize them.

	==In computer I/O==		==In computer I/O==

Ettrig: it should be noted that (removed)

2010-07-24T14:07:18Z

it should be noted that (removed)

← Previous revision		Revision as of 14:07, 24 July 2010
Line 4:		Line 4:
	The algorithm used may be as simple as [[Round-robin scheduling\|round-robin]] in which each process is given equal time (for instance 1 ms, usually between 1 ms and 100 ms) in a cycling list. So, process A executes for 1 ms, then process B, then process C, then back to process A.		The algorithm used may be as simple as [[Round-robin scheduling\|round-robin]] in which each process is given equal time (for instance 1 ms, usually between 1 ms and 100 ms) in a cycling list. So, process A executes for 1 ms, then process B, then process C, then back to process A.

	More advanced algorithms take into account process priority, or the importance of the process. This allows some processes to use more time than other processes. ~~It should be noted that the~~ kernel always uses whatever resources it needs to ensure proper functioning of the system, and so can be said to have infinite priority. In [[Symmetric multiprocessing\|SMP]](symmetric multiprocessing) systems, [[processor affinity]] is considered to increase overall system performance, even if it may cause a process itself to run more slowly. This generally improves performance by reducing [[cache thrashing]].		More advanced algorithms take into account process priority, or the importance of the process. This allows some processes to use more time than other processes. The kernel always uses whatever resources it needs to ensure proper functioning of the system, and so can be said to have infinite priority. In [[Symmetric multiprocessing\|SMP]](symmetric multiprocessing) systems, [[processor affinity]] is considered to increase overall system performance, even if it may cause a process itself to run more slowly. This generally improves performance by reducing [[cache thrashing]].

	==In computer networks and multiplexing==		==In computer networks and multiplexing==

← Previous revision		Revision as of 04:43, 5 August 2011
Line 17:		Line 17:

	==See also==		==See also==
			* [[Activity selection problem]]
	* [[Atropos scheduler]]		* [[Atropos scheduler]]
	* [[Completely Fair Scheduler]]		* [[Completely Fair Scheduler]]