Get it on Google Play
New! Download Unionpedia on your Android™ device!
Faster access than browser!

Scheduling (computing)

Index Scheduling (computing)

In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work. [1]

134 relations: Abraham Silberschatz, Activity selection problem, Aging (scheduling), Alan Cox, AmigaOS, Atropos scheduler, Automated planning and scheduling, Automation, Batch processing, Brain Fuck Scheduler, Cambridge University Press, Carbon (API), Central processing unit, Channel allocation schemes, Channel state information, Classic Mac OS, Completely Fair Scheduler, Computer cluster, Computer multitasking, Computer network, Computing, Con Kolivas, Concurrent computing, Context (computing), Context switch, Cooperative multitasking, Coscheduling, CPU time, CPU-bound, Cyclic executive, Dynamic priority scheduling, Embedded system, Execution model, Expansion card, Fair queuing, Fair-share scheduling, FIFO (computing and electronics), Flow shop scheduling, Foreground-background, FreeBSD, Guowang Miao, Hard disk drive, High Speed Packet Access, I/O bound, I/O scheduling, Ingo Molnár, Interrupt, Interrupt handler, Interruptible operating system, Job scheduler, ..., Job shop scheduling, Latency (engineering), Least slack time scheduling, Linux, Linux distribution, Linux kernel, Load balancing (computing), Logarithm, Lottery scheduling, LTE Advanced, Mac OS 9, MacOS, Makespan, Max-min fairness, Maximum throughput scheduling, Mobile device management, MS-DOS, Multilevel feedback queue, NetBSD, Nice (Unix), O(1) scheduler, O(n) scheduler, Open-shop scheduling, Operating system, Orthogonal frequency-division multiple access, OS/360 and successors, Packet switching, Page fault, Paging, Preemption (computing), Priority inversion, Process (computing), Process state, Processor affinity, Programmable interval timer, Proportionally fair, Protection ring, Quality of service, Queueing theory, Rate-monotonic scheduling, Real-time computing, Red–black tree, Render farm, Resource-Task Network, Response time (technology), Robotics, Round-robin scheduling, Router (computing), Run queue, Scheduling (computing), Scheduling (production processes), Shortest job next, Signal programming, Single-carrier FDMA, Solaris (operating system), Spectral efficiency, Spooling, Starvation (computer science), State (computer science), Statistical time-division multiplexing, Stochastic scheduling, Stride scheduling, Supercomputer, SUSE Linux Enterprise, Symmetric multiprocessing, System call, Telecommunications link, Thrashing (computer science), Thread (computing), Throughput, Time limit, Time Stamp Counter, Time-utility function, Traffic flow (computer networking), User space, Weighted fair queueing, Windows 3.1x, Windows 95, Windows 98, Windows ME, Windows NT, Windows Vista, Work-conserving scheduler, Workload Manager. Expand index (84 more) »

Abraham Silberschatz

Avi Silberschatz was born in Haifa, Israel.

New!!: Scheduling (computing) and Abraham Silberschatz · See more »

Activity selection problem

The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi).

New!!: Scheduling (computing) and Activity selection problem · See more »

Aging (scheduling)

In Operating systems, aging (US English) or ageing is a scheduling technique used to avoid starvation.

New!!: Scheduling (computing) and Aging (scheduling) · See more »

Alan Cox

Alan Cox (born 22 July 1968) is a British computer programmer who has been a key figure in the development of Linux.

New!!: Scheduling (computing) and Alan Cox · See more »


AmigaOS is a family of proprietary native operating systems of the Amiga and AmigaOne personal computers.

New!!: Scheduling (computing) and AmigaOS · See more »

Atropos scheduler

In computer science, Atropos is a real-time scheduling algorithm developed at Cambridge University.

New!!: Scheduling (computing) and Atropos scheduler · See more »

Automated planning and scheduling

Automated planning and scheduling, sometimes denoted as simply AI Planning, is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles.

New!!: Scheduling (computing) and Automated planning and scheduling · See more »


Automation is the technology by which a process or procedure is performed without human assistance.

New!!: Scheduling (computing) and Automation · See more »

Batch processing

In computing, batch processing refers to a computer working through a queue or batch of separate jobs (programs) without manual intervention (non-interactive).

New!!: Scheduling (computing) and Batch processing · See more »

Brain Fuck Scheduler

The Brain Fuck Scheduler (BFS) is a process scheduler designed for the Linux kernel in August 2009 as an alternative to the Completely Fair Scheduler and the O(1) scheduler.

New!!: Scheduling (computing) and Brain Fuck Scheduler · See more »

Cambridge University Press

Cambridge University Press (CUP) is the publishing business of the University of Cambridge.

New!!: Scheduling (computing) and Cambridge University Press · See more »

Carbon (API)

Carbon is one of Apple Inc.'s C-based application programming interfaces (APIs) for the Macintosh operating system.

New!!: Scheduling (computing) and Carbon (API) · See more »

Central processing unit

A central processing unit (CPU) is the electronic circuitry within a computer that carries out the instructions of a computer program by performing the basic arithmetic, logical, control and input/output (I/O) operations specified by the instructions.

New!!: Scheduling (computing) and Central processing unit · See more »

Channel allocation schemes

In radio resource management for wireless and cellular networks, channel allocation schemes allocate bandwidth and communication channels to base stations, access points and terminal equipment.

New!!: Scheduling (computing) and Channel allocation schemes · See more »

Channel state information

In wireless communications, channel state information (CSI) refers to known channel properties of a communication link.

New!!: Scheduling (computing) and Channel state information · See more »

Classic Mac OS

Classic Mac OS is a colloquial term used to describe a series of operating systems developed for the Macintosh family of personal computers by Apple Inc. from 1984 until 2001.

New!!: Scheduling (computing) and Classic Mac OS · See more »

Completely Fair Scheduler

The Completely Fair Scheduler (CFS) is a process scheduler which was merged into the 2.6.23 (October 2007) release of the Linux kernel and is the default scheduler.

New!!: Scheduling (computing) and Completely Fair Scheduler · See more »

Computer cluster

A computer cluster is a set of loosely or tightly connected computers that work together so that, in many respects, they can be viewed as a single system.

New!!: Scheduling (computing) and Computer cluster · See more »

Computer multitasking

In computing, multitasking is the concurrent execution of multiple tasks (also known as processes) over a certain period of time.

New!!: Scheduling (computing) and Computer multitasking · See more »

Computer network

A computer network, or data network, is a digital telecommunications network which allows nodes to share resources.

New!!: Scheduling (computing) and Computer network · See more »


Computing is any goal-oriented activity requiring, benefiting from, or creating computers.

New!!: Scheduling (computing) and Computing · See more »

Con Kolivas

Con Kolivas is an Australian anaesthetist.

New!!: Scheduling (computing) and Con Kolivas · See more »

Concurrent computing

Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts).

New!!: Scheduling (computing) and Concurrent computing · See more »

Context (computing)

In computer science, a task context is the minimal set of data used by a task (which may be a process or thread) that must be saved to allow a task to be interrupted, and later continued from the same point.

New!!: Scheduling (computing) and Context (computing) · See more »

Context switch

In computing, a context switch is the process of storing the state of a process or of a thread, so that it can be restored and execution resumed from the same point later.

New!!: Scheduling (computing) and Context switch · See more »

Cooperative multitasking

Cooperative multitasking, also known as non-preemptive multitasking, is a style of computer multitasking in which the operating system never initiates a context switch from a running process to another process.

New!!: Scheduling (computing) and Cooperative multitasking · See more »


Coscheduling is the principle for concurrent systems of scheduling related processes to run on different processors at the same time (in parallel).

New!!: Scheduling (computing) and Coscheduling · See more »

CPU time

CPU time (or process time) is the amount of time for which a central processing unit (CPU) was used for processing instructions of a computer program or operating system, as opposed to elapsed time, which includes for example, waiting for input/output (I/O) operations or entering low-power (idle) mode.

New!!: Scheduling (computing) and CPU time · See more »


In computer science, a computer is CPU-bound (or compute-bound) when the time for it to complete a task is determined principally by the speed of the central processor: processor utilization is high, perhaps at 100% usage for many seconds or minutes.

New!!: Scheduling (computing) and CPU-bound · See more »

Cyclic executive

A cyclic executive is an alternative to a real-time operating system.

New!!: Scheduling (computing) and Cyclic executive · See more »

Dynamic priority scheduling

Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system.

New!!: Scheduling (computing) and Dynamic priority scheduling · See more »

Embedded system

An embedded system is a computer system with a dedicated function within a larger mechanical or electrical system, often with real-time computing constraints.

New!!: Scheduling (computing) and Embedded system · See more »

Execution model

An execution model specifies how work takes place.

New!!: Scheduling (computing) and Execution model · See more »

Expansion card

In computing, the expansion card, expansion board, adapter card or accessory card is a printed circuit board that can be inserted into an electrical connector, or expansion slot, on a computer motherboard, backplane or riser card to add functionality to a computer system via the expansion bus.

New!!: Scheduling (computing) and Expansion card · See more »

Fair queuing

Fair queuing is a family of scheduling algorithms used in some process and network schedulers.

New!!: Scheduling (computing) and Fair queuing · See more »

Fair-share scheduling

Fair-share scheduling is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution among processes.

New!!: Scheduling (computing) and Fair-share scheduling · See more »

FIFO (computing and electronics)

FIFO is an acronym for first in, first out, a method for organizing and manipulating a data buffer, where the oldest (first) entry, or 'head' of the queue, is processed first.

New!!: Scheduling (computing) and FIFO (computing and electronics) · See more »

Flow shop scheduling

Flow shop scheduling problems, are a class of scheduling problems with a workshop or group shop in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of machines or with other resources 1,2,...,m in compliance with given processing orders.

New!!: Scheduling (computing) and Flow shop scheduling · See more »


Foreground-background is a scheduling algorithm that is used to control an execution of multiple processes on a single processor.

New!!: Scheduling (computing) and Foreground-background · See more »


FreeBSD is a free and open-source Unix-like operating system descended from Research Unix via the Berkeley Software Distribution (BSD).

New!!: Scheduling (computing) and FreeBSD · See more »

Guowang Miao

Guowang Miao is an associate professor at KTH Royal Institute of Technology, Sweden, working on design and optimization of wireless communications and networking and the author of Fundamentals of Mobile Data Networks and Energy and Spectrum Efficient Wireless Network Design.

New!!: Scheduling (computing) and Guowang Miao · See more »

Hard disk drive

A hard disk drive (HDD), hard disk, hard drive or fixed disk is an electromechanical data storage device that uses magnetic storage to store and retrieve digital information using one or more rigid rapidly rotating disks (platters) coated with magnetic material.

New!!: Scheduling (computing) and Hard disk drive · See more »

High Speed Packet Access

High Speed Packet Access (HSPA) is an amalgamation of two mobile protocols, High Speed Downlink Packet Access (HSDPA) and High Speed Uplink Packet Access (HSUPA), that extends and improves the performance of existing 3G mobile telecommunication networks using the WCDMA protocols.

New!!: Scheduling (computing) and High Speed Packet Access · See more »

I/O bound

In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period spent waiting for input/output operations to be completed.

New!!: Scheduling (computing) and I/O bound · See more »

I/O scheduling

Input/output (I/O) scheduling is the method that computer operating systems use to decide in which order the block I/O operations will be submitted to storage volumes.

New!!: Scheduling (computing) and I/O scheduling · See more »

Ingo Molnár

Ingo Molnár, employed by Red Hat as of May 2013, is a Hungarian Linux hacker.

New!!: Scheduling (computing) and Ingo Molnár · See more »


In system programming, an interrupt is a signal to the processor emitted by hardware or software indicating an event that needs immediate attention.

New!!: Scheduling (computing) and Interrupt · See more »

Interrupt handler

In computer systems programming, an interrupt handler, also known as an interrupt service routine or ISR, is a special block of code associated with a specific interrupt condition.

New!!: Scheduling (computing) and Interrupt handler · See more »

Interruptible operating system

An interruptible operating system is an operating system with ability to handle multiple interrupts concurrently, or in other words, which allow interrupts to be interrupted.

New!!: Scheduling (computing) and Interruptible operating system · See more »

Job scheduler

A job scheduler is a computer application for controlling unattended background program execution of jobs.

New!!: Scheduling (computing) and Job scheduler · See more »

Job shop scheduling

Job shop scheduling or the job-shop problem (JSP) is an optimization problem in computer science and operations research in which jobs are assigned to resources at particular times.

New!!: Scheduling (computing) and Job shop scheduling · See more »

Latency (engineering)

Latency is a time interval between the stimulation and response, or, from a more general point of view, a time delay between the cause and the effect of some physical change in the system being observed.

New!!: Scheduling (computing) and Latency (engineering) · See more »

Least slack time scheduling

Least slack time (LST) scheduling is a scheduling algorithm.

New!!: Scheduling (computing) and Least slack time scheduling · See more »


Linux is a family of free and open-source software operating systems built around the Linux kernel.

New!!: Scheduling (computing) and Linux · See more »

Linux distribution

A Linux distribution (often abbreviated as distro) is an operating system made from a software collection, which is based upon the Linux kernel and, often, a package management system.

New!!: Scheduling (computing) and Linux distribution · See more »

Linux kernel

The Linux kernel is an open-source monolithic Unix-like computer operating system kernel.

New!!: Scheduling (computing) and Linux kernel · See more »

Load balancing (computing)

In computing, load balancing improves the distribution of workloads across multiple computing resources, such as computers, a computer cluster, network links, central processing units, or disk drives.

New!!: Scheduling (computing) and Load balancing (computing) · See more »


In mathematics, the logarithm is the inverse function to exponentiation.

New!!: Scheduling (computing) and Logarithm · See more »

Lottery scheduling

Lottery scheduling is a probabilistic scheduling algorithm for processes in an operating system.

New!!: Scheduling (computing) and Lottery scheduling · See more »

LTE Advanced

LTE Advanced is a mobile communication standard and a major enhancement of the Long Term Evolution (LTE) standard.

New!!: Scheduling (computing) and LTE Advanced · See more »

Mac OS 9

Mac OS 9 is the ninth and final major release of Apple's classic Mac OS operating system.

New!!: Scheduling (computing) and Mac OS 9 · See more »


macOS (previously and later) is a series of graphical operating systems developed and marketed by Apple Inc. since 2001.

New!!: Scheduling (computing) and MacOS · See more »


In operations research, the makespan of a project is the total time that elapses from the beginning to the end.

New!!: Scheduling (computing) and Makespan · See more »

Max-min fairness

In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if the allocation is feasible and an attempt to increase the allocation of any participant necessarily results in the decrease in the allocation of some other participant with an equal or smaller allocation.

New!!: Scheduling (computing) and Max-min fairness · See more »

Maximum throughput scheduling

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.

New!!: Scheduling (computing) and Maximum throughput scheduling · See more »

Mobile device management

Mobile device management (MDM) is an industry term for the administration of mobile devices, such as smartphones, tablet computers, laptops and desktop computers.

New!!: Scheduling (computing) and Mobile device management · See more »


MS-DOS (acronym for Microsoft Disk Operating System) is an operating system for x86-based personal computers mostly developed by Microsoft.

New!!: Scheduling (computing) and MS-DOS · See more »

Multilevel feedback queue

In computer science, a multilevel feedback queue is a scheduling algorithm.

New!!: Scheduling (computing) and Multilevel feedback queue · See more »


NetBSD is a free and open source Unix-like operating system that descends from Berkeley Software Distribution (BSD), a Research Unix derivative developed at the University of California, Berkeley.

New!!: Scheduling (computing) and NetBSD · See more »

Nice (Unix)

nice is a program found on Unix and Unix-like operating systems such as Linux.

New!!: Scheduling (computing) and Nice (Unix) · See more »

O(1) scheduler

An O(1) scheduler is a kernel scheduling design that can schedule processes within a constant amount of time, regardless of how many processes are running on the operating system.

New!!: Scheduling (computing) and O(1) scheduler · See more »

O(n) scheduler

The O(n) scheduler is the scheduler used in the Linux kernel between versions 2.4 and 2.6.

New!!: Scheduling (computing) and O(n) scheduler · See more »

Open-shop scheduling

In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs must each be processed for given amounts of time at each of a given set of workstations, in an arbitrary order, and the goal is to determine the time at which each job is to be processed at each workstation.

New!!: Scheduling (computing) and Open-shop scheduling · See more »

Operating system

An operating system (OS) is system software that manages computer hardware and software resources and provides common services for computer programs.

New!!: Scheduling (computing) and Operating system · See more »

Orthogonal frequency-division multiple access

Orthogonal frequency-division multiple access (OFDMA) is a multi-user version of the popular orthogonal frequency-division multiplexing (OFDM) digital modulation scheme.

New!!: Scheduling (computing) and Orthogonal frequency-division multiple access · See more »

OS/360 and successors

OS/360, officially known as IBM System/360 Operating System, is a discontinued batch processing operating system developed by IBM for their then-new System/360 mainframe computer, announced in 1964; it was heavily influenced by the earlier IBSYS/IBJOB and Input/Output Control System (IOCS) packages.

New!!: Scheduling (computing) and OS/360 and successors · See more »

Packet switching

Packet switching is a method of grouping data which is transmitted over a digital network into packets which are made of a header and a payload.

New!!: Scheduling (computing) and Packet switching · See more »

Page fault

A page fault (sometimes called #PF, PF or hard fault) is a type of exception raised by computer hardware when a running program accesses a memory page that is not currently mapped by the memory management unit (MMU) into the virtual address space of a process.

New!!: Scheduling (computing) and Page fault · See more »


In computer operating systems, paging is a memory management scheme by which a computer stores and retrieves data from secondary storage for use in main memory.

New!!: Scheduling (computing) and Paging · See more »

Preemption (computing)

In computing, preemption is the act of temporarily interrupting a task being carried out by a computer system, without requiring its cooperation, and with the intention of resuming the task at a later time.

New!!: Scheduling (computing) and Preemption (computing) · See more »

Priority inversion

In computer science, priority inversion is a problematic scenario in scheduling in which a high priority task is indirectly preempted by a lower priority task effectively "inverting" the relative priorities of the two tasks.

New!!: Scheduling (computing) and Priority inversion · See more »

Process (computing)

In computing, a process is an instance of a computer program that is being executed.

New!!: Scheduling (computing) and Process (computing) · See more »

Process state

In a multitasking computer system, processes may occupy a variety of states.

New!!: Scheduling (computing) and Process state · See more »

Processor affinity

Processor affinity, or CPU pinning, enables the binding and unbinding of a process or a thread to a central processing unit (CPU) or a range of CPUs, so that the process or thread will execute only on the designated CPU or CPUs rather than any CPU.

New!!: Scheduling (computing) and Processor affinity · See more »

Programmable interval timer

In computing and in embedded systems, a programmable interval timer (PIT) is a counter that generates an output signal when it reaches a programmed count.

New!!: Scheduling (computing) and Programmable interval timer · See more »

Proportionally fair

Proportional fair is a compromise-based scheduling algorithm.

New!!: Scheduling (computing) and Proportionally fair · See more »

Protection ring

In computer science, hierarchical protection domains, often called protection rings, are mechanisms to protect data and functionality from faults (by improving fault tolerance) and malicious behaviour (by providing computer security).

New!!: Scheduling (computing) and Protection ring · See more »

Quality of service

Quality of service (QoS) is the description or measurement of the overall performance of a service, such as a telephony or computer network or a cloud computing service, particularly the performance seen by the users of the network.

New!!: Scheduling (computing) and Quality of service · See more »

Queueing theory

Queueing theory is the mathematical study of waiting lines, or queues.

New!!: Scheduling (computing) and Queueing theory · See more »

Rate-monotonic scheduling

In computer science, rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class.

New!!: Scheduling (computing) and Rate-monotonic scheduling · See more »

Real-time computing

In computer science, real-time computing (RTC), or reactive computing describes hardware and software systems subject to a "real-time constraint", for example from event to system response.

New!!: Scheduling (computing) and Real-time computing · See more »

Red–black tree

A red–black tree is a kind of self-balancing binary search tree in computer science.

New!!: Scheduling (computing) and Red–black tree · See more »

Render farm

A render farm is a high-performance computer system, e.g. a computer cluster, built to render computer-generated imagery (CGI), typically for film and television visual effects.

New!!: Scheduling (computing) and Render farm · See more »

Resource-Task Network

The Resource-Task Network (RTN) is a unified framework for the description and solution of a variety of process scheduling problems.

New!!: Scheduling (computing) and Resource-Task Network · See more »

Response time (technology)

In technology, response time is the time a system or functional unit takes to react to a given input.

New!!: Scheduling (computing) and Response time (technology) · See more »


Robotics is an interdisciplinary branch of engineering and science that includes mechanical engineering, electronics engineering, computer science, and others.

New!!: Scheduling (computing) and Robotics · See more »

Round-robin scheduling

Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing.

New!!: Scheduling (computing) and Round-robin scheduling · See more »

Router (computing)

A router is a networking device that forwards data packets between computer networks.

New!!: Scheduling (computing) and Router (computing) · See more »

Run queue

In modern computers many processes run at once.

New!!: Scheduling (computing) and Run queue · See more »

Scheduling (computing)

In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work.

New!!: Scheduling (computing) and Scheduling (computing) · See more »

Scheduling (production processes)

Scheduling is the process of arranging, controlling and optimizing work and workloads in a production process or manufacturing process.

New!!: Scheduling (computing) and Scheduling (production processes) · See more »

Shortest job next

Shortest job next (SJN), also known as shortest job first (SJF) or shortest process next (SPN), is a scheduling policy that selects for execution the waiting process with the smallest execution time.

New!!: Scheduling (computing) and Shortest job next · See more »

Signal programming

Signal programming is used in the same sense as dataflow programming, and is similar to event-driven programming.

New!!: Scheduling (computing) and Signal programming · See more »

Single-carrier FDMA

Single-carrier FDMA (SC-FDMA) is a frequency-division multiple access scheme.

New!!: Scheduling (computing) and Single-carrier FDMA · See more »

Solaris (operating system)

Solaris is a Unix operating system originally developed by Sun Microsystems.

New!!: Scheduling (computing) and Solaris (operating system) · See more »

Spectral efficiency

Spectral efficiency, spectrum efficiency or bandwidth efficiency refers to the information rate that can be transmitted over a given bandwidth in a specific communication system.

New!!: Scheduling (computing) and Spectral efficiency · See more »


In computing, spooling is a specialized form of multi-programming for the purpose of copying data between different devices.

New!!: Scheduling (computing) and Spooling · See more »

Starvation (computer science)

In computer science, starvation is a problem encountered in concurrent computing where a process is perpetually denied necessary resources to process its work.

New!!: Scheduling (computing) and Starvation (computer science) · See more »

State (computer science)

In information technology and computer science, a program is described as stateful if it is designed to remember preceding events or user interactions; the remembered information is called the state of the system.

New!!: Scheduling (computing) and State (computer science) · See more »

Statistical time-division multiplexing

Statistical multiplexing is a type of communication link sharing, very similar to dynamic bandwidth allocation (DBA).

New!!: Scheduling (computing) and Statistical time-division multiplexing · See more »

Stochastic scheduling

Stochastic scheduling concerns scheduling problems involving random attributes, such as random processing times, random due dates, random weights, and stochastic machine breakdowns.

New!!: Scheduling (computing) and Stochastic scheduling · See more »

Stride scheduling

The stride scheduling is a type of scheduling mechanism that has been introduced as a simple concept to achieve proportional CPU capacity reservation among concurrent processes.

New!!: Scheduling (computing) and Stride scheduling · See more »


A supercomputer is a computer with a high level of performance compared to a general-purpose computer.

New!!: Scheduling (computing) and Supercomputer · See more »

SUSE Linux Enterprise

SUSE Linux Enterprise Server (SLES) is a Linux-based operating system developed by SUSE.

New!!: Scheduling (computing) and SUSE Linux Enterprise · See more »

Symmetric multiprocessing

Symmetric multiprocessing (SMP) involves a multiprocessor computer hardware and software architecture where two or more identical processors are connected to a single, shared main memory, have full access to all input and output devices, and are controlled by a single operating system instance that treats all processors equally, reserving none for special purposes.

New!!: Scheduling (computing) and Symmetric multiprocessing · See more »

System call

In computing, a system call is the programmatic way in which a computer program requests a service from the kernel of the operating system it is executed on.

New!!: Scheduling (computing) and System call · See more »

Telecommunications link

In telecommunications a link is a communication channel that connects two or more devices.

New!!: Scheduling (computing) and Telecommunications link · See more »

Thrashing (computer science)

In computer science, thrashing occurs when a computer's virtual memory resources become saturated, leading to a constant state of paging (rapidly exchanging data in memory for data on disk), to the exclusion of most application-level processing.

New!!: Scheduling (computing) and Thrashing (computer science) · See more »

Thread (computing)

In computer science, a thread of execution is the smallest sequence of programmed instructions that can be managed independently by a scheduler, which is typically a part of the operating system.

New!!: Scheduling (computing) and Thread (computing) · See more »


In general terms, throughput is the maximum rate of production or the maximum rate at which something can be processed.

New!!: Scheduling (computing) and Throughput · See more »

Time limit

A time limit or deadline is a narrow field of time, or a particular point in time, by which an objective or task must be accomplished.

New!!: Scheduling (computing) and Time limit · See more »

Time Stamp Counter

The Time Stamp Counter (TSC) is a 64-bit register present on all x86 processors since the Pentium.

New!!: Scheduling (computing) and Time Stamp Counter · See more »

Time-utility function

Time-utility functions (TUFs, also called time-value functions) are needed for real-time computing when a deadline occurs.

New!!: Scheduling (computing) and Time-utility function · See more »

Traffic flow (computer networking)

In packet switching networks, traffic flow, packet flow or network flow is a sequence of packets from a source computer to a destination, which may be another host, a multicast group, or a broadcast domain.

New!!: Scheduling (computing) and Traffic flow (computer networking) · See more »

User space

A modern computer operating system usually segregates virtual memory into kernel space and user space.

New!!: Scheduling (computing) and User space · See more »

Weighted fair queueing

Weighted fair queueing (WFQ) is a network scheduler scheduling algorithm.

New!!: Scheduling (computing) and Weighted fair queueing · See more »

Windows 3.1x

Windows 3.1x (codenamed Janus) is a series of 16-bit operating environments produced by Microsoft for use on personal computers.

New!!: Scheduling (computing) and Windows 3.1x · See more »

Windows 95

Windows 95 (codenamed Chicago) is a consumer-oriented operating system developed by Microsoft.

New!!: Scheduling (computing) and Windows 95 · See more »

Windows 98

Windows 98 (codenamed Memphis while in development) is a graphical operating system by Microsoft.

New!!: Scheduling (computing) and Windows 98 · See more »

Windows ME

Windows Millennium Edition, or Windows ME (marketed with the pronunciation of the pronoun "me", commonly pronounced as an initialism, "M-E (Codenamed Millennium)", is a graphical operating system from Microsoft released to manufacturing in June 2000, and launched in September 2000.

New!!: Scheduling (computing) and Windows ME · See more »

Windows NT

Windows NT is a family of operating systems produced by Microsoft, the first version of which was released in July 1993.

New!!: Scheduling (computing) and Windows NT · See more »

Windows Vista

Windows Vista (codenamed Longhorn) is an operating system by Microsoft for use on personal computers, including home and business desktops, laptops, tablet PCs and media center PCs.

New!!: Scheduling (computing) and Windows Vista · See more »

Work-conserving scheduler

In computing and communication systems, a work-conserving scheduler is a scheduler that always tries to keep the scheduled resource(s) busy, if there are submitted jobs ready to be scheduled.

New!!: Scheduling (computing) and Work-conserving scheduler · See more »

Workload Manager

In IBM mainframes, Workload Manager (WLM) is a base component of MVS/ESA mainframe operating system, and its successors up to and including z/OS.

New!!: Scheduling (computing) and Workload Manager · See more »

Redirects here:

Admission scheduler, Admission scheduling, CPU Scheduling, CPU scheduler, CPU scheduling, Channel-dependent scheduling, Deterministic Scheduling, Dispatch latency, Fair share scheduling class, Fixed priority scheduling class, High-level scheduler, High-level scheduling, Linux Process Scheduler, Long-term scheduler, Long-term scheduling, Medium-term scheduler, Medium-term scheduling, Mid-term scheduler, Mid-term scheduling, Non-Deterministic Scheduling, Non-deterministic Scheduling, Nondeterministic Scheduling, Packet scheduling, Process Scheduler, Process scheduler, Process scheduling, Processor scheduling, Processor time, Running queue, Scheduler (computing), Scheduler pattern, Scheduling algorithm, Scheduling algorithms, Scheduling discipline, Scheduling disciplines, Scheduling policy, Scheduling priority, Scheduling theory, Short-term scheduler, Short-term scheduling, Task queue, Task scheduler, Task scheduling, Time-sharing scheduling class.


[1] https://en.wikipedia.org/wiki/Scheduling_(computing)

Hey! We are on Facebook now! »