TY - CHAP
T1 - An O(logp) algorithm for the discrete feedback guided dynamic loop scheduling
AU - Tabirca, Tatiana
AU - Tabirca, Sabin
AU - Yang, Laurence Tianruo
PY - 2006
Y1 - 2006
N2 - 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 feedback-guided 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 + log p) 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(log p) algorithm for the discrete case and presents some properties of it.
AB - 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 feedback-guided 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 + log p) 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(log p) algorithm for the discrete case and presents some properties of it.
UR - https://www.scopus.com/pages/publications/33751097023
U2 - 10.1109/AINA.2006.95
DO - 10.1109/AINA.2006.95
M3 - Chapter
AN - SCOPUS:33751097023
SN - 0769524664
SN - 9780769524665
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 321
EP - 326
BT - Proceedings - 20th International Conference on Advanced Information Networking and Applications
T2 - 20th International Conference on Advanced Information Networking and Applications
Y2 - 18 April 2006 through 20 April 2006
ER -