Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,018,864 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Automatic parallelization
Comet (programming language)
Load balancing (computing)
Locality of reference
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Closed-Loop Scheduling for Cost Minimization in HVAC Central Plants
M. J. Risbeck
,
C. Maravelias
,
J. Rawlings
,
R. Turney
2016
Corpus ID: 15429935
In this paper, we examine closed-loop operation of an HVAC central plant to demonstrate that closed-loop movinghorizon scheduling…
Expand
2014
2014
Heuristics for Robust Allocation of Resources to Parallel Applications with Uncertain Execution Times in Heterogeneous Systems with Uncertain Availability
Timothy M. Hansen
,
F. Ciorba
,
A. Maciejewski
,
H. Siegel
,
Srishti Srivastava
,
I. Banicescu
2014
Corpus ID: 14664196
The scheduling of moldable parallel applications to clusters of processors is challenging, where the number of processors on…
Expand
2007
2007
Probabilistic Retiming: A Circuit Optimization Technique
S. Tongsima
,
C. Chantrapornchai
,
N. Passos
2007
Corpus ID: 16413814
VLSI circuit manufacturing may result in devices with di erent propagation delays. Hence, the estimation of such delays during…
Expand
2005
2005
Fast and Noniterative Scheduling for Input-Queued Switches with Unbuffered Crossbars
K. Chen
,
E. Sha
,
S.-Q. Zheng
2005
Corpus ID: 18489464
Most high-end switches use an input-queued or a combined inputand output-queued architecture. The switch fabrics of these…
Expand
2001
2001
A parallel loop scheduling algorithm based on the Smarandache f -inferior part function
S. Tabirca
,
T. Tabirca
2001
Corpus ID: 14808699
This article presents an application of the inferior Smarandache f-part function to a particular parallel loop-scheduling problem…
Expand
2000
2000
An Intelligent Parallel Loop Scheduling for Parallelizing Compilers
Y. Fann
,
Chao-Tung Yang
,
S. Tseng
,
Chang-Jiun Tsai
Journal of information science and engineering
2000
Corpus ID: 7280410
Received March 31, 1999; revised June 16 & July 27, 1999; accepted September 20, 1999. Communicated by Shang-Rong Tsai. *This…
Expand
1996
1996
Characterizing Shared Memory and Communication Performance : A Case Study of the Convex SPP – 1000
Gheith A. Abandah
,
E. Davidson
1996
Corpus ID: 14567186
The objective of this paper is to develop models that characterize the memory and communication performance of shared-memory…
Expand
1995
1995
Automatic generation of loop scheduling for VLIW
C. Barrado
,
Jesús Labarta
,
E. Ayguadé
,
M. Valero
International Conference on Parallel…
1995
Corpus ID: 8904829
Fine-grain parallelism ooered by VLIW and superscalar processors can be eeectively exploited in computational intensive loops. In…
Expand
1994
1994
A Loop-Based Scheduling Algorithm for Hardware Description Languages
M. Rahmouni
,
K. O'Brien
,
A. Jerraya
Parallel Processing Letters
1994
Corpus ID: 32820094
This paper presents Dynamic Loop Scheduling (DLS), a loop-based algorithm that can efficiently schedule large, control-flow…
Expand
1994
1994
Using Processor Affinity in Loop Scheduling
E. Markatos
,
T. LeBlanc
1994
Corpus ID: 61568953
Loops are the single largest source of parallelism in many applications. One way to exploit this parallelism is to execute loop…
Expand