Skip to search formSkip to main contentSkip to account menu

List scheduling

The basic idea of list scheduling is to make an ordered list of processes by assigning them some priorities, and then repeatedly execute the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Critical path methodHeterogeneous Earliest Finish TimeInstruction schedulingList of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments
Job scheduling plays a critical role in resource utilisation in a grid computing environment. The heterogeneity of grid resources… 
2008
2008
Task Scheduling and Lightpath Establishment in Optical Grids
Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where… 
2005
2005
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
2004
2004
Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy
In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with… 
2000
2000
Optimizing Overall Loop Schedules Using Prefetching and Partitioning
In this paper, a method combining the loop pipelining technique with data prefetching, called Partition Scheduling with… 
Highly Cited
1999
Highly Cited
1999
Instruction Scheduling for TriMedia
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes… 
1994
1994
Dynamic list-scheduling with finite resources
When the instruction level parallelism exceeds the available machine parallelism, a decision must be made as to which… 
1993
1993
Zone scheduling
  • C. HwangY. Hsu
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1993
  • Corpus ID: 9748380
A technique for the resource constrained scheduling problem in high level synthesis is presented. The approach works by… 
1988
1988
Optimization of horizontal microcode generation for loop structures
MIMOSA is an experimental software for the automatic generation and optimization of microcode for horizontal microprogrammed… 
1986
1986
Probabilistic Bounds on the Performance of List Scheduling
The problem of scheduling tasks on m processors to minimize the schedule length (makespan) is NP-complete. Here we study the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)