{"id":"https://openalex.org/W54401871","doi":null,"title":"Automated memory analysis: improving the design and implementation of iterative algorithms","display_name":"Automated memory analysis: improving the design and implementation of iterative algorithms","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W54401871","mag":"54401871"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.3142","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.3142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cisl.ucar.edu/css/staff/dennis/papers/dennis_thesis.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5053602586","display_name":"John M. Dennis","orcid":"https://orcid.org/0000-0002-2119-8242","observed_orcids":["https://orcid.org/0000-0002-2119-8242"]},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John M. Dennis","raw_affiliation_strings":["University of Colorado at Boulder"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053602586"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":0.4822,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75834307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9922000169754028,"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.9922000169754028,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.007000000216066837,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/iterative-solvers","display_name":"iterative solvers","score":0.9039999842643738},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.8510000109672546},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"memory hierarchy","score":0.8080000281333923},{"id":"https://openalex.org/keywords/l1-cache","display_name":"L1 cache","score":0.9399999976158142},{"id":"https://openalex.org/keywords/sparse-linear-algebra","display_name":"sparse linear algebra","score":0.7670000195503235},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"algorithm design","score":0.5649999976158142},{"id":"https://openalex.org/keywords/performance-modeling","display_name":"performance modeling","score":0.38100001215934753}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8240086436271667},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.559785008430481},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.5487877726554871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4850310683250427},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.45678719878196716},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45636221766471863},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4289296269416809},{"id":"https://openalex.org/C57863822","wikidata":"https://www.wikidata.org/wiki/Q905488","display_name":"Flat memory model","level":4,"score":0.42028194665908813},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.40084394812583923},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.36185944080352783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20928293466567993},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.19082120060920715},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.17668116092681885}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.3142","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.3142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cisl.ucar.edu/css/staff/dennis/papers/dennis_thesis.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":91,"referenced_works":["https://openalex.org/W14303464","https://openalex.org/W39495715","https://openalex.org/W48400444","https://openalex.org/W90568776","https://openalex.org/W133977063","https://openalex.org/W142373010","https://openalex.org/W263917469","https://openalex.org/W576913577","https://openalex.org/W1207115811","https://openalex.org/W1485834366","https://openalex.org/W1498251975","https://openalex.org/W1504359855","https://openalex.org/W1506342804","https://openalex.org/W1525107379","https://openalex.org/W1555915743","https://openalex.org/W1559570204","https://openalex.org/W1575701986","https://openalex.org/W1580305488","https://openalex.org/W1590534028","https://openalex.org/W1596644655","https://openalex.org/W1596846800","https://openalex.org/W1600999335","https://openalex.org/W1601143231","https://openalex.org/W1776944688","https://openalex.org/W1964031104","https://openalex.org/W1965159829","https://openalex.org/W1977294541","https://openalex.org/W1982448885","https://openalex.org/W1987393840","https://openalex.org/W1987551307","https://openalex.org/W1990743970","https://openalex.org/W1993464114","https://openalex.org/W1998366068","https://openalex.org/W1999952620","https://openalex.org/W2004924114","https://openalex.org/W2007728761","https://openalex.org/W2021798130","https://openalex.org/W2021810545","https://openalex.org/W2029891792","https://openalex.org/W2031070610","https://openalex.org/W2038469228","https://openalex.org/W2040342412","https://openalex.org/W2040425799","https://openalex.org/W2046140068","https://openalex.org/W2057711597","https://openalex.org/W2066692739","https://openalex.org/W2070376917","https://openalex.org/W2074976694","https://openalex.org/W2076247888","https://openalex.org/W2086796296","https://openalex.org/W2087183402","https://openalex.org/W2089370129","https://openalex.org/W2094333709","https://openalex.org/W2095420020","https://openalex.org/W2098220211","https://openalex.org/W2099216749","https://openalex.org/W2103871060","https://openalex.org/W2104120668","https://openalex.org/W2104736438","https://openalex.org/W2104840748","https://openalex.org/W2106839094","https://openalex.org/W2112928979","https://openalex.org/W2112980698","https://openalex.org/W2114977680","https://openalex.org/W2115215129","https://openalex.org/W2115667390","https://openalex.org/W2117501688","https://openalex.org/W2118725377","https://openalex.org/W2118963820","https://openalex.org/W2122878128","https://openalex.org/W2125769797","https://openalex.org/W2127538310","https://openalex.org/W2130894980","https://openalex.org/W2140153041","https://openalex.org/W2143098683","https://openalex.org/W2147542748","https://openalex.org/W2150881394","https://openalex.org/W2155216327","https://openalex.org/W2155819987","https://openalex.org/W2159617380","https://openalex.org/W2164139896","https://openalex.org/W2167573667","https://openalex.org/W2176679080","https://openalex.org/W2177339763","https://openalex.org/W2316564661","https://openalex.org/W2504975061","https://openalex.org/W2541001226","https://openalex.org/W2611950219","https://openalex.org/W2803971726","https://openalex.org/W2998290295","https://openalex.org/W3142022753"],"related_works":["https://openalex.org/W7113590468","https://openalex.org/W2164718670","https://openalex.org/W2027745336","https://openalex.org/W3145286848","https://openalex.org/W7039631899","https://openalex.org/W7220821098","https://openalex.org/W7097162559","https://openalex.org/W7046743418","https://openalex.org/W2072665924","https://openalex.org/W2100799646"],"abstract_inverted_index":{"Historically,":[0],"iterative":[1,60,75,202,246],"solvers":[2],"have":[3],"been":[4],"designed":[5],"to":[6,45,49,68,119,186,192,213,223,230,255],"achieve":[7],"the":[8,23,43,52,70,78,102,131,134,171,177,183,187,211,228,233,241,257],"best":[9],"numerical":[10,53],"accuracy":[11],"for":[12,85,107,196],"a":[13,86,111,122,154,261],"given":[14],"number":[15],"of":[16,25,35,58,73,89,104,133,162,179,236,244,260],"floating-point":[17,39],"operations.":[18],"However,":[19],"this":[20],"approach":[21],"ignores":[22],"cost":[24],"memory":[26,56,71,90,95,98,126,184,215,234,258],"access,":[27],"which":[28,100],"has":[29],"not":[30],"seen":[31],"nearly":[32],"as":[33,38,148,218,220],"rapid":[34],"an":[36,59,74,245],"improvement":[37],"costs.":[40],"To":[41],"reduce":[42],"time":[44,212],"solution,":[46],"we":[47,249],"need":[48],"address":[50],"both":[51],"efficiency":[54,57,72,235,259],"and":[55,93,152,200],"algorithm.":[61,247],"We":[62,168],"contend":[63],"that":[64,115,159,164,170],"it":[65],"is":[66,110,116,128,253],"possible":[67,129],"evaluate":[69,232],"algorithm":[76],"during":[77,240],"design":[79,238,242],"process.":[80],"There":[81],"are":[82],"two":[83],"techniques":[84],"priori":[87],"evaluation":[88],"efficiency:":[91],"manual":[92],"automated":[94],"analysis.":[96],"Manual":[97],"analysis,":[99],"involves":[101],"derivation":[103],"analytical":[105],"expression":[106],"data":[108,166,180],"movement,":[109],"laborious,":[112],"error-prone":[113],"process":[114],"too":[117],"complex":[118],"perform":[120,214],"on":[121,204],"regular":[123],"basis.":[124],"Automated":[125],"analysis":[127,216],"through":[130],"use":[132],"Sparse":[135],"Linear":[136],"Algebra":[137],"Memory":[138],"Model":[139],"(SLAMM)":[140],"language":[141,145,173],"processor.":[142],"The":[143],"SLAMM":[144,172,209,226,252],"processor":[146,174],"accepts":[147],"input":[149],"Matlab":[150,157],"code":[151,163],"outputs":[153],"suitably":[155],"transformed":[156],"source":[158],"contains":[160],"blocks":[161],"predict":[165],"movement.":[167],"demonstrate":[169,250],"accurately":[175],"predicts":[176],"amount":[178],"loaded":[181],"from":[182,217],"hierarchy":[185],"L1":[188],"cache":[189],"(Mbytes":[190],"L1)":[191],"within":[193],"20%":[194],"error":[195],"numerous":[197],"small":[198],"kernels":[199],"complete":[201],"algorithms":[203],"three":[205],"different":[206],"compute":[207],"platforms.":[208],"reduces":[210],"long":[219],"several":[221],"days":[222],"20":[224],"minutes.":[225],"provides":[227],"ability":[229],"rapidly":[231],"particular":[237],"choices":[239],"phase":[243],"Additionally,":[248],"how":[251],"used":[254],"improve":[256],"pre-existing":[262],"solver.":[263]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}