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.
2015
2015
Detecting Fault Injection Attacks on Embedded Real-Time Applications: A System-Level Perspective
This paper presents an approach to the synthesis of secure real-time applications mapped on distributed embedded systems, which… 
2013
2013
List scheduling heuristics for virtual machine mapping in cloud systems
This article introduces the formulation of the Virtual Machine Planning Problem in cloud computing systems. It deals with the… 
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… 
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… 
1998
1998
A performance evaluation of CP list scheduling heuristics for communication intensive task graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have… 
1995
1995
Architecture-Dependent Loop Scheduling via Communication-Sensitive Remapping
In this paper, we propose a novel efficient technique called cyclo-compaction scheduling, taking into account the data… 
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… 
1994
1994
RECALS II: a new list scheduling algorithm
Presents a new scheduling heuristic RECALS II for high-level synthesis applications. RECALS II accepts a directed acyclic graph… 
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)