Applying the feedback guided dynamic loop scheduling method for the shortest path problem

Tatiana Tabirca; Len Freeman; Sabin Tabirca; Laurence Tianruo Yang

doi:10.1142/S0129626405002404

Applying the feedback guided dynamic loop scheduling method for the shortest path problem

Tatiana Tabirca
, Len Freeman
, Sabin Tabirca
, Laurence Tianruo Yang

School of Computer Science and Information Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Feedback Guided Dynamic Loop Scheduling is a recent dynamic method for loop scheduling. The method has been mainly studied for synthetic examples so far and it has always offered the lowest computational times against other dynamic scheduling methods. In this article we show how the method is applied to the shortest path problem and also present some execution times that prove the efficiency.

Original language	English
Pages (from-to)	491-497
Number of pages	7
Journal	Parallel Processing Letters
Volume	15
Issue number	4
DOIs	https://doi.org/10.1142/S0129626405002404
Publication status	Published - Dec 2005

Keywords

Execution times
Feedback guided dynamic loop scheduling
Loop scheduling
Shortest path problem

Access to Document

10.1142/S0129626405002404

Cite this

@article{3ee56663059745eb8ce6dbf49a580465,

title = "Applying the feedback guided dynamic loop scheduling method for the shortest path problem",

abstract = "Feedback Guided Dynamic Loop Scheduling is a recent dynamic method for loop scheduling. The method has been mainly studied for synthetic examples so far and it has always offered the lowest computational times against other dynamic scheduling methods. In this article we show how the method is applied to the shortest path problem and also present some execution times that prove the efficiency.",

keywords = "Execution times, Feedback guided dynamic loop scheduling, Loop scheduling, Shortest path problem",

author = "Tatiana Tabirca and Len Freeman and Sabin Tabirca and Yang, \{Laurence Tianruo\}",

year = "2005",

month = dec,

doi = "10.1142/S0129626405002404",

language = "English",

volume = "15",

pages = "491--497",

journal = "Parallel Processing Letters",

issn = "0129-6264",

publisher = "World Scientific",

number = "4",

}

TY - JOUR

T1 - Applying the feedback guided dynamic loop scheduling method for the shortest path problem

AU - Tabirca, Tatiana

AU - Freeman, Len

AU - Tabirca, Sabin

AU - Yang, Laurence Tianruo

PY - 2005/12

Y1 - 2005/12

N2 - Feedback Guided Dynamic Loop Scheduling is a recent dynamic method for loop scheduling. The method has been mainly studied for synthetic examples so far and it has always offered the lowest computational times against other dynamic scheduling methods. In this article we show how the method is applied to the shortest path problem and also present some execution times that prove the efficiency.

AB - Feedback Guided Dynamic Loop Scheduling is a recent dynamic method for loop scheduling. The method has been mainly studied for synthetic examples so far and it has always offered the lowest computational times against other dynamic scheduling methods. In this article we show how the method is applied to the shortest path problem and also present some execution times that prove the efficiency.

KW - Execution times

KW - Feedback guided dynamic loop scheduling

KW - Loop scheduling

KW - Shortest path problem

UR - https://www.scopus.com/pages/publications/30344471111

U2 - 10.1142/S0129626405002404

DO - 10.1142/S0129626405002404

M3 - Article

AN - SCOPUS:30344471111

SN - 0129-6264

VL - 15

SP - 491

EP - 497

JO - Parallel Processing Letters

JF - Parallel Processing Letters

IS - 4

ER -

Applying the feedback guided dynamic loop scheduling method for the shortest path problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this