{"id":"https://openalex.org/W2071297493","doi":"https://doi.org/10.1145/2236576.2236579","title":"Exploration of heuristic scheduling algorithms for 3D multicore processors","display_name":"Exploration of heuristic scheduling algorithms for 3D multicore processors","publication_year":2012,"publication_date":"2012-05-15","ids":{"openalex":"https://openalex.org/W2071297493","doi":"https://doi.org/10.1145/2236576.2236579","mag":"2071297493"},"language":"en","primary_location":{"id":"doi:10.1145/2236576.2236579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2236576.2236579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5027304804","display_name":"Thomas Canhao Xu","orcid":"https://orcid.org/0000-0003-1072-0792"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Thomas Canhao Xu","raw_affiliation_strings":["University of Turku, Turku, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019546150","display_name":"Pasi Liljeberg","orcid":"https://orcid.org/0000-0002-9392-3589"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Pasi Liljeberg","raw_affiliation_strings":["University of Turku, Turku, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075314597","display_name":"Juha Plosila","orcid":"https://orcid.org/0000-0003-4018-5495"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Juha Plosila","raw_affiliation_strings":["University of Turku, Turku, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003371230","display_name":"Hannu Tenhunen","orcid":"https://orcid.org/0000-0003-1959-6513"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Hannu Tenhunen","raw_affiliation_strings":["University of Turku, Turku, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I155660961"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9975000023841858,"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.8352609872817993},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6686019897460938},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6478105783462524},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6324107646942139},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.57478266954422},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5650025010108948},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5086827874183655},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5008678436279297},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4977843761444092},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4750785231590271},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4672626852989197},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.4502524435520172},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4439547061920166},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4411110281944275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37577134370803833},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.11423325538635254},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0981166660785675},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09796839952468872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09372773766517639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8352609872817993},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6686019897460938},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6478105783462524},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6324107646942139},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.57478266954422},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5650025010108948},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5086827874183655},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5008678436279297},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4977843761444092},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4750785231590271},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4672626852989197},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.4502524435520172},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4439547061920166},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4411110281944275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37577134370803833},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.11423325538635254},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0981166660785675},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09796839952468872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09372773766517639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2236576.2236579","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2236576.2236579","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1989741444","https://openalex.org/W1990828594","https://openalex.org/W1992195420","https://openalex.org/W2005646196","https://openalex.org/W2014919362","https://openalex.org/W2045836768","https://openalex.org/W2058338151","https://openalex.org/W2073617174","https://openalex.org/W2088993372","https://openalex.org/W2100720297","https://openalex.org/W2104283712","https://openalex.org/W2107495642","https://openalex.org/W2115008815","https://openalex.org/W2115678927","https://openalex.org/W2120635877","https://openalex.org/W2123184444","https://openalex.org/W2129296059","https://openalex.org/W2129442721","https://openalex.org/W2133593621","https://openalex.org/W2139730616","https://openalex.org/W2141736089","https://openalex.org/W2143335496","https://openalex.org/W2145547293","https://openalex.org/W2153130545","https://openalex.org/W2162968317","https://openalex.org/W2169875292","https://openalex.org/W2171589621","https://openalex.org/W2176737090","https://openalex.org/W3152703111","https://openalex.org/W4230669310","https://openalex.org/W4237131533","https://openalex.org/W4239080746"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W4386128920","https://openalex.org/W2106332846","https://openalex.org/W2545511463","https://openalex.org/W2172075652","https://openalex.org/W2369829641","https://openalex.org/W2167842822","https://openalex.org/W2372879566"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"explore":[4,110],"heuristic":[5,92],"scheduling":[6,73,93,112,136,152,155,173],"algorithms":[7,174],"for":[8,79,86,160,171,175],"future":[9,176],"multicore":[10],"processors.":[11],"It":[12],"is":[13,51],"expected":[14],"that":[15,126],"hundreds":[16],"or":[17],"even":[18],"thousands":[19],"of":[20,105,120,134],"cores":[21],"will":[22],"be":[23,64],"integrated":[24],"on":[25],"a":[26,31,84,91,169],"single":[27],"chip,":[28],"known":[29],"as":[30],"Chip":[32],"Multiprocessor":[33],"(CMP).":[34],"To":[35],"reduce":[36,98],"on-chip":[37],"communication":[38],"delay":[39,104],"and":[40,89,102,114,118,145],"improve":[41],"efficiency,":[42],"three-dimensional":[43],"(3D)":[44],"integration":[45],"with":[46,149],"Through":[47],"Silicon":[48],"Vias":[49],"(TSVs)":[50],"introduced":[52],"to":[53,97],"replace":[54],"the":[55,103,116,131,150],"traditional":[56],"two-dimensional":[57],"(2D)":[58],"implementation.":[59],"Multiple":[60],"functional":[61],"layers":[62],"can":[63],"stacked":[65],"in":[66,138],"3D":[67,87,177],"CMPs.":[68,178],"However,":[69],"operating":[70],"system":[71],"process":[72,107],"has":[74],"not":[75],"been":[76],"well":[77],"addressed":[78],"such":[80],"systems.":[81],"We":[82,109],"define":[83],"model":[85],"CMPs,":[88],"propose":[90],"algorithm":[94],"which":[95],"aims":[96],"cache":[99],"access":[100],"latencies":[101],"inter":[106],"communication.":[108],"different":[111,129,158],"methods":[113,156],"discuss":[115],"advantages":[117],"disadvantages":[119],"our":[121,135],"algorithm.":[122],"Experimental":[123],"results":[124],"show":[125],"under":[127],"three":[128],"workloads,":[130],"execution":[132],"times":[133],"method":[137],"two":[139],"configurations":[140],"are":[141,163],"reduced":[142],"by":[143],"14.5%":[144],"5.86%":[146],"respectively,":[147],"compared":[148],"other":[151],"methods.":[153],"Two":[154],"from":[157],"heuristics":[159],"8-thread":[161],"tasks":[162],"also":[164],"compared.":[165],"This":[166],"research":[167],"provides":[168],"guideline":[170],"designing":[172]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}