{"id":"https://openalex.org/W2167006593","doi":"https://doi.org/10.1109/ispass.2009.4919654","title":"SuiteSpecks and SuiteSpots: A methodology for the automatic conversion of benchmarking programs into intrinsically checkpointed assembly code","display_name":"SuiteSpecks and SuiteSpots: A methodology for the automatic conversion of benchmarking programs into intrinsically checkpointed assembly code","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2167006593","doi":"https://doi.org/10.1109/ispass.2009.4919654","mag":"2167006593"},"language":"en","primary_location":{"id":"doi:10.1109/ispass.2009.4919654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2009.4919654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Performance Analysis of Systems and Software","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/A5074441446","display_name":"Jeff Ringenberg","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeff Ringenberg","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037541525","display_name":"Trevor Mudge","orcid":"https://orcid.org/0000-0001-7845-2187"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Trevor Mudge","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074441446"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.268,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62082347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T10054","display_name":"Parallel Computing and Optimization Techniques","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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9983000159263611,"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/benchmark","display_name":"Benchmark (surveying)","score":0.9559651017189026},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.9466692209243774},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8468686938285828},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6515852212905884},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6158913373947144},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6060661673545837},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.548596978187561},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.47288861870765686},{"id":"https://openalex.org/keywords/parsec","display_name":"Parsec","score":0.4561859667301178},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4212930202484131},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14197006821632385},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11834418773651123}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.9559651017189026},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.9466692209243774},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8468686938285828},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6515852212905884},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6158913373947144},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6060661673545837},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.548596978187561},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.47288861870765686},{"id":"https://openalex.org/C44060867","wikidata":"https://www.wikidata.org/wiki/Q12129","display_name":"Parsec","level":3,"score":0.4561859667301178},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4212930202484131},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14197006821632385},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11834418773651123},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C150846664","wikidata":"https://www.wikidata.org/wiki/Q7602306","display_name":"Stars","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ispass.2009.4919654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2009.4919654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Performance Analysis of Systems and Software","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.651.2269","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.651.2269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~tnm/trev_test/papersPDF/2009.04.SuiteSpecks and SuiteSpots.A Methodology for the Automatic Conversion of Benchmarking Programs into Intrinsically Checkpointed Assembly Code_ISPASS 2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1960843492","https://openalex.org/W1966708898","https://openalex.org/W1989918304","https://openalex.org/W1994178054","https://openalex.org/W2055979713","https://openalex.org/W2098279124","https://openalex.org/W2104225326","https://openalex.org/W2109814389","https://openalex.org/W2110461774","https://openalex.org/W2112917003","https://openalex.org/W2123037616","https://openalex.org/W2131667412","https://openalex.org/W2134633067","https://openalex.org/W2150196852","https://openalex.org/W2153456949","https://openalex.org/W2158924248","https://openalex.org/W2160401437","https://openalex.org/W2160488304","https://openalex.org/W2163255067","https://openalex.org/W2168654016","https://openalex.org/W2328519038","https://openalex.org/W2537522345","https://openalex.org/W3149179768","https://openalex.org/W4239813889","https://openalex.org/W4241742433","https://openalex.org/W4246439759","https://openalex.org/W6793011382"],"related_works":["https://openalex.org/W4238897586","https://openalex.org/W435179959","https://openalex.org/W2619091065","https://openalex.org/W2059640416","https://openalex.org/W1490753184","https://openalex.org/W2284465472","https://openalex.org/W2291782699","https://openalex.org/W1993948687","https://openalex.org/W1966837078","https://openalex.org/W2625317105"],"abstract_inverted_index":{"This":[0,213],"paper":[1,70],"introduces":[2],"a":[3,28,57,81,94,102,185,195,216,235],"methodology":[4,103],"to":[5,22,43,63,122,178,223,233],"reduce":[6],"the":[7,97,127,140,160,163,179,201,228],"overall":[8,44],"simulation":[9,39,61,219],"time":[10,62,220,231],"of":[11,27,60,80,126,162,170,187,198,230],"large":[12],"benchmarking":[13,47],"suites.":[14],"Previous":[15],"work":[16,75],"shows":[17],"that":[18,90,106,111,147],"it":[19],"is":[20,104,174,192],"possible":[21],"simulate":[23],"only":[24],"small":[25],"sections":[26,79],"benchmark's":[29,82,142],"dynamic":[30],"instruction":[31],"stream":[32],"in":[33,38,50,68,120,211,218],"detail":[34],"without":[35],"sacrificing":[36],"accuracy":[37],"results":[40],"with":[41],"respect":[42],"behavior.":[45],"As":[46],"suites":[48],"increase":[49],"size,":[51],"many":[52],"such":[53],"techniques":[54,152],"still":[55,137],"require":[56,133],"great":[58],"deal":[59],"complete.":[64],"The":[65],"methods":[66],"presented":[67],"this":[69,73],"build":[71],"on":[72],"previous":[74],"by":[76],"converting":[77],"representative":[78,181],"execution":[83,143],"into":[84,215],"intrinsically":[85],"checkpointed":[86],"assembly":[87],"(ITCY)":[88],"code":[89],"can":[91,153],"serve":[92],"as":[93],"replacement":[95],"for":[96],"original":[98,141,164,180],"benchmark.":[99,165],"In":[100,183],"addition,":[101,184],"proposed":[105],"creates":[107],"new":[108,128,202,236],"benchmark":[109,191],"binaries":[110],"no":[112],"longer":[113],"need":[114],"input":[115],"files":[116],"or":[117],"system":[118],"calls":[119],"order":[121],"execute":[123],"properly.":[124],"Simulations":[125],"benchmarks":[129,148,203],"are":[130,204],"much":[131],"faster,":[132],"less":[134,171],"overhead,":[135],"and":[136,157,207,225],"properly":[138],"represent":[139],"profile.":[144],"Results":[145],"show":[146],"created":[149],"using":[150],"these":[151],"be":[154],"very":[155],"portable":[156],"accurately":[158],"predict":[159],"performance":[161],"An":[166],"average":[167],"error":[168],"rate":[169],"than":[172],"5%":[173],"achieved":[175,193],"when":[176,200,209],"compared":[177],"sections.":[182],"speedup":[186],"approximately":[188],"60times":[189],"per":[190],"over":[194],"standard":[196],"set":[197],"SimPoints":[199],"executed":[205,210],"serially":[206],"1000times":[208],"parallel.":[212],"translates":[214],"reduction":[217],"from":[221],"months":[222],"minutes":[224],"greatly":[226],"decreases":[227],"amount":[229],"necessary":[232],"test":[234],"design.":[237]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
