{"id":"https://openalex.org/W2072081880","doi":"https://doi.org/10.1142/s0129626405002404","title":"Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem","display_name":"Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2072081880","doi":"https://doi.org/10.1142/s0129626405002404","mag":"2072081880"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626405002404","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626405002404","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015120994","display_name":"Tatiana Tabirca","orcid":"https://orcid.org/0009-0001-8124-4108"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tatiana Tabirca","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112413998","display_name":"Len Freeman","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Len Freeman","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9NG, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039689103","display_name":"Sabin Tabirca","orcid":"https://orcid.org/0000-0003-0743-8227"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Sabin Tabirca","raw_affiliation_strings":["Department of Computer Science, University College Cork, College Road, Cork, Ireland","[Department of Computer Science, University College Cork, College Road, Cork, Ireland]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College Cork, College Road, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]},{"raw_affiliation_string":"[Department of Computer Science, University College Cork, College Road, Cork, Ireland]","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049154222","display_name":"Laurence T. Yang","orcid":"https://orcid.org/0000-0002-7986-4244"},"institutions":[{"id":"https://openalex.org/I197191942","display_name":"St. Francis Xavier University","ror":"https://ror.org/01wcaxs37","country_code":"CA","type":"education","lineage":["https://openalex.org/I197191942"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Laurence Tianruo Yang","raw_affiliation_strings":["Department of Computer Science, St. Francis Xavier University, P.O. Box 5000, Antigonish, B2G 2W5, Nova Scotia, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, St. Francis Xavier University, P.O. Box 5000, Antigonish, B2G 2W5, Nova Scotia, Canada","institution_ids":["https://openalex.org/I197191942"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1568258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"04","first_page":"491","last_page":"497"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9799000024795532,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7107469439506531},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7101472020149231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6796522736549377},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5546273589134216},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5249255299568176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45532914996147156},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43760523200035095},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4193785786628723},{"id":"https://openalex.org/keywords/feedback-loop","display_name":"Feedback loop","score":0.4126286208629608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3603648543357849},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34232091903686523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2075188159942627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18702420592308044},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09153440594673157},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06617584824562073}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7107469439506531},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7101472020149231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6796522736549377},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5546273589134216},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5249255299568176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45532914996147156},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43760523200035095},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4193785786628723},{"id":"https://openalex.org/C186886427","wikidata":"https://www.wikidata.org/wiki/Q5441213","display_name":"Feedback loop","level":2,"score":0.4126286208629608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3603648543357849},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34232091903686523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2075188159942627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18702420592308044},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09153440594673157},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06617584824562073},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129626405002404","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626405002404","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/903bd481-234b-46ca-9c66-0a81b61dd436","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/903bd481-234b-46ca-9c66-0a81b61dd436","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tabirca, T, Freeman, L, Tabirca, S & Yang, L T 2005, 'Applying the feedback guided dynamic loop scheduling method for the shortest path problem', Parallel Processing Letters, vol. 15, no. 4, pp. 491-497. https://doi.org/10.1142/S0129626405002404","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/903bd481-234b-46ca-9c66-0a81b61dd436","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/applying-the-feedback-guided-dynamic-loop-scheduling-method-for-the-shortest-path-problem(903bd481-234b-46ca-9c66-0a81b61dd436).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tabirca, T, Freeman, L, Tabirca, S & Yang, L T 2005, 'Applying the feedback guided dynamic loop scheduling method for the shortest path problem', Parallel Processing Letters, vol. 15, no. 4, pp. 491-497. https://doi.org/10.1142/S0129626405002404","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2083734282","https://openalex.org/W2088090735","https://openalex.org/W2120490947","https://openalex.org/W2126753236","https://openalex.org/W2135644880","https://openalex.org/W2150303942","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W3013845525","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W2225350526","https://openalex.org/W1545991362","https://openalex.org/W3003077338"],"abstract_inverted_index":{"Feedback":[0],"Guided":[1],"Dynamic":[2],"Loop":[3],"Scheduling":[4],"is":[5,46],"a":[6],"recent":[7],"dynamic":[8,35],"method":[9,14,45],"for":[10,19],"loop":[11],"scheduling.":[12],"The":[13],"has":[15,26],"been":[16],"mainly":[17],"studied":[18],"synthetic":[20],"examples":[21],"so":[22],"far":[23],"and":[24,53],"it":[25],"always":[27],"offered":[28],"the":[29,44,49,61],"lowest":[30],"computational":[31],"times":[32,58],"against":[33],"other":[34],"scheduling":[36],"methods.":[37],"In":[38],"this":[39],"article":[40],"we":[41],"show":[42],"how":[43],"applied":[47],"to":[48],"shortest":[50],"path":[51],"problem":[52],"also":[54],"present":[55],"some":[56],"execution":[57],"that":[59],"prove":[60],"efficiency.":[62]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}