Skip to search formSkip to main contentSkip to account menu

Loop scheduling

Known as: Iteration scheduling 
In parallel computing, loop scheduling is the problem of assigning proper iterations of parallelizable loops among n processors to achieve load… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Automatic parallelizationComet (programming language)Load balancing (computing)Locality of reference

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Redesigning OP2 Compiler to Use HPX Runtime Asynchronous Techniques
Maximizing parallelism level in applications can be achieved by minimizing overheads due to load imbalances and waiting time due… 
2014
2014
Heuristics for Robust Allocation of Resources to Parallel Applications with Uncertain Execution Times in Heterogeneous Systems with Uncertain Availability
The scheduling of moldable parallel applications to clusters of processors is challenging, where the number of processors on… 
2007
2007
Multi-dimensional dynamic loop scheduling algorithms
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in… 
2006
2006
Scheduling in 802.11e: Open-Loop or Closed-Loop?
Scheduling in 802.11e networks is managed by the Hybrid Coordination Function (HCF), located within the access point. HCF has… 
2005
2005
An Enhanced Parallel Loop Self-Scheduling Scheme for Cluster Environments
Approaches for dealing with scheduling and load-balancing in PC-based cluster systems are famous and well known. In such… 
2001
2001
A parallel loop scheduling algorithm based on the Smarandache f -inferior part function
This article presents an application of the inferior Smarandache f-part function to a particular parallel loop-scheduling problem… 
2000
2000
An Intelligent Parallel Loop Scheduling for Parallelizing Compilers
Received March 31, 1999; revised June 16 & July 27, 1999; accepted September 20, 1999. Communicated by Shang-Rong Tsai. *This… 
1994
1994
Using Processor Affinity in Loop Scheduling
Loops are the single largest source of parallelism in many applications. One way to exploit this parallelism is to execute loop… 
1993
1993
DLS: A scheduling algorithm for high-level synthesis in VHDL
Dynamic loop scheduling, an algorithm that can efficiently schedule large, control-flow dominated designs, written in VHDL is… 
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… 
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)