{"id":"https://openalex.org/W47553418","doi":null,"title":"Predicting the Worst-Case Execution Time of the Concurrent Execution of Instructions and Cycle-Stealing DMA I/O Operations.","display_name":"Predicting the Worst-Case Execution Time of the Concurrent Execution of Instructions and Cycle-Stealing DMA I/O Operations.","alternate_titles":[],"publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W47553418","mag":"47553418"},"language":"en","primary_location":{"id":"mag:47553418","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/lctrts/lctrts95.html#HuangL95","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W47553418"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5111409314","display_name":"Taiyi Huang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Taiyi Huang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048750937","display_name":"Jane W. S. Liu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jane W. S. Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2661,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.48086124,"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":"6"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":1.0,"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":1.0,"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":9.999999747378752e-05,"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.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"worst-case execution time","score":0.9959999918937683},{"id":"https://openalex.org/keywords/hard-real-time-systems","display_name":"hard real-time systems","score":0.7039999961853027},{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.5580000281333923},{"id":"https://openalex.org/keywords/execution-time-prediction","display_name":"execution time prediction","score":0.5910000205039978},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"matrix multiplication","score":0.6539999842643738}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7127360105514526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46559154987335205},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.463558554649353},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.4525753855705261},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3781246840953827},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3595888018608093},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3485425114631653},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.32801273465156555},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.17650768160820007}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:47553418","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/lctrts/lctrts95.html#HuangL95","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.5829","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.5829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umd.edu/pub/realtime/sigplan95/yi_liu.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7096657470","https://openalex.org/W1544881228","https://openalex.org/W47549687","https://openalex.org/W2160051641","https://openalex.org/W1757985746","https://openalex.org/W2134739198","https://openalex.org/W2014648503","https://openalex.org/W2159593428","https://openalex.org/W1515237275","https://openalex.org/W2189464748"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3],"efficient":[4],"algorithm":[5,53,73],"which":[6,135],"gives":[7],"a":[8,58,75,103,123],"bound":[9,44,154],"on":[10,45],"the":[11,16,39,43,46,52,66,79,82,143,146],"worst-case":[12,47,97,129],"execution":[13,18,48,98,130],"times":[14,99],"of":[15,19,28,81,145],"concurrent":[17],"CPU":[20],"instructions":[21],"and":[22,142],"cycle-stealing":[23],"DMA":[24],"I/O":[25,67],"operations.":[26],"Simulations":[27],"several":[29],"programs":[30],"were":[31],"conducted":[32],"to":[33,107,139,153],"evaluate":[34],"this":[35,150],"algorithm.":[36],"Compared":[37],"with":[38],"traditional":[40],"pessimistic":[41],"approach,":[42],"time":[49,131],"produced":[50],"by":[51,114],"is":[54,69,105],"significantly":[55],"tighter.":[56],"For":[57,149],"sample":[59],"program":[60],"that":[61,95,109],"multiplies":[62],"two":[63],"matrices":[64],"while":[65],"bus":[68],"fully":[70],"utilized,":[71],"our":[72],"achieves":[74],"39%":[76],"improvement":[77],"in":[78,90,122],"accuracy":[80],"prediction.":[83],"1":[84],"Introduction":[85],"Algorithms":[86],"for":[87],"scheduling":[88],"tasks":[89,111],"hard-real-time":[91],"systems":[92],"typically":[93],"assume":[94],"their":[96,115],"are":[100],"known.":[101],"Such":[102],"system":[104,124],"deigned":[106],"ensure":[108],"all":[110],"can":[112],"complete":[113],"deadlines":[116,141],"as":[117,119],"long":[118],"no":[120],"task":[121,134],"executes":[125],"longer":[126],"than":[127],"its":[128],"(WCET).":[132],"A":[133],"overruns":[136],"may":[137],"lead":[138],"missed":[140],"failure":[144],"whole":[147],"system.":[148],"reason,":[151],"how":[152],"...":[155]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W47553418","counts_by_year":[],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
