{"id":"https://openalex.org/W3217660409","doi":"https://doi.org/10.1145/3489469","title":"Hierarchical Scheduling of an SDF/L Graph onto Multiple Processors","display_name":"Hierarchical Scheduling of an SDF/L Graph onto Multiple Processors","publication_year":2021,"publication_date":"2021-11-22","ids":{"openalex":"https://openalex.org/W3217660409","doi":"https://doi.org/10.1145/3489469","mag":"3217660409"},"language":"en","primary_location":{"id":"doi:10.1145/3489469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489469","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic 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/A5032256317","display_name":"Mari-Liis Oldja","orcid":"https://orcid.org/0000-0002-6426-7252"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Mari-Liis Oldja","raw_affiliation_strings":["Seoul National University, Gwanak-gu, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Gwanak-gu, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058275238","display_name":"Jangryul Kim","orcid":"https://orcid.org/0000-0001-6764-9419"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jangryul Kim","raw_affiliation_strings":["Seoul National University, Gwanak-gu, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Gwanak-gu, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072513978","display_name":"Dowhan Jeong","orcid":"https://orcid.org/0000-0001-6310-3697"},"institutions":[{"id":"https://openalex.org/I4210163888","display_name":"Nkmax (South Korea)","ror":"https://ror.org/05knvbx59","country_code":"KR","type":"company","lineage":["https://openalex.org/I4210163888"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dowhan Jeong","raw_affiliation_strings":["TmaxA&C, Seongnam-si, Gyeonggi-do, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TmaxA&C, Seongnam-si, Gyeonggi-do, South Korea","institution_ids":["https://openalex.org/I4210163888"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029793438","display_name":"Soonhoi Ha","orcid":"https://orcid.org/0000-0001-7472-9142"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soonhoi Ha","raw_affiliation_strings":["Seoul National University, Gwanak-gu, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Gwanak-gu, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19647779,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"27","issue":"3","first_page":"1","last_page":"23"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994000196456909,"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.9110183715820312},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.8865508437156677},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7151217460632324},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6609066724777222},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5530050992965698},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4879443049430847},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.4596386253833771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45727968215942383},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45215603709220886},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39144366979599},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3240845799446106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1111697256565094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9110183715820312},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.8865508437156677},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7151217460632324},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6609066724777222},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5530050992965698},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4879443049430847},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.4596386253833771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45727968215942383},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45215603709220886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39144366979599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3240845799446106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1111697256565094},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3489469","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489469","pdf_url":null,"source":{"id":"https://openalex.org/S105046310","display_name":"ACM Transactions on Design Automation of Electronic Systems","issn_l":"1084-4309","issn":["1084-4309","1557-7309"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Design Automation of Electronic Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W54141638","https://openalex.org/W1559060679","https://openalex.org/W1568192366","https://openalex.org/W1597755753","https://openalex.org/W2000199097","https://openalex.org/W2012569660","https://openalex.org/W2091158003","https://openalex.org/W2103196858","https://openalex.org/W2115661999","https://openalex.org/W2115664043","https://openalex.org/W2122432688","https://openalex.org/W2136453233","https://openalex.org/W2149294210","https://openalex.org/W2151676061","https://openalex.org/W2171249953","https://openalex.org/W2401129385","https://openalex.org/W2531330146","https://openalex.org/W2566936944","https://openalex.org/W2625899533","https://openalex.org/W2924967524","https://openalex.org/W2997758403","https://openalex.org/W3010466514","https://openalex.org/W3095320840","https://openalex.org/W3125311319","https://openalex.org/W3140485605","https://openalex.org/W4247327509","https://openalex.org/W4254265573","https://openalex.org/W6635964534"],"related_works":["https://openalex.org/W2293118914","https://openalex.org/W2998381397","https://openalex.org/W4236419692","https://openalex.org/W3167919718","https://openalex.org/W4251718783","https://openalex.org/W2171015181","https://openalex.org/W4239447582","https://openalex.org/W4225271228","https://openalex.org/W1484403103","https://openalex.org/W2521947294"],"abstract_inverted_index":{"Although":[0],"dataflow":[1,37],"models":[2],"are":[3,31],"known":[4],"to":[5,17],"thrive":[6],"at":[7,95,107],"exploiting":[8],"task-level":[9],"parallelism":[10,20],"of":[11,21,59,78,113],"an":[12,60,81],"application,":[13],"it":[14],"is":[15,118],"difficult":[16],"exploit":[18],"the":[19,46,64,71,76,105,114],"data,":[22],"represented":[23,62],"well":[24],"with":[25,120],"loop":[26,47,93],"structures,":[27],"since":[28],"these":[29],"structures":[30,48],"not":[32],"explicitly":[33,49],"specified":[34],"in":[35,50,87],"existing":[36],"models.":[38],"SDF/L":[39,65,126],"model":[40,66],"overcomes":[41],"this":[42],"shortcoming":[43],"by":[44,63],"specifying":[45],"a":[51,56,88,108],"hierarchical":[52],"fashion.":[53],"We":[54],"introduce":[55],"scheduling":[57,116],"technique":[58],"application":[61],"onto":[67],"heterogeneous":[68],"processors.":[69],"In":[70],"proposed":[72,115],"method,":[73],"we":[74],"explore":[75],"mapping":[77],"tasks":[79],"using":[80],"evolutionary":[82],"meta-heuristic":[83],"and":[84,99,123],"schedule":[85,106],"hierarchically":[86],"bottom-up":[89],"fashion,":[90],"creating":[91],"parallel":[92],"schedules":[94],"lower":[96],"levels":[97],"first":[98],"then":[100],"re-using":[101],"them":[102],"when":[103],"constructing":[104],"higher":[109],"level.":[110],"The":[111],"efficiency":[112],"methodology":[117],"verified":[119],"benchmark":[121],"examples":[122],"randomly":[124],"generated":[125],"graphs.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}