{"id":"https://openalex.org/W2345091252","doi":"https://doi.org/10.1109/rtas.2016.7461349","title":"Poster Abstract: Memory-Aware Response Time Analysis for P-FRP Tasks","display_name":"Poster Abstract: Memory-Aware Response Time Analysis for P-FRP Tasks","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2345091252","doi":"https://doi.org/10.1109/rtas.2016.7461349","mag":"2345091252"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2016.7461349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2016.7461349","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/A5025288288","display_name":"Xingliang Zou","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":"Xingliang Zou","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"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":"Albert M. K. Cheng","raw_affiliation_strings":["Department of Computer Science, University of Houston, Houston, TX, USA"],"affiliations":[{"raw_affiliation_string":"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/A5025288288"],"corresponding_institution_ids":["https://openalex.org/I44461941"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03028023,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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.9993000030517578,"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.9904999732971191,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9782999753952026,"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.8412965536117554},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6743724346160889},{"id":"https://openalex.org/keywords/abort","display_name":"Abort","score":0.6703900098800659},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.561484158039093},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5500591397285461},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.5311183929443359},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.4804922342300415},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46292850375175476},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46260225772857666},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4457889497280121},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.42591068148612976},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.42341238260269165},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.4190242290496826},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.33622950315475464},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2805216908454895},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1532578468322754},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.143521249294281},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.07423913478851318}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8412965536117554},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6743724346160889},{"id":"https://openalex.org/C2777549182","wikidata":"https://www.wikidata.org/wiki/Q15117556","display_name":"Abort","level":2,"score":0.6703900098800659},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.561484158039093},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5500591397285461},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.5311183929443359},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.4804922342300415},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46292850375175476},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46260225772857666},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4457889497280121},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.42591068148612976},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.42341238260269165},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.4190242290496826},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.33622950315475464},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2805216908454895},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1532578468322754},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.143521249294281},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.07423913478851318},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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.1109/rtas.2016.7461349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2016.7461349","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.5400000214576721,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4290043243","https://openalex.org/W2314658126","https://openalex.org/W2063377000","https://openalex.org/W2556256733","https://openalex.org/W2765448081","https://openalex.org/W2029789321","https://openalex.org/W2083525215","https://openalex.org/W1975235870","https://openalex.org/W2096768313","https://openalex.org/W1612411019"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"Functional":[4],"Reactive":[5],"Programming":[6],"(FRP)":[7],"is":[8,116,163,170,177,200,205,226,233,252,280,304],"playing":[9],"and":[10,40,62,100,145,168,198,237,274,288],"potentially":[11],"going":[12],"to":[13,48,185,241,281,307],"play":[14],"a":[15,26,44,49,53,59,87,114,150,203,224],"more":[16,31,35,283],"important":[17],"role":[18],"in":[19,37,124,142,195,217,235,255,292,315],"real-time":[20,32],"systems.":[21,260],"Priority-based":[22],"(preemptive)":[23],"FRP":[24,29],"(P-FRP),":[25],"variant":[27],"of":[28,107,113,211,258],"with":[30],"characteristics,":[33],"demands":[34],"research":[36,279,291,321],"its":[38,120],"scheduling":[39,320],"timing":[41],"analysis.":[42],"In":[43,102,188,261],"P-FRP":[45,190,259,269,295,318],"system,":[46,52],"similar":[47],"classic":[50,83],"preemptive":[51,84],"higher":[54,74],"priority":[55,75,289],"task":[56,69,88,96,115,152,204,225,231,270,296,319],"can":[57,220],"preempt":[58],"lower-priority":[60,68],"one":[61],"make":[63],"the":[64,73,82,91,95,105,136,189,192,209,214,230,293,300],"latter":[65],"abort.":[66],"The":[67],"will":[70,311],"restart":[71],"after":[72],"tasks":[76,127],"complete":[77],"their":[78],"execution.":[79],"However,":[80,123],"unlike":[81],"model,":[85,191],"when":[86,134,202,223],"aborts,":[89],"all":[90,119],"changes":[92],"made":[93],"by":[94,179],"are":[97,183],"discarded":[98],"(Abort":[99],"Restart).":[101],"previous":[103,256],"studies,":[104],"value":[106],"Worst":[108],"Case":[109],"Execution":[110],"Time":[111],"(WCET)":[112],"used":[117],"for":[118,228],"restarted":[121,126],"tasks.":[122],"practice":[125],"likely":[128,305],"consume":[129],"less":[130,222],"time":[131,193,215,272,286,302],"than":[132],"WCET":[133],"considering":[135],"memory":[137,212,247,250],"effect":[138,251],"such":[139],"as":[140],"cache-hit":[141],"loading":[143],"code":[144,162,232],"data.":[146],"Here":[147],"we":[148,264,310],"consider":[149],"typical":[151],"life":[153],"cycle":[154],"without":[155],"being":[156],"interrupted":[157],"(cold":[158],"started":[159],"task):":[160],"(1)":[161,219],"loaded":[164,171],"from":[165,172,244],"hard":[166],"drive":[167],"data":[169,308],"main":[173,186,246],"memory;":[174],"(2)":[175,197],"computation":[176],"done":[178],"processor(s);":[180],"(3)":[181,199],"results":[182],"committed":[184],"memory.":[187],"spent":[194,216],"phase":[196,218],"wasted":[201],"aborted,":[206],"however,":[207],"since":[208,299],"existence":[210],"hierarchy,":[213],"be":[221,242],"restarted,":[227],"example,":[229],"still":[234],"cache":[236],"does":[238],"not":[239,253],"need":[240],"read":[243],"slow":[245],"again.":[248],"This":[249],"considered":[254],"studies":[257],"this":[262,313],"paper,":[263],"present":[265,282],"our":[266,316],"preliminary":[267],"memory-aware":[268,294],"response":[271,285],"analysis":[273,287],"experimental":[275],"results.":[276],"Our":[277],"ongoing":[278],"theoretical":[284],"assignment":[290],"scheduling.":[297],"And":[298],"execution":[301],"difference":[303,314],"related":[306],"placement/locality,":[309],"address":[312],"multi-core":[317],"too.":[322]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}