{"id":"https://openalex.org/W2772403520","doi":"https://doi.org/10.1109/pacrim.2017.8121908","title":"Hierarchical scheduling method corresponding to multiple macros of task graph","display_name":"Hierarchical scheduling method corresponding to multiple macros of task graph","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2772403520","doi":"https://doi.org/10.1109/pacrim.2017.8121908","mag":"2772403520"},"language":"en","primary_location":{"id":"doi:10.1109/pacrim.2017.8121908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pacrim.2017.8121908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","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/A5055053783","display_name":"Motoki Hasegawa","orcid":null},"institutions":[{"id":"https://openalex.org/I6030618","display_name":"Seikei University","ror":"https://ror.org/03ptaj492","country_code":"JP","type":"education","lineage":["https://openalex.org/I6030618"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Motoki Hasegawa","raw_affiliation_strings":["Graduate School of Science and Technology, Seikei University"],"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Seikei University","institution_ids":["https://openalex.org/I6030618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034481900","display_name":"Munenori Kai","orcid":null},"institutions":[{"id":"https://openalex.org/I6030618","display_name":"Seikei University","ror":"https://ror.org/03ptaj492","country_code":"JP","type":"education","lineage":["https://openalex.org/I6030618"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Munenori Kai","raw_affiliation_strings":["Graduate School of Science and Technology, Seikei University"],"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Seikei University","institution_ids":["https://openalex.org/I6030618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055053783"],"corresponding_institution_ids":["https://openalex.org/I6030618"],"apc_list":null,"apc_paid":null,"fwci":0.3011,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67642968,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9983000159263611,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9783999919891357,"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.8396483659744263},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6614927053451538},{"id":"https://openalex.org/keywords/macro","display_name":"Macro","score":0.6418236494064331},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.49784016609191895},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4840494990348816},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4670485556125641},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4500272572040558},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4390982687473297},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42518121004104614},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.41850799322128296},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4100300967693329},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36037343740463257},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23414796590805054},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.090842604637146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.074379563331604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8396483659744263},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6614927053451538},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.6418236494064331},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.49784016609191895},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4840494990348816},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4670485556125641},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4500272572040558},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4390982687473297},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42518121004104614},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.41850799322128296},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4100300967693329},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36037343740463257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23414796590805054},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.090842604637146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.074379563331604},{"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/pacrim.2017.8121908","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pacrim.2017.8121908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","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":6,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W2011039300","https://openalex.org/W2027077493","https://openalex.org/W2154293346","https://openalex.org/W2154949349","https://openalex.org/W2176978121"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2106332846","https://openalex.org/W2372008037","https://openalex.org/W2397293317","https://openalex.org/W2978148977","https://openalex.org/W3036719625","https://openalex.org/W2545511463","https://openalex.org/W1545991362","https://openalex.org/W4386128920","https://openalex.org/W2225350526"],"abstract_inverted_index":{"One":[0],"of":[1,8,50,73,79,87],"the":[2,6,24,39,57,66,77],"key":[3],"methods":[4],"for":[5,23,30,90,103],"optimization":[7,58],"parallel":[9],"processing":[10,36],"in":[11,69],"a":[12,54,70,85],"program":[13,26],"is":[14,60],"task":[15,82,88,104],"scheduling.":[16],"This":[17,93],"intends":[18],"to":[19,41,48,63],"minimize":[20],"implementation":[21],"time":[22],"entire":[25],"by":[27],"determining":[28],"schedule":[29],"optimally":[31],"allocating":[32],"tasks,":[33],"which":[34],"are":[35],"units":[37],"comprising":[38],"program,":[40],"available":[42],"processor":[43],"elements":[44],"into":[45],"pieces.":[46],"Due":[47],"complexity":[49],"calculation":[51],"and":[52],"being":[53],"large-scale":[55,91],"problem,":[56],"problem":[59],"extremely":[61],"challenging":[62],"solve":[64],"with":[65],"current":[67],"algorithms":[68],"practical":[71],"amount":[72],"time.":[74],"Authors":[75],"studied":[76],"method":[78,98],"partially":[80],"optimizing":[81],"graph":[83],"as":[84],"technique":[86],"scheduling":[89,97],"problems.":[92],"paper":[94],"reports":[95],"on":[96],"that":[99],"supports":[100],"hierarchical":[101],"macro":[102],"groups.":[105]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}