{"id":"https://openalex.org/W1496098938","doi":"https://doi.org/10.1109/icppw.2003.1240367","title":"An O(p + log p) algorithm of discrete FGDLS","display_name":"An O(p + log p) algorithm of discrete FGDLS","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W1496098938","doi":"https://doi.org/10.1109/icppw.2003.1240367","mag":"1496098938"},"language":"en","primary_location":{"id":"doi:10.1109/icppw.2003.1240367","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2003.1240367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing Workshops, 2003. Proceedings.","raw_type":"proceedings-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/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":true,"raw_author_name":"T. Tabirca","raw_affiliation_strings":["Department of Computer Science, University College Cork, Cork, Ireland","[Dept. of Computer Science, University College, Cork, Ireland]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]},{"raw_affiliation_string":"[Dept. of Computer Science, University College, Cork, Ireland]","institution_ids":["https://openalex.org/I27577105"]}]},{"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":"S. Tabirca","raw_affiliation_strings":["Department of Computer Science, University College Cork, Cork, Ireland","[Dept. of Computer Science, University College, Cork, Ireland]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]},{"raw_affiliation_string":"[Dept. of Computer Science, University College, Cork, Ireland]","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111534199","display_name":"L. Michael Freeman","orcid":null},"institutions":[{"id":"https://openalex.org/I87253917","display_name":"Manchester University","ror":"https://ror.org/02aswte26","country_code":"US","type":"education","lineage":["https://openalex.org/I87253917"]},{"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","US"],"is_corresponding":false,"raw_author_name":"L. Freeman","raw_affiliation_strings":["Department of Computer Science CNC, University of Manchester, Institute of Science and Technology, Manchester, UK","University of Manchester (UK)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science CNC, University of Manchester, Institute of Science and Technology, Manchester, UK","institution_ids":["https://openalex.org/I87253917"]},{"raw_affiliation_string":"University of Manchester (UK)","institution_ids":["https://openalex.org/I28407311"]}]},{"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":"L.T. Yang","raw_affiliation_strings":["Department of Computer Science, Saint Francis Xavier University, Antigonish, NS, Canada","St. Francis Xavier University,Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Saint Francis Xavier University, Antigonish, NS, Canada","institution_ids":["https://openalex.org/I197191942"]},{"raw_affiliation_string":"St. Francis Xavier University,Canada","institution_ids":["https://openalex.org/I197191942"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015120994"],"corresponding_institution_ids":["https://openalex.org/I27577105"],"apc_list":null,"apc_paid":null,"fwci":0.2633,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52681717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2325","issue":null,"first_page":"164","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"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.9997000098228455,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6693000197410583},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6639077067375183},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5994358658790588},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5756725668907166},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5287948250770569},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5126029849052429},{"id":"https://openalex.org/keywords/feedback-loop","display_name":"Feedback loop","score":0.5016839504241943},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4727036952972412},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4598861634731293},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43729379773139954},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.42476707696914673},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4148842692375183},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2606793940067291},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23633822798728943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12363085150718689}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6693000197410583},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6639077067375183},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5994358658790588},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5756725668907166},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5287948250770569},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5126029849052429},{"id":"https://openalex.org/C186886427","wikidata":"https://www.wikidata.org/wiki/Q5441213","display_name":"Feedback loop","level":2,"score":0.5016839504241943},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4727036952972412},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4598861634731293},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43729379773139954},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.42476707696914673},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4148842692375183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2606793940067291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23633822798728943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12363085150718689},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icppw.2003.1240367","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2003.1240367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing Workshops, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W97436512","https://openalex.org/W199438717","https://openalex.org/W1520116344","https://openalex.org/W2048231719","https://openalex.org/W2073593865","https://openalex.org/W2083734282","https://openalex.org/W2088090735","https://openalex.org/W2097686029","https://openalex.org/W2118717320","https://openalex.org/W2120490947","https://openalex.org/W2126753236","https://openalex.org/W2130613569","https://openalex.org/W2150303942","https://openalex.org/W2152129144","https://openalex.org/W2166345115","https://openalex.org/W4250908905","https://openalex.org/W6603950817","https://openalex.org/W6608146413"],"related_works":["https://openalex.org/W2385263368","https://openalex.org/W2347422947","https://openalex.org/W2061292372","https://openalex.org/W2353392568","https://openalex.org/W2377341410","https://openalex.org/W1454600515","https://openalex.org/W328874995","https://openalex.org/W25079857","https://openalex.org/W2005126053","https://openalex.org/W1781596060"],"abstract_inverted_index":{"Feedback":[0],"guided":[1],"dynamic":[2,9],"loop":[3,19,38],"scheduling":[4,42,73],"(FGDLS)":[5],"is":[6],"a":[7,17,21],"recent":[8],"method":[10,26,62],"(Bull,":[11],"1998)":[12],"that":[13],"aims":[14],"to":[15,39,78,83],"schedule":[16],"parallel":[18,37,46],"within":[20],"sequential":[22],"outer":[23],"loop.":[24,47],"The":[25],"uses":[27],"the":[28,31,35,41,44,60,64,70,79,85],"feedback":[29],"from":[30],"execution":[32],"times":[33],"of":[34,43],"current":[36],"guide":[40],"next":[45],"In":[48],"this":[49],"paper":[50],"we":[51],"propose":[52],"an":[53],"O(p":[54],"+":[55],"log":[56],"p)":[57],"algorithm":[58],"for":[59],"FGDLS":[61],"in":[63],"discrete":[65],"case.":[66],"This":[67],"approach":[68],"applies":[69],"balanced":[71],"workload":[72],"(Tabirca":[74],"et":[75],"al.,":[76],"2002)":[77],"piecewise":[80],"constant":[81],"workloads":[82],"obtain":[84],"iteration":[86],"bounds.":[87]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}