Paper Info
Title
An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop
Abstract
In this paper we investigate a new algorithm for the Feedback-Guided Dynamic Loop Scheduling (FGDLS) method in the discrete case. The method uses a feedbackguided mechanism to schedule a parallel loop within a sequential outer loop. The execution times and the scheduling bounds for the current outer iteration are used to find the scheduling bounds of the next outer iteration. An O(p+logp)algorithm has been proposed for the discrete case where it was proved to achieve optimal bounds in only a few iterations. This articles introduces an O(logp) algorithm for the discrete case and presents some properties of it.
Year
DOI
Venue
2006
10.1109/AINA.2006.95
AINA (1)
Keywords
DocType
ISBN
feedback-guided dynamic loop scheduling,discrete case,execution time,parallel loop,current outer iteration,sequential outer loop,new algorithm,scheduling bound,discrete feedback guided dynamic,feedbackguided mechanism,next outer iteration
Conference
0-7695-2466-4-01
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Tatiana Tabirca1338.09
Sabin Tabirca25319.37
Laurence Tianruo Yang3304.05