{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:17:27Z","timestamp":1648772247987},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129626405002404","type":"journal-article","created":{"date-parts":[[2006,1,3]],"date-time":"2006-01-03T11:55:56Z","timestamp":1136289356000},"page":"491-497","source":"Crossref","is-referenced-by-count":0,"title":["Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem"],"prefix":"10.1142","volume":"15","author":[{"given":"Tatiana","family":"Tabirca","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Len","family":"Freeman","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabin","family":"Tabirca","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University College Cork, College Road, Cork, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence Tianruo","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, St. Francis Xavier University, P.O. Box 5000, Antigonish, B2G 2W5, Nova Scotia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/135226.135232"},{"key":"rf7","volume-title":"An Introduction to Parallel Algorithms","author":"Jaja J.","year":"1992"},{"key":"rf8","first-page":"1001","volume":"11","author":"Kruskal C. P.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"rf9","first-page":"1425","volume":"36","author":"Polychronopolos C. D.","journal-title":"IEEE Trans. on Computers"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.205655"},{"key":"rf13","first-page":"70","volume":"8","author":"Yan Y.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626405002404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:29:27Z","timestamp":1565184567000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626405002404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0129626405002404"],"URL":"https:\/\/doi.org\/10.1142\/s0129626405002404","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}