{"id":"https://openalex.org/W2344621474","doi":"https://doi.org/10.1109/rtas.2016.7461350","title":"Poster Abstract: Online Semi-Partitioned Multiprocessor Scheduling of Soft Real-Time Periodic Tasks for QoS Optimization","display_name":"Poster Abstract: Online Semi-Partitioned Multiprocessor Scheduling of Soft Real-Time Periodic Tasks for QoS Optimization","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2344621474","doi":"https://doi.org/10.1109/rtas.2016.7461350","mag":"2344621474"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2016.7461350","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2016.7461350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)","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/A5076785822","display_name":"Behnaz Sanati","orcid":null},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Behnaz Sanati","raw_affiliation_strings":["Department of Computer Science, University of Houston, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Texas, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001205166","display_name":"Albert M. K. Cheng","orcid":"https://orcid.org/0000-0003-2134-3056"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Albert M. K. Cheng","raw_affiliation_strings":["Department of Computer Science, University of Houston, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, Texas, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076785822"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.2895,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60868103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9733999967575073,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9733999967575073,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.953000009059906,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9394000172615051,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8158814907073975},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7458339333534241},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6175959706306458},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6105627417564392},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6046991944313049},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5712271332740784},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5314993262290955},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5087218880653381},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.2534611225128174},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23913809657096863},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.1314791440963745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11947715282440186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0555955171585083}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8158814907073975},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7458339333534241},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6175959706306458},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6105627417564392},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6046991944313049},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5712271332740784},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5314993262290955},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5087218880653381},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.2534611225128174},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23913809657096863},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.1314791440963745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11947715282440186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0555955171585083},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rtas.2016.7461350","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2016.7461350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2155564881","https://openalex.org/W1979183926","https://openalex.org/W2161267363","https://openalex.org/W2062808533","https://openalex.org/W1809394610","https://openalex.org/W2134658009","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2153689068","https://openalex.org/W2618418901"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2,60],"given.":[3],"Multiprocessor":[4],"real-time":[5,24,90,160,275],"scheduling":[6,25,136],"algorithms":[7,26,87],"may":[8],"follow":[9],"a":[10,32,55,150],"partitioned":[11,28],"or":[12,15],"global":[13],"approach":[14,155],"some":[16],"hybrid":[17],"of":[18,34,41,171,185,229,248,263],"the":[19,39,207,214,249],"two,":[20],"called":[21],"semi-partitioning.":[22],"Semi-partitioned":[23],"extend":[27,134,255],"ones":[29],"by":[30,209,218,269],"allowing":[31],"subset":[33],"tasks":[35,92,106,113,161,220,264],"to":[36,50,58,70,109,142,156,205,234,256,286],"migrate.":[37],"Given":[38],"goal":[40],"\u201cless":[42],"overhead\u201d,":[43],"it":[44],"is":[45,194,198,204],"desirable":[46],"for":[47,88,178],"such":[48,93],"strategy":[49],"be":[51,74],"boundary-limited,":[52],"and":[53,96,111,123,176,212,246,267,296],"allow":[54,68,226],"migrating":[56,121],"task":[57,231],"migrate":[59],"between":[61],"successive":[62],"invocations":[63],"(job":[64],"boundaries).":[65],"Non-boundary-limited":[66],"schedulers":[67],"jobs":[69,79,228],"migrate,":[71],"which":[72,180],"can":[73,253,277],"expensive":[75],"in":[76,162,221],"practice,":[77],"if":[78],"maintain":[80],"much":[81],"cached":[82],"state.":[83],"Previously":[84],"proposed":[85],"semi-partitioned":[86],"soft":[89,159],"(SRT)":[91],"as":[94],"EDF-fm":[95],"EDF-os,":[97],"have":[98],"two":[99,172],"phases:":[100],"an":[101,124,168,182],"offline":[102,200],"assignment":[103],"phase,":[104,131],"where":[105],"are":[107,118,137],"assigned":[108,233],"processors":[110,236],"fixed":[112],"(which":[114],"do":[115],"not":[116,284],"migrate)":[117],"distinguished":[119],"from":[120,279],"ones;":[122],"online":[125,152,169,294],"execution":[126,130],"phase.":[127,201],"In":[128,145,188],"their":[129,243,271],"rules":[132],"that":[133],"EDF":[135],"used.":[138],"These":[139],"strategies":[140],"aim":[141],"minimize":[143],"tardiness.":[144],"this":[146,189,280],"paper,":[147],"we":[148,225],"propose":[149],"new":[151],"reward-based":[153,244],"semi-partitioning":[154],"schedule":[157],"periodic":[158],"homogeneous":[163],"multiprocessor":[164],"systems.":[165,299],"We":[166],"use":[167],"choice":[170],"approximation":[173],"algorithms,":[174],"Greedy":[175],"Load-Balancing,":[177],"partitioning,":[179],"provides":[181],"optimized":[183],"usage":[184],"processing":[186],"time.":[187],"method,":[190],"no":[191,199],"prior":[192],"information":[193],"needed.":[195],"Hence,":[196],"there":[197],"Our":[202],"objective":[203],"enhance":[206],"QoS":[208],"minimizing":[210],"tardiness":[211],"maximizing":[213],"total":[215],"reward":[216],"obtained":[217],"completed":[219],"minimum":[222],"makespan.":[223],"Therefore,":[224],"different":[227,235],"any":[230],"get":[232],"(migration":[237],"at":[238],"job":[239],"boundaries)":[240],"based":[241],"on":[242],"priorities":[245],"workload":[247],"processors.":[250],"This":[251],"method":[252],"also":[254],"direct":[257],"SRT":[258],"systems":[259],"with":[260],"mixed":[261],"set":[262],"(aperiodic,":[265],"sporadic":[266],"periodic)":[268],"defining":[270],"deadline":[272],"accordingly.":[273],"Many":[274],"applications":[276],"benefit":[278],"solution":[281],"including":[282],"but":[283],"limited":[285],"video":[287,291],"streaming":[288],"servers,":[289],"multi-player":[290],"games,":[292],"mobile":[293],"banking":[295],"medical":[297],"monitoring":[298]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
