{"id":"https://openalex.org/W1537780098","doi":"https://doi.org/10.1109/iscc.2004.1358384","title":"A methodology to compute task remaining execution time","display_name":"A methodology to compute task remaining execution time","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1537780098","doi":"https://doi.org/10.1109/iscc.2004.1358384","mag":"1537780098"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2004.1358384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2004.1358384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","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/A5070237662","display_name":"Shadma Tasneem","orcid":"https://orcid.org/0000-0002-2851-202X"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Tasneem","raw_affiliation_strings":["Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010317923","display_name":"Reda A. Ammar","orcid":"https://orcid.org/0000-0003-1332-2677"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ammar","raw_affiliation_strings":["Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111871722","display_name":"Howard A. Sholl","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Sholl","raw_affiliation_strings":["Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.07235237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"74","last_page":"79 Vol.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.9998000264167786,"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.9998000264167786,"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.9991000294685364,"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.9987999796867371,"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/computer-science","display_name":"Computer science","score":0.779167652130127},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.687157392501831},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6716179847717285},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.5573778748512268},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5200904607772827},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4991741180419922},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49516478180885315},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4456513524055481},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42232105135917664},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41096729040145874},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39558035135269165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2981332540512085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1977342963218689},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1566658914089203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10931599140167236}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.779167652130127},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.687157392501831},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6716179847717285},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.5573778748512268},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5200904607772827},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4991741180419922},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49516478180885315},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4456513524055481},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42232105135917664},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41096729040145874},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39558035135269165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2981332540512085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1977342963218689},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1566658914089203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10931599140167236},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2004.1358384","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2004.1358384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","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":21,"referenced_works":["https://openalex.org/W37918579","https://openalex.org/W1635175280","https://openalex.org/W1657203581","https://openalex.org/W1867018545","https://openalex.org/W1996363841","https://openalex.org/W2084881175","https://openalex.org/W2093268638","https://openalex.org/W2109488193","https://openalex.org/W2109943812","https://openalex.org/W2111087562","https://openalex.org/W2120945246","https://openalex.org/W2141925883","https://openalex.org/W2146398836","https://openalex.org/W2176566884","https://openalex.org/W2262960161","https://openalex.org/W2562160379","https://openalex.org/W2907092002","https://openalex.org/W3163287424","https://openalex.org/W6601544268","https://openalex.org/W6636751970","https://openalex.org/W6676528785"],"related_works":["https://openalex.org/W1515433387","https://openalex.org/W1484796814","https://openalex.org/W2507397068","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2537786014","https://openalex.org/W52215546","https://openalex.org/W2119358936","https://openalex.org/W4367046720","https://openalex.org/W2102938079"],"abstract_inverted_index":{"Scheduling":[0],"can":[1,66,86],"require":[2],"analyzing":[3],"not":[4],"only":[5],"the":[6,15,71,126,146,152,161,164],"total":[7],"computation":[8],"time":[9,24,32,59,84,120,148,186],"of":[10,57,114,151,160,163,168,172],"a":[11,28,36,53],"task,":[12],"but":[13],"also":[14],"remaining":[16,58,83,107,184],"execution":[17,31,46,108,119,149,185],"time,":[18,109],"R(t)/sub":[19],"/spl":[20,25,61,111,136,174],"Delta/t/,":[21],"after":[22],"accumulated":[23],"Delta/t.":[26],"Often":[27],"software":[29,115],"program's":[30],"is":[33,42,63,154,187],"characterized":[34],"by":[35],"single":[37],"value":[38],"(mean).":[39],"When":[40],"scheduling":[41,80,141,179],"based":[43],"on":[44],"partial":[45],"(a":[47],"common":[48],"scenario":[49],"in":[50,75,96,181,190],"multimedia":[51],"systems)":[52],"more":[54,88,93,169],"accurate":[55,89,170],"estimation":[56],"(R(t)/sub":[60,110,135,173],"Delta/t/)":[62],"desired":[64],"than":[65],"be":[67],"obtained":[68],"from":[69,117],"just":[70],"initial":[72],"mean":[73],"value,":[74],"order":[76],"to":[77],"have":[78],"effective":[79,94],"decisions.":[81],"The":[82],"approach":[85],"provide":[87],"estimation,":[90],"and":[91,121,156],"therefore":[92],"scheduling,":[95],"time-sensitive":[97],"situations.":[98],"We":[99,143],"developed":[100],"an":[101,131],"analytical":[102],"model":[103],"for":[104,138],"computing":[105],"expected":[106],"Delta/t/)~":[112,137,175],",":[113],"programs":[116],"their":[118],"probability":[122],"distributions.":[123],"To":[124],"implement":[125],"equations,":[127],"we":[128],"further":[129],"designed":[130],"algorithm":[132,153],"that":[133,145],"computes":[134],"operating":[139],"system":[140],"applications.":[142],"proved":[144],"real":[147],"complexity":[150],"O(1)":[155],"is,":[157],"therefore,":[158],"independent":[159],"size":[162],"distribution.":[165],"Our":[166],"method":[167],"estimate":[171],"implies":[176],"expect":[177],"better":[178],"performance":[180],"applications":[182],"where":[183],"used,":[188],"especially":[189],"CPU":[191],"scheduling.":[192]},"counts_by_year":[{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}