{"id":"https://openalex.org/W2551203741","doi":"https://doi.org/10.1145/2987386.2987390","title":"Scheduling Algorithm for Tasks with Multiple Parallelization Options on Multiprocessor Systems","display_name":"Scheduling Algorithm for Tasks with Multiple Parallelization Options on Multiprocessor Systems","publication_year":2016,"publication_date":"2016-10-11","ids":{"openalex":"https://openalex.org/W2551203741","doi":"https://doi.org/10.1145/2987386.2987390","mag":"2551203741"},"language":"en","primary_location":{"id":"doi:10.1145/2987386.2987390","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987386.2987390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","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/A5101523391","display_name":"Chin\u2010Fu Kuo","orcid":"https://orcid.org/0000-0001-9891-3788"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chin-Fu Kuo","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C","institution_ids":["https://openalex.org/I192168892"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013547307","display_name":"Yung-Feng Lu","orcid":"https://orcid.org/0000-0001-6276-2287"},"institutions":[{"id":"https://openalex.org/I131948415","display_name":"National Taichung University of Science and Technology","ror":"https://ror.org/05bgcav40","country_code":"TW","type":"education","lineage":["https://openalex.org/I131948415"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yung-Feng Lu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taichung University of Science and Technology, Taichung, Taiwan, R.O.C","institution_ids":["https://openalex.org/I131948415"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065992735","display_name":"Tzu-Chieh Chen","orcid":"https://orcid.org/0000-0003-4682-5051"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tzu-Chieh Chen","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C","institution_ids":["https://openalex.org/I192168892"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101523391"],"corresponding_institution_ids":["https://openalex.org/I192168892"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12807974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"175","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9961000084877014,"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.9952999949455261,"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.8741576671600342},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.789068341255188},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7217602133750916},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6498581171035767},{"id":"https://openalex.org/keywords/automatic-parallelization","display_name":"Automatic parallelization","score":0.6215180158615112},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5613930225372314},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5075032114982605},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48345765471458435},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4809276759624481},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4757934808731079},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.41590234637260437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4118945002555847},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32515883445739746},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.2475917637348175},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.16971459984779358},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.10852563381195068},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09813335537910461},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07396012544631958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06260034441947937}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8741576671600342},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.789068341255188},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7217602133750916},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6498581171035767},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.6215180158615112},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5613930225372314},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5075032114982605},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48345765471458435},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4809276759624481},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4757934808731079},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.41590234637260437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4118945002555847},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32515883445739746},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2475917637348175},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.16971459984779358},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.10852563381195068},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09813335537910461},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07396012544631958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06260034441947937},{"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/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2987386.2987390","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987386.2987390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","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/W1604465009","https://openalex.org/W1909929165","https://openalex.org/W2109488193","https://openalex.org/W2153059027","https://openalex.org/W2158002367","https://openalex.org/W2861701245"],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1833217363","https://openalex.org/W2126540184","https://openalex.org/W2161267363","https://openalex.org/W2113103857","https://openalex.org/W2062808533","https://openalex.org/W2140012984","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291"],"abstract_inverted_index":{"The":[0,133],"purpose":[1],"of":[2,12,107,140],"this":[3],"paper":[4],"is":[5,148],"to":[6,103,111],"study":[7],"the":[8,19,46,74,83,113,117,124,130,138,141,144,153],"task":[9,13,20,58,64,85],"scheduling":[10],"problem":[11],"sets":[14],"on":[15,49],"multiprocessor":[16],"systems.":[17],"In":[18],"set":[21],"there":[22],"are":[23,38,101],"parallel":[24,80,84,99],"tasks":[25,30,94,100],"and":[26,57,95],"sequential":[27,93],"tasks.":[28],"Parallel":[29],"can":[31,121],"not":[32],"meet":[33],"their":[34],"deadlines":[35],"if":[36],"they":[37],"executed":[39],"by":[40],"one":[41],"unique":[42],"thread.":[43],"We":[44],"propose":[45],"Worst-Fit":[47],"based":[48],"Equal":[50,145,154],"Slack":[51,146],"(WFES)":[52],"algorithm":[53,126],"for":[54,78,98],"deadline":[55],"setting":[56],"assignment.":[59],"To":[60],"derive":[61],"a":[62,69],"feasible":[63],"assignment,":[65],"we":[66,120],"must":[67],"select":[68],"proper":[70],"parallelization":[71,76],"level":[72],"from":[73],"available":[75],"options":[77],"each":[79],"task.":[81],"Then":[82],"will":[86],"be":[87],"split":[88],"into":[89],"several":[90],"subtasks.":[91],"Finally,":[92],"generated":[96],"subtasks":[97],"assigned":[102],"processors.":[104],"A":[105],"series":[106],"experiments":[108],"were":[109],"conducted":[110],"evaluate":[112],"proposed":[114,125],"algorithm.":[115],"From":[116],"experimental":[118,134],"results,":[119],"observe":[122],"that":[123,137,151],"had":[127],"better":[128,149],"performance":[129,139],"compared":[131],"algorithms.":[132],"results":[135],"demonstrate":[136],"algorithms":[142],"using":[143,152],"strategy":[147],"than":[150],"Flexibility":[155],"strategy.":[156]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
