Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Windows NT processor scheduling

Known as: Processor scheduling 
Windows NT processor scheduling refers to the process by which Windows NT determines which job (task) should be run on the computer processor at… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
The Maui scheduler has received wide acceptance in the HPC community as a highly configurable and effective batch scheduler. It… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • G. Lipari, S. Baruah
  • Proceedings Sixth IEEE Real-Time Technology and…
  • 2000
  • Corpus ID: 16469335
The Bandwidth Sharing Server (BSS) is a scheduling strategy for multi-task real time applications that provides the dual… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Most parallel jobs cannot be fully parallelized. In a homogeneous parallel machine-one in which all processors are identical-the… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The increasing use of communication networks in time-critical applications presents engineers with fundamental problems with the… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In future computer system design, I/O systems will have to support continuous media such as video and audio, whose system demands… Expand
  • table 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In a shared memory multiprocessor with caches, executing tasks develop "affinity" to processors by filling their caches with data… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Processor scheduling on multiprocessor systems that simultaneously run concurrent applications is currently not well-understood… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
This paper presents a linear-time algorithm for the special case of the disjoint set union problem in which the structure of the… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • K. Efe
  • Computer
  • 1982
  • Corpus ID: 18827960
When confronted with the need to utilize a remote computer facility or a data base that does not exist in a local computer system… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1966
Highly Cited
1966
This paper considers the problem of scheduling m independent, immediately available tasks on n parallel processors. Each task has… Expand
Is this relevant?