Scheduling (computing)
In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Code106355894
- CodingSystem106353757
- Cognition100023271
- Communication100033020
- Driver106574473
- Event100029378
- Form105930736
- OperatingSystem106568134
- Procedure101023820
- Program106568978
- PsychologicalFeature100023100
- Rule105846932
- software
- Software106566077
- Structure105726345
- Thing
- UtilityProgram106581410
- WikicatAlgorithms
- WikicatDeviceDrivers
- WikicatOperatingSystems
- WikicatSchedulingAlgorithms
- WikicatSoftwareDesignPatterns
- Writing106359877
- WrittenCommunication106349220
- YagoPermanentlyLocatedEntity
- Comment
- enIn computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.
- Depiction
- Has abstract
- enIn computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows. The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service. Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes it possible to have computer multitasking with a single central processing unit (CPU).
- Hypernym
- Method
- Is primary topic of
- Scheduling (computing)
- Label
- enScheduling (computing)
- Link from a Wikipage to an external page
- static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/43438.pdf
- ieeexplore.ieee.org/xpl/articleDetails.jsp%3Farnumber=6226795
- web.archive.org/web/20060613130106/http:/oreilly.com/catalog/linuxkernel/chapter/ch10.html
- pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched.pdf
- pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched-lottery.pdf
- pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched-mlfq.pdf
- pages.cs.wisc.edu/~remzi/OSTEP/cpu-sched-multi.pdf
- pages.cs.wisc.edu/~remzi/OSTEP/
- www.mathematik.uni-osnabrueck.de/research/OR/class/
- github.com/bdaehlie/linux-cpu-scheduler-docs/
- web.archive.org/web/20110811094049/http:/www.ibm.com/developerworks/aix/library/au-aix5_cpu/index.html%23N100F6
- archive.org/details/operatingsystems00stal
- kerneltrap.org/scheduler
- www.cs.sunysb.edu/~algorith/files/scheduling.shtml
- rtime.felk.cvut.cz/scheduling-toolbox
- Link from a Wikipage to another Wikipage
- 3.5G
- 360 and successors
- Activity selection problem
- Aging (scheduling)
- Alan Cox (computer programmer)
- Amiga OS
- Atropos scheduler
- Automated planning and scheduling
- Automatic control
- Batch processing
- Blocking function
- Brain Fuck Scheduler
- Cache thrashing
- Carbon (API)
- Category:Operations research
- Category:Planning
- Category:Scheduling (computing)
- Category:Software design patterns
- Central processing unit
- Channel state information
- Classic Mac OS
- Completely Fair Scheduler
- Computer cluster
- Computer multitasking
- Computer networks
- Computer performance
- Computing
- Concurrent computing
- Con Kolivas
- Context (computing)
- Context switch
- Cooperative scheduler
- Coscheduling
- CPU-bound
- CPU time
- Cyclic executive
- Demand paging
- Device Management
- Dynamic channel allocation
- Dynamic priority scheduling
- Embedded system
- Execution model
- Expansion card
- Fair queuing
- Fair-share scheduling
- FIFO (computing and electronics)
- File:Simplified Structure of the Linux Kernel.svg
- File:Thread pool.svg
- Flow (computer networking)
- Flow shop scheduling
- Foreground-background
- FreeBSD
- Frequency-domain equalization
- Hard disk drive
- HSDPA
- Ingo Molnar
- Interrupt
- Interrupt handler
- Interruptible operating system
- Job scheduler
- Job shop scheduling
- Kernel mode
- Kernel space
- Latency (engineering)
- Least slack time scheduling
- Linux
- Linux distributions
- Linux kernel
- Load balancing (computing)
- Lottery scheduling
- LTE Advanced
- MacOS
- Mac OS 9
- Makespan
- Maximum throughput scheduling
- Max-min fair
- MS-DOS
- Multilevel feedback queue
- NetBSD
- Nice (Unix)
- Nonpreemptive multitasking
- O(1) scheduler
- O(n) scheduler
- O-bound
- OFDMA
- Open-shop scheduling
- Operating system
- O scheduling
- Packet network
- Packet-switched
- Page fault
- Paging
- Preemption (computing)
- Print spooler
- Priority inversion
- Process (computing)
- Processor affinity
- Process scheduler
- Process states
- Programmable interval timer
- Proportional-fair scheduling
- Quality of service
- Queuing Theory
- Rate-monotonic scheduling
- Ready queue
- Real-time computing
- Red–black tree
- Render farm
- Resource starvation
- Resource-Task Network
- Response time (technology)
- Robotics
- Round-robin scheduling
- Router (computing)
- Run queue
- Scheduling (production processes)
- Shared memory
- Shortest job first
- Signal programming
- Solaris (operating system)
- State (computer science)
- Statistical multiplexing
- Stochastic scheduling
- Stride scheduling
- Supercomputer
- SUSE Linux Enterprise Server
- Symmetric multiprocessing
- System call
- System spectral efficiency
- Telecommunications link
- Thread (computer science)
- Thread (computing)
- Thread Manager
- Throughput
- Time limit
- Time Stamp Counter
- Time-utility function
- Turnaround time
- Weighted fair queuing
- Windows 3.1x
- Windows 95
- Windows 98
- Windows Me
- Windows NT
- Windows Vista
- Work-conserving scheduler
- Workload Manager
- SameAs
- Bafc
- Dyspozytor
- Escalonamento de processos
- m.015yyh
- m.01hqsf
- Ordonnancement dans les systèmes d'exploitation
- Planificador
- Planificador de tasques
- Plánování procesů
- Prozess-Scheduler
- Q1123036
- Razvrščevalni algoritem
- Ressursijaotus
- Scheduler
- Scheduler
- Schedulering
- Scheduling
- Scheduling (computing)
- Skedulering
- Vuoronnus
- Χρονοπρογραμματισμός ΚΜΕ
- Диспетчер операционной системы
- Планувальник операційної системи
- Распоређивање (рачунарство)
- جدولة (حاسوب)
- زمانبندی (رایانش)
- การจัดกำหนดการ (คอมพิวเตอร์)
- スケジューリング
- 调度 (计算机)
- 스케줄링 (컴퓨팅)
- SeeAlso
- Deadline-monotonic scheduling
- Network scheduler
- Subject
- Category:Operations research
- Category:Planning
- Category:Scheduling (computing)
- Category:Software design patterns
- Thumbnail
- WasDerivedFrom
- Scheduling (computing)?oldid=1116730026&ns=0
- WikiPageLength
- 42303
- Wikipage page ID
- 231920
- Wikipage revision ID
- 1116730026
- WikiPageUsesTemplate
- Template:About
- Template:Anchor
- Template:Citation needed
- Template:Cite book
- Template:Design Patterns patterns
- Template:Div col
- Template:Div col end
- Template:Main
- Template:Maybe
- Template:Mvar
- Template:No
- Template:Operating system
- Template:Processor scheduling
- Template:Refbegin
- Template:Refend
- Template:Reflist
- Template:Rp
- Template:See also
- Template:Short description
- Template:Snd
- Template:Visible anchor
- Template:Yes
