{"id":"https://openalex.org/W2098391307","doi":"https://doi.org/10.1109/rttas.2003.1203031","title":"Real-time scheduling of hierarchical reward-based tasks","display_name":"Real-time scheduling of hierarchical reward-based tasks","publication_year":2004,"publication_date":"2004-06-22","ids":{"openalex":"https://openalex.org/W2098391307","doi":"https://doi.org/10.1109/rttas.2003.1203031","mag":"2098391307"},"language":"en","primary_location":{"id":"doi:10.1109/rttas.2003.1203031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2003.1203031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, 2003. Proceedings.","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/A5097803013","display_name":"Ming Zu","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":"Ming Zu","raw_affiliation_strings":["Real-Time Systems Laboratory, Department of Computer Science, University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"Real-Time Systems Laboratory, Department of Computer Science, University of Houston, Houston, TX, 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":"A.M.K. Cheng","raw_affiliation_strings":["Real-Time Systems Laboratory, Department of Computer Science, University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"Real-Time Systems Laboratory, Department of Computer Science, University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5097803013"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":1.3165,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79825134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":null,"first_page":"2","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994000196456909,"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.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980000257492065,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9976999759674072,"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.8415822982788086},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.742579996585846},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5209437608718872},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5091957449913025},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4234696626663208},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1475164294242859},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12450012564659119},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.08754599094390869}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8415822982788086},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.742579996585846},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5209437608718872},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5091957449913025},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4234696626663208},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1475164294242859},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12450012564659119},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.08754599094390869},{"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},{"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.1109/rttas.2003.1203031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2003.1203031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W17622416","https://openalex.org/W1494985239","https://openalex.org/W1907214776","https://openalex.org/W1947595451","https://openalex.org/W2001959194","https://openalex.org/W2067843896","https://openalex.org/W2099604721","https://openalex.org/W2103111466","https://openalex.org/W2116140484","https://openalex.org/W2121219357","https://openalex.org/W2129481640","https://openalex.org/W2133991830","https://openalex.org/W2136704878","https://openalex.org/W2137017710","https://openalex.org/W2143621544","https://openalex.org/W2145718064","https://openalex.org/W2149031669","https://openalex.org/W2149946979","https://openalex.org/W2156574306","https://openalex.org/W2164448820","https://openalex.org/W2165538927","https://openalex.org/W2168650374","https://openalex.org/W4238068622","https://openalex.org/W6600743032"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2128410848","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2130555437","https://openalex.org/W3023290810"],"abstract_inverted_index":{"A":[0],"reward-based":[1,38],"task":[2],"typically":[3],"consists":[4],"of":[5,37,42,88,104],"a":[6,34,57],"mandatory":[7],"part":[8,20],"that":[9,21],"must":[10],"be":[11,82,99],"accomplished":[12],"before":[13],"the":[14,89],"given":[15],"deadline,":[16],"and":[17,51,78],"an":[18],"optional":[19],"is":[22],"associated":[23],"with":[24,84],"rewards":[25,77],"for":[26,61,101],"partial":[27],"completion.":[28],"In":[29,68],"this":[30,96],"paper":[31],"we":[32],"consider":[33],"hierarchical":[35],"framework":[36],"tasks.":[39],"These":[40],"types":[41],"tasks":[43,63,71],"are":[44,72],"characterized":[45],"by":[46,74],"positive":[47],"rewards,":[48],"tree-like":[49],"order-dependency":[50],"identical":[52],"service":[53],"times.":[54],"We":[55,92],"propose":[56],"near-optimal":[58],"scheduling":[59,80],"algorithm":[60],"such":[62],"under":[64],"hard-real":[65],"time":[66],"constraints.":[67],"our":[69],"technique,":[70],"pre-sorted":[73],"their":[75],"potential":[76],"real-time":[79],"can":[81],"achieved":[83],"no":[85],"prior":[86],"knowledge":[87],"hard":[90],"deadlines.":[91],"also":[93],"demonstrate":[94],"how":[95],"approach":[97],"could":[98],"utilized":[100],"uninterrupted":[102],"transfer":[103],"multimedia":[105],"in":[106],"varying":[107],"network":[108],"conditions,":[109],"while":[110],"delivering":[111],"near-best":[112],"results.":[113]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}