{"id":"https://openalex.org/W2153144414","doi":"https://doi.org/10.1109/real.2002.1181575","title":"Embedded system design framework for minimizing code size and guaranteeing real-time requirements","display_name":"Embedded system design framework for minimizing code size and guaranteeing real-time requirements","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2153144414","doi":"https://doi.org/10.1109/real.2002.1181575","mag":"2153144414"},"language":"en","primary_location":{"id":"doi:10.1109/real.2002.1181575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/real.2002.1181575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/bitstreams/6a16da51-3dbf-4f71-9090-eb45d9cbe6c6/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077052539","display_name":"Insik Shin","orcid":"https://orcid.org/0000-0002-9128-2415"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Shin","raw_affiliation_strings":["Department of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040554924","display_name":"I. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Lee","raw_affiliation_strings":["Department of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Science, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113892530","display_name":"Sang Lyul Min","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sang Lyul Min","raw_affiliation_strings":["Schl. of Computer Science & Engineering, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Schl. of Computer Science & Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.9944000244140625,"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.9866999983787537,"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.8387294411659241},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5828149914741516},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.550557553768158},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5483688116073608},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5056979656219482},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4857249855995178},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4771506190299988},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4565022885799408},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4333125352859497},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.41849613189697266},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.41361987590789795},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.41003793478012085},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.34427937865257263},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3289271891117096},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32647544145584106},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.27364057302474976},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2578703761100769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21573147177696228},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12389722466468811},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11588260531425476}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8387294411659241},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5828149914741516},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.550557553768158},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5483688116073608},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5056979656219482},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4857249855995178},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4771506190299988},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4565022885799408},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4333125352859497},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.41849613189697266},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.41361987590789795},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.41003793478012085},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.34427937865257263},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3289271891117096},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32647544145584106},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.27364057302474976},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2578703761100769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21573147177696228},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12389722466468811},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11588260531425476},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/real.2002.1181575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/real.2002.1181575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002.","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.upenn.edu:cis_papers-1029","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/27","pdf_url":"https://repository.upenn.edu/bitstreams/6a16da51-3dbf-4f71-9090-eb45d9cbe6c6/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.2761","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.2761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~ishin/htmls/../papers/rtss02-design-size-time.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.1555","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.1555","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~ishin/papers/rtss02-design-size-time.pdf","raw_type":"text"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6309","is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6309","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Presentation"}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_papers-1029","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/27","pdf_url":"https://repository.upenn.edu/bitstreams/6a16da51-3dbf-4f71-9090-eb45d9cbe6c6/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2153144414.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1558672475","https://openalex.org/W1673886926","https://openalex.org/W1949004756","https://openalex.org/W1964712076","https://openalex.org/W2011039300","https://openalex.org/W2034751786","https://openalex.org/W2086748818","https://openalex.org/W2109488193","https://openalex.org/W2143795231","https://openalex.org/W2145132630","https://openalex.org/W2151635387","https://openalex.org/W2262960161","https://openalex.org/W4230553286"],"related_works":["https://openalex.org/W1515433387","https://openalex.org/W1484796814","https://openalex.org/W2507397068","https://openalex.org/W1663166257","https://openalex.org/W2339849594","https://openalex.org/W2119358936","https://openalex.org/W4367046720","https://openalex.org/W2579119907","https://openalex.org/W2102938079","https://openalex.org/W2002514423"],"abstract_inverted_index":{"In":[0],"addition":[1],"to":[2,58],"real-time":[3,14],"requirements,":[4],"program":[5],"code":[6,22,64,85,124],"size":[7,23,65,86,125],"is":[8,57,87,92,149],"a":[9,36,47,72,109,141,152],"critical":[10],"design":[11,37,55,90],"factor":[12],"for":[13],"embedded":[15],"systems.":[16],"To":[17],"take":[18],"advantage":[19],"of":[20,49,53,67,154],"the":[21,60,83,123,137,147,161],"vs.":[24,126],"execution":[25,127,158],"time":[26,128],"trade":[27],"off":[28],"provided":[29],"by":[30,151],"reduced":[31],"bit-width":[32],"instructions,":[33],"we":[34,107],"propose":[35],"framework":[38,56,91],"that":[39,74,113,170],"transforms":[40],"system":[41,78,84],"constraints":[42],"into":[43],"task":[44,69],"parameters":[45,62],"guaranteeing":[46],"set":[48],"requirements.":[50],"The":[51],"goal":[52],"our":[54],"derive":[59],"temporal":[61],"and":[63,175],"parameter":[66],"each":[68],"in":[70],"such":[71],"way":[73],"they":[75],"collectively":[76],"guarantee":[77],"end-to-end":[79],"timing":[80],"requirements":[81],"while":[82],"minimized.":[88],"Our":[89],"based":[93],"on":[94],"asynchronous":[95],"periodic":[96],"tasks":[97],"with":[98,179],"pre-period":[99],"deadlines":[100],"under":[101],"EDF":[102],"scheduling.":[103],"For":[104],"schedulability":[105],"analysis,":[106],"present":[108],"new":[110],"feasibility":[111],"condition":[112],"can":[114,130,171],"be":[115,131],"more":[116],"efficiently":[117],"evaluated":[118],"than":[119],"existing":[120],"ones.":[121],"When":[122],"tradeoff":[129,148],"safely":[132],"approximated":[133],"as":[134],"linear":[135,142],"functions,":[136],"minimization":[138],"problem":[139,162],"becomes":[140,163],"programming":[143],"problem.":[144],"However,":[145],"when":[146],"given":[150],"table":[153],"possible":[155],"(code":[156],"size,":[157],"time)":[159],"pairs,":[160],"NP-hard.":[164],"We":[165],"provide":[166],"three":[167],"heuristic":[168],"algorithms":[169],"find":[172],"sub-optimal":[173],"solutions":[174],"evaluate":[176],"their":[177],"performance":[178],"simulation":[180],"results.":[181]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}