- Algorithms
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Algorithms
- >
- Search algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Combinatorics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Fields of mathematics
- >
- Applied mathematics
- >
- Operations research
- >
- Scheduling (computing)

- Graph theory
- >
- Network theory
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Mathematical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Numerical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Scheduling (computing)

- Operations research
- >
- Network theory
- >
- Combinatorial optimization
- >
- Scheduling (computing)

Server hog

A server hog is a user, program or system that places excessive load on a server such that the server performance as experienced by other clients is degraded, or such that the server itself is so heav

Run queue

In modern computers many processes run at once. Active processes are placed in an array called a run queue, or runqueue. The run queue may contain priority values for each process, which will be used

Scheduling analysis real-time systems

The term scheduling analysis in real-time computing includes the analysis and testing of the scheduler system and the algorithms used in real-time applications. In computer science, real-time scheduli

Tardiness (scheduling)

In scheduling, tardiness is a measure of a delay in executing certain operations and earliness is a measure of finishing operations before due time. The operations may depend on each other and on the

Kernel preemption

In computer operating system design, kernel preemption is a property possessed by some kernels (the cores of operating systems), in which the CPU can be interrupted in the middle of executing kernel c

Idle (CPU)

A computer processor is described as idle when it is not being used by any program. Every program or task that runs on a computer system occupies a certain amount of processing time on the CPU. If the

Makespan

In operations research, the makespan of a project is the length of time that elapses from the start of work to the end. This type of multi-mode resource constrained project scheduling problem (MRCPSP)

Resource allocation (computer)

Resource allocation is the process by which a computing system aims to meet the hardware requirements of an application run by it. Computing, networking and energy resources must be optimised taking i

Light-weight process

In computer operating systems, a light-weight process (LWP) is a means of achieving multitasking. In the traditional meaning of the term, as used in Unix System V and Solaris, a LWP runs in user space

Blocking (computing)

In computing, a process is an instance of a computer program that is being executed. A process always exists in exactly one process state. A process that is blocked is one that is waiting for some eve

Stochastic scheduling

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

Schedule

A schedule or a timetable, as a basic time-management tool, consists of a list of times at which possible tasks, events, or actions are intended to take place, or of a sequence of events in the chrono

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. Th

© 2023 Useful Links.