{"id":"https://openalex.org/W2124800121","doi":"https://doi.org/10.1109/icvd.2000.812661","title":"Clock selection for performance optimization of control-flow intensive behaviors","display_name":"Clock selection for performance optimization of control-flow intensive behaviors","publication_year":2002,"publication_date":"2002-11-07","ids":{"openalex":"https://openalex.org/W2124800121","doi":"https://doi.org/10.1109/icvd.2000.812661","mag":"2124800121"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icvd.2000.812661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5077269784","display_name":"K.S. Khouri","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.S. Khouri","raw_affiliation_strings":["Dept. of Electr. Eng., Princeton Univ., NJ, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electr. Eng., Princeton Univ., NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086131079","display_name":"Niraj K. Jha","orcid":"https://orcid.org/0000-0002-1539-0369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N.K. Jha","raw_affiliation_strings":["Electrical Engineering"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":57},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Software Verification and Control","score":0.9996,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Software Verification and Control","score":0.9996,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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":"Reconfigurable Computing Systems and Design Methods","score":0.9988,"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/T10933","display_name":"Real-Time Scheduling in Embedded Systems","score":0.9968,"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/timing-analysis","display_name":"Timing Analysis","score":0.612705},{"id":"https://openalex.org/keywords/scheduling-algorithms","display_name":"Scheduling Algorithms","score":0.578606},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor Scheduling","score":0.542774},{"id":"https://openalex.org/keywords/control-barrier-functions","display_name":"Control Barrier Functions","score":0.51058},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource Allocation","score":0.507524},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.41631293}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74341965},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6291516},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.54363775},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.54196405},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5306258},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.512592},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.48968485},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4533408},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.44800267},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.41631293},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.121189296},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09572762},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icvd.2000.812661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":25,"referenced_works":["https://openalex.org/W1555915743","https://openalex.org/W2020339026","https://openalex.org/W2033710438","https://openalex.org/W2035072715","https://openalex.org/W2067125172","https://openalex.org/W2100882463","https://openalex.org/W2101374363","https://openalex.org/W2104359692","https://openalex.org/W2118052680","https://openalex.org/W2118371855","https://openalex.org/W2119228704","https://openalex.org/W2136097861","https://openalex.org/W2145021036","https://openalex.org/W2150541449","https://openalex.org/W2151867075","https://openalex.org/W2162109720","https://openalex.org/W2164356936","https://openalex.org/W2165014270","https://openalex.org/W3144599787","https://openalex.org/W4231962551","https://openalex.org/W4236550647","https://openalex.org/W4238549726","https://openalex.org/W4244937560","https://openalex.org/W4246977621","https://openalex.org/W4255969660"],"related_works":["https://openalex.org/W609318495","https://openalex.org/W3207760230","https://openalex.org/W2386584920","https://openalex.org/W2379237800","https://openalex.org/W2376229137","https://openalex.org/W2363460986","https://openalex.org/W2262854793","https://openalex.org/W17155033","https://openalex.org/W1501193936","https://openalex.org/W1496222301"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,102,153,173],"clock":[4,62,91,97,115,179,185],"selection":[5,98],"algorithm":[6,33,151,167,194],"for":[7,88],"control-flow":[8],"intensive":[9],"behaviors":[10,143],"that":[11,73,107,140,165,192],"are":[12,26],"characterized":[13],"by":[14],"the":[15,35,60,66,69,74,96,126,129,133,138,183,193],"presence":[16],"of":[17,37,68,76,128,146,155,162,171,176],"conditionals":[18],"and":[19,40,54,64,71,119],"deeply-nested":[20],"loops.":[21],"Unlike":[22],"previous":[23],"works,":[24],"which":[25,100,182],"primarily":[27],"geared":[28],"rewards":[29],"data-dominated":[30],"behaviors,":[31],"this":[32],"examines":[34],"effects":[36],"branch":[38,52,117],"probabilities":[39,53],"their":[41],"interaction":[42,75],"with":[43],"allocation":[44,56],"constraints.":[45,200],"We":[46,93,148],"demonstrate,":[47],"using":[48,152],"examples,":[49],"how":[50],"changing":[51],"resource":[55,120,199],"can":[57,195],"dramatically":[58],"affect":[59],"optimal":[61,90,184],"period,":[63],"hence,":[65],"performance":[67,127,177],"schedule,":[70],"show":[72],"these":[77],"two":[78],"factors":[79],"must":[80],"also":[81],"be":[82],"taken":[83],"into":[84],"account":[85],"when":[86],"searching":[87],"an":[89],"period.":[92],"then":[94],"introduce":[95],"algorithm,":[99],"employs":[101],"fast":[103],"critical-path":[104],"analysis":[105],"engine":[106],"allows":[108],"it":[109],"to":[110,197],"evaluate":[111],"what":[112],"effect":[113],"different":[114],"periods,":[116,180],"probabilities,":[118],"allocations":[121],"may":[122],"ultimately":[123],"have":[124],"on":[125],"behavior.":[130],"When":[131],"evaluating":[132],"critical":[134],"path,":[135],"we":[136],"exploit":[137],"fact":[139],"our":[141,150,166],"target":[142],"exhibit":[144],"locality":[145],"execution.":[147],"tested":[149],"number":[154],"benchmarks":[156],"from":[157],"various":[158],"sources.":[159],"A":[160],"series":[161],"experiments":[163],"demonstrates":[164,191],"is":[168],"quickly":[169],"capable":[170],"selecting":[172],"small":[174],"set":[175],"enhancing":[178],"among":[181],"period":[186],"typically":[187],"lies.":[188],"Another":[189],"experiment":[190],"adapt":[196],"varying":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2124800121","counts_by_year":[],"updated_date":"2024-09-19T22:06:00.889306","created_date":"2016-06-24"}
