{"id":"https://openalex.org/W2117377736","doi":"https://doi.org/10.1109/tpds.2015.2468223","title":"Developing Graph-Based Co-Scheduling Algorithms on Multicore Computers","display_name":"Developing Graph-Based Co-Scheduling Algorithms on Multicore Computers","publication_year":2015,"publication_date":"2015-08-14","ids":{"openalex":"https://openalex.org/W2117377736","doi":"https://doi.org/10.1109/tpds.2015.2468223","mag":"2117377736"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2015.2468223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2015.2468223","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5064596191","display_name":"Ligang He","orcid":"https://orcid.org/0000-0002-5671-0576"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ligang He","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072678098","display_name":"Huanzhou Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Huanzhou Zhu","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051267613","display_name":"Stephen A. Jarvis","orcid":"https://orcid.org/0000-0002-1249-2167"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stephen A. Jarvis","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":2.9031,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.90893761,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"6","first_page":"1617","last_page":"1632"},"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.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8605346083641052},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.64051353931427},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.5069237351417542},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49857115745544434},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4857216477394104},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.48171454668045044},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4680475890636444},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45118528604507446},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4397132992744446},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.43644002079963684},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43316712975502014},{"id":"https://openalex.org/keywords/shared-resource","display_name":"Shared resource","score":0.4282474219799042},{"id":"https://openalex.org/keywords/gang-scheduling","display_name":"Gang scheduling","score":0.42475542426109314},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.41137388348579407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21409085392951965},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.16645324230194092},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10821065306663513},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08939188718795776},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08459371328353882}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8605346083641052},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.64051353931427},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.5069237351417542},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49857115745544434},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4857216477394104},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.48171454668045044},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4680475890636444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45118528604507446},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4397132992744446},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.43644002079963684},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43316712975502014},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.4282474219799042},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.42475542426109314},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41137388348579407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21409085392951965},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.16645324230194092},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10821065306663513},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08939188718795776},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08459371328353882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tpds.2015.2468223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2015.2468223","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:71239","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/916c7200-4cc7-4092-85d6-fd80e6efa91d","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/916c7200-4cc7-4092-85d6-fd80e6efa91d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"He, L, Zhu, H & Jarvis, S A 2016, 'Developing Graph-Based Co-Scheduling Algorithms on Multicore Computers', IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 6, 7194818, pp. 1617-1632. https://doi.org/10.1109/TPDS.2015.2468223","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4000000059604645}],"awards":[{"id":"https://openalex.org/G2712914820","display_name":null,"funder_award_id":"38405-2013","funder_id":"https://openalex.org/F4320307102","funder_display_name":"Intel Corporation"},{"id":"https://openalex.org/G685354317","display_name":null,"funder_award_id":"15220082-2015","funder_id":"https://openalex.org/F4320307102","funder_display_name":"Intel Corporation"}],"funders":[{"id":"https://openalex.org/F4320307102","display_name":"Intel Corporation","ror":"https://ror.org/01ek73717"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W136905915","https://openalex.org/W150733230","https://openalex.org/W625640516","https://openalex.org/W1939576174","https://openalex.org/W1964225254","https://openalex.org/W1964232008","https://openalex.org/W1971165887","https://openalex.org/W1991376651","https://openalex.org/W2001986196","https://openalex.org/W2018052702","https://openalex.org/W2018404774","https://openalex.org/W2023214828","https://openalex.org/W2040344921","https://openalex.org/W2054604581","https://openalex.org/W2098278566","https://openalex.org/W2103010325","https://openalex.org/W2105419678","https://openalex.org/W2118898690","https://openalex.org/W2122410182","https://openalex.org/W2123065508","https://openalex.org/W2129816520","https://openalex.org/W2130016335","https://openalex.org/W2135505107","https://openalex.org/W2138708064","https://openalex.org/W2139130527","https://openalex.org/W2150139096","https://openalex.org/W2152061572","https://openalex.org/W2155396321","https://openalex.org/W2160121678","https://openalex.org/W2163961697","https://openalex.org/W2164348333","https://openalex.org/W2169665207","https://openalex.org/W2536397263","https://openalex.org/W2625060911","https://openalex.org/W2946046356","https://openalex.org/W3019231615","https://openalex.org/W3144141583","https://openalex.org/W3145128584","https://openalex.org/W4232724790","https://openalex.org/W4234714494","https://openalex.org/W4237941914","https://openalex.org/W4243030509","https://openalex.org/W4301014558","https://openalex.org/W6606137640","https://openalex.org/W6679004590","https://openalex.org/W6684084819","https://openalex.org/W6739059860"],"related_works":["https://openalex.org/W2156285842","https://openalex.org/W1904356719","https://openalex.org/W606982038","https://openalex.org/W2156471982","https://openalex.org/W1007906405","https://openalex.org/W2225853121","https://openalex.org/W1994862503","https://openalex.org/W2265010461","https://openalex.org/W33576275","https://openalex.org/W2900678484"],"abstract_inverted_index":{"It":[0],"is":[1,30,67,98,111,142,192],"common":[2],"that":[3,33,172,201],"multiple":[4],"cores":[5],"reside":[6],"on":[7],"the":[8,13,56,64,102,109,134,149,153,162,165,173,178,199,205,210,213],"same":[9],"chip":[10],"and":[11,39,80,86,120,152,185],"share":[12],"on-chip":[14],"cache.":[15],"As":[16],"a":[17,31,95,138,146],"result,":[18],"resource":[19],"sharing":[20],"can":[21,34,176,203],"cause":[22],"performance":[23],"degradation":[24],"of":[25,126,164],"co-running":[26],"jobs.":[27,123,187],"Job":[28],"co-scheduling":[29,58,71,104,167,180],"technique":[32,141,191],"effectively":[35],"alleviate":[36],"this":[37,93],"contention":[38],"many":[40],"co-schedulers":[41,75],"have":[42],"been":[43],"reported":[44],"in":[45,89,198],"related":[46],"literature.":[47],"Most":[48],"solutions":[49],"however":[50],"do":[51],"not":[52],"aim":[53],"to":[54,62,100,114,132,144,160,195],"find":[55,101,177],"optimal":[57,65,103,179],"solution.":[59],"Being":[60],"able":[61],"determine":[63],"solution":[66,105,154,181,214],"critical":[68],"for":[69,106,182,212],"evaluating":[70],"systems.":[72,91],"Moreover,":[73,137],"most":[74],"only":[76],"consider":[77],"serial":[78,87,107,184],"jobs,":[79,117],"there":[81],"often":[82],"exist":[83],"both":[84,183],"parallel":[85,116,122,186],"jobs":[88],"real-world":[90],"In":[92],"paper":[94],"graph-based":[96],"method":[97,110],"developed":[99,131],"jobs;":[108],"then":[112],"extended":[113],"incorporate":[115],"including":[118],"multi-process,":[119],"multi-threaded":[121],"A":[124],"number":[125],"optimization":[127],"measures":[128],"are":[129,158],"also":[130,193],"accelerate":[133],"solving":[135,150,206],"process.":[136],"flexible":[139,197],"approximation":[140,190],"proposed":[143,166,174,189],"strike":[145],"balance":[147],"between":[148],"speed":[151,207],"quality.":[155,215],"Extensive":[156],"experiments":[157],"conducted":[159],"evaluate":[161],"effectiveness":[163],"algorithms.":[168],"The":[169,188],"results":[170],"show":[171],"algorithms":[175],"shown":[194],"be":[196],"sense":[200],"we":[202],"control":[204],"by":[208],"setting":[209],"requirement":[211]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}