loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)
An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop
Vienna, Austria
April 18-April 20
ISBN: 0-7695-2466-4
ASCII Text
x 
 
Tatiana Tabirca, Sabin Tabirca, Laurence Tianruo Yang, "An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop," Advanced Information Networking and Applications, International Conference on, vol. 1, pp. 321-326, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/AINA.2006.95,
author = {Tatiana Tabirca and Sabin Tabirca and Laurence Tianruo Yang},
title = {An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop},
journal ={Advanced Information Networking and Applications, International Conference on},
volume = {1},
year = {2006},
issn = {1550-445X},
pages = {321-326},
doi = {http://doi.ieeecomputersociety.org/10.1109/AINA.2006.95},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications, International Conference on
TI - An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop
SN - 1550-445X
SP321
EP326
A1 - Tatiana Tabirca,
A1 - Sabin Tabirca,
A1 - Laurence Tianruo Yang,
PY - 2006
KW - null
VL - 1
JA - Advanced Information Networking and Applications, International Conference on
ER -
 
Tatiana Tabirca, University College Cork, Ireland
Sabin Tabirca, University College Cork, Ireland
Laurence Tianruo Yang, St. Francis Xavier University, Canada
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.
Citation:
Tatiana Tabirca, Sabin Tabirca, Laurence Tianruo Yang, "An O(logp) Algorithm for the Discrete Feedback Guided Dynamic Loop," aina, vol. 1, pp.321-326, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.