{"id":"https://openalex.org/W4230832048","doi":"https://doi.org/10.1109/iccad.2015.7372642","title":"Graph-based dynamic analysis: Efficient characterization of dynamic timing and activity distributions","display_name":"Graph-based dynamic analysis: Efficient characterization of dynamic timing and activity distributions","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W4230832048","doi":"https://doi.org/10.1109/iccad.2015.7372642"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2015.7372642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2015.7372642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5059511378","display_name":"Hari Cherupalli","orcid":"https://orcid.org/0009-0009-8365-7000"},"institutions":[{"id":"https://openalex.org/I2800403580","display_name":"University of Minnesota System","ror":"https://ror.org/03grvy078","country_code":"US","type":"education","lineage":["https://openalex.org/I2800403580"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hari Cherupalli","raw_affiliation_strings":["University of Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota","institution_ids":["https://openalex.org/I2800403580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046254855","display_name":"John Sartori","orcid":"https://orcid.org/0000-0002-3467-9862"},"institutions":[{"id":"https://openalex.org/I2800403580","display_name":"University of Minnesota System","ror":"https://ror.org/03grvy078","country_code":"US","type":"education","lineage":["https://openalex.org/I2800403580"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Sartori","raw_affiliation_strings":["University of Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Minnesota","institution_ids":["https://openalex.org/I2800403580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2800403580"],"apc_list":null,"apc_paid":null,"fwci":0.8164,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.70887065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":null,"first_page":"729","last_page":"735"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8316382169723511},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7825190424919128},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.7164778709411621},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.715426504611969},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5407356023788452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4656335413455963},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3747694790363312},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3648560047149658},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18756771087646484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15555602312088013},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.083189457654953}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8316382169723511},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7825190424919128},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.7164778709411621},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.715426504611969},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5407356023788452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4656335413455963},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3747694790363312},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3648560047149658},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18756771087646484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15555602312088013},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.083189457654953}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2015.7372642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2015.7372642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8899999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1966741973","https://openalex.org/W1988869129","https://openalex.org/W2009523258","https://openalex.org/W2044409420","https://openalex.org/W2059774354","https://openalex.org/W2066999924","https://openalex.org/W2082568343","https://openalex.org/W2094544274","https://openalex.org/W2098339342","https://openalex.org/W2100995829","https://openalex.org/W2147449395","https://openalex.org/W2150283124","https://openalex.org/W2156770737","https://openalex.org/W2157204696","https://openalex.org/W2160859600","https://openalex.org/W2161712687","https://openalex.org/W2163262735","https://openalex.org/W2163421219","https://openalex.org/W4245013765"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787","https://openalex.org/W1875930651","https://openalex.org/W4401278057"],"abstract_inverted_index":{"In":[0,62],"light":[1],"of":[2,50,78,102,112,143,154],"increasing":[3],"energy":[4],"overheads":[5],"required":[6],"to":[7,44,74],"guarantee":[8],"correctness":[9],"as":[10],"variations":[11],"increase":[12],"with":[13],"continued":[14],"technology":[15],"scaling,":[16],"better-than-worst-case":[17],"(BTWC)":[18],"design":[19,27,38],"has":[20,117],"become":[21],"a":[22,37,51,55,60,92,103,106,140],"hot":[23],"topic.":[24],"Several":[25],"BTWC":[26],"techniques":[28,69],"utilize":[29],"dynamic":[30,47,97],"information":[31],"like":[32],"path":[33],"activity":[34,100],"when":[35],"optimizing":[36],"and":[39,57,83,99,121],"rely":[40],"on":[41,54,105],"path-based":[42,68,113,125],"analysis":[43,101,131],"determine":[45],"the":[46,75,110,152],"slack":[48],"distribution":[49],"workload":[52,104],"running":[53],"processor":[56,107],"subsequently":[58],"optimize":[59],"design.":[61],"this":[63],"paper,":[64],"we":[65,128],"show":[66],"that":[67,108,150],"are":[70],"not":[71],"scalable,":[72],"due":[73],"enormous":[76],"number":[77],"paths":[79],"in":[80,87,139],"modern":[81],"designs,":[82],"can":[84,129],"also":[85,146],"result":[86],"incorrect":[88],"results.":[89],"We":[90,145],"propose":[91,147],"graph-based":[93],"technique":[94],"for":[95,132],"performing":[96],"timing":[98],"addresses":[109],"limitations":[111],"techniques.":[114],"Our":[115],"tool":[116],"significantly":[118],"lower":[119],"runtime":[120],"memory":[122],"requirements":[123],"than":[124],"tools.":[126],"Consequently,":[127],"perform":[130],"larger":[133],"designs":[134],"over":[135],"longer":[136],"time":[137],"windows":[138],"shorter":[141],"amount":[142],"time.":[144],"two":[148],"optimizations":[149],"improve":[151],"performance":[153],"our":[155],"tool.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}