- scheduling queue
- очередь планируемых заданий
Большой англо-русский и русско-английский словарь. 2001.
scheduling queue
Смотреть что такое "scheduling queue" в других словарях:
Scheduling (computing) — This article is about processes assignment in operating systems. For other uses, see Scheduling (disambiguation). Scheduling is a key concept in computer multitasking, multiprocessing operating system and real time operating system designs.… … Wikipedia
Scheduling (Informatik) — Ein Prozess Scheduler (Scheduler = Steuerprogramm) ist eine Arbitrationslogik, der die zeitliche Ausführung mehrerer Prozesse in Betriebssystemen regelt. Prozess Scheduler kann man grob in unterbrechende (preemptive) und nicht unterbrechende (non … Deutsch Wikipedia
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
Virtual queue — Virtual queuing is a concept that is used in inbound call centers. Call centers utilize an Automatic Call Distributor (ACD) to distribute incoming calls to specific resources (agents) in the center. ACDs are capable of holding queued calls in… … Wikipedia
Multilevel feedback queue — In computer science, a multilevel feedback queue is a scheduling algorithm. It is intended to meet the following design requirements for multimode systems: Give preference to short jobs. Give preference to I/O bound processes. Separate processes… … Wikipedia
Round-robin scheduling — Round robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in order, handling all processes without priority. Round robin scheduling is both… … Wikipedia
Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or … Wikipedia
Transposition driven scheduling — (TDS) is a load balancing algorithm for parallel computing. It was developed at the Vrije Universiteit in Amsterdam, The Netherlands as an algorithm to solve puzzles. The algorithm provides near linear speedup with some problems and scales… … 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
Three-Level-Scheduling — (TLS) TLS unterteilt den Scheduling Prozess in 3 Teilprozesse: Admission Scheduler Memory Scheduler CPU Scheduler Three Level Scheduling Am Beginn dieses Schedulingverfahrens steht ein Input Queue. Dabei handelt es sich lediglich um eine… … Deutsch Wikipedia
Prioritäts-Scheduling — Das Prioritätsscheduling (auch PS – priority scheduling) ist ein in Betriebssystemen häufig verwendetes Scheduling Verfahren. Das Prinzip ist einfach: Jedem Prozess wird eine Priorität zugewiesen und nur der lauffähige Prozess mit höchster… … Deutsch Wikipedia
