{"id":"https://openalex.org/W6947384392","doi":"https://doi.org/10.3929/ethz-b-000725308","title":"Exploiting Graph Structure to Accelerate Sparse Computations","display_name":"Exploiting Graph Structure to Accelerate Sparse Computations","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6947384392","doi":"https://doi.org/10.3929/ethz-b-000725308"},"language":"en","primary_location":{"id":"pmh:doi:10.3929/ethz-b-000725308","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Doctoral Thesis"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11850/725308","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gianinazzi, Lukas","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gianinazzi, Lukas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.7143999934196472},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6184999942779541},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5983999967575073},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5681999921798706},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4763000011444092},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.46320000290870667},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4544000029563904},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.4375},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4350999891757965}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7940000295639038},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.7143999934196472},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6184999942779541},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5983999967575073},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5681999921798706},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5037999749183655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4959999918937683},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4763000011444092},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.46320000290870667},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4544000029563904},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.4375},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4350999891757965},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.4011000096797943},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3434000015258789},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.3100000023841858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3050999939441681},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29159998893737793},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.2612999975681305},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.3929/ethz-b-000725308","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Doctoral Thesis"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/725308","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/725308","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"doi:10.3929/ethz-b-000725308","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000725308","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/725308","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/725308","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Sparse":[0],"computations,":[1,259],"such":[2],"as":[3],"those":[4,214],"in":[5,18,38,65,94,113,148,163,170,257,266],"graph":[6,157,210],"problems":[7,17],"and":[8,24,45,54,71,86,98,107,125,131,146,188,203,225,277],"sparse":[9,31,66,88,95,114,195,219,258],"matrix":[10,89,220],"algorithms,":[11,105],"are":[12,84,92],"crucial":[13],"for":[14,78,87,122,200,263],"solving":[15],"complex":[16],"fields":[19],"like":[20],"biology,":[21],"compiler":[22],"design,":[23],"machine":[25,278],"learning.":[26,279],"However,":[27],"processing":[28],"large,":[29],"irregular":[30],"data":[32,168,273],"structures":[33,162],"efficiently":[34],"poses":[35],"significant":[36],"challenges":[37,177],"modern":[39,223],"heterogeneous":[40],"computing":[41],"environments,":[42],"where":[43,81],"scalability":[44,145],"efficiency":[46,147],"must":[47],"be":[48],"carefully":[49],"balanced.":[50],"Existing":[51],"parallel":[52,149,171],"algorithms":[53,121],"computational":[55,139],"models":[56,108],"often":[57],"fail":[58],"to":[59,69,137,159],"fully":[60],"leverage":[61],"the":[62,132,176,184,243,252,255],"inherent":[63],"structure":[64],"data,":[67],"leading":[68],"inefficiencies":[70],"limited":[72],"scalability.":[73],"This":[74,101],"is":[75],"particularly":[76],"problematic":[77],"NP-hard":[79],"problems,":[80],"worst-case":[82],"solutions":[83],"slow,":[85],"kernels,":[90],"which":[91,128,193],"bottlenecks":[93],"neural":[96],"networks":[97],"scientific":[99,275],"computations.":[100],"thesis":[102],"introduces":[103],"new":[104],"frameworks,":[106],"that":[109,212],"exploit":[110],"structural":[111],"properties":[112],"data.":[115],"Our":[116],"contributions":[117,250],"include":[118],"fixed-parameter":[119],"tractable":[120],"subgraph":[123],"isomorphism":[124],"k-clique":[126],"listing,":[127],"use":[129],"planarity":[130],"absence":[133],"of":[134,178,233,245,254],"dense":[135],"subgraphs":[136],"reduce":[138],"depth":[140],"or":[141],"work,":[142],"thus":[143],"improving":[144],"environments.":[150],"We":[151],"also":[152],"introduce":[153,183],"a":[154,238,261],"parametric":[155],"template":[156],"framework":[158],"handle":[160],"repetitive":[161],"execution":[164],"graphs":[165],"efficiently,":[166],"optimizing":[167],"movement":[169],"program":[172],"analysis.":[173],"To":[174],"address":[175],"spatial":[179,201],"dataflow":[180,240],"architectures,":[181],"we":[182,207],"Spatial":[185,189],"Computer":[186],"Model":[187,190],"with":[191,269],"Contention,":[192],"optimize":[194],"communication":[196,215,235],"patterns":[197],"by":[198],"accounting":[199],"locality":[202],"contention":[204],"costs.":[205],"Moreover,":[206],"develop":[208],"locality-optimized":[209],"layouts":[211],"minimize":[213],"costs,":[216],"enabling":[217],"scalable":[218],"operations":[221],"on":[222,237,272],"accelerators":[224],"distributed":[226],"systems.":[227],"Finally,":[228],"our":[229,246],"model-guided":[230],"experimental":[231],"evaluation":[232],"fundamental":[234],"collectives":[236],"state-of-the-art":[239],"architecture":[241],"underscores":[242],"impact":[244],"modeling.":[247],"Together,":[248],"these":[249],"advance":[251],"state":[253],"art":[256],"laying":[260],"foundation":[262],"future":[264],"advancements":[265],"high-performance":[267],"computing,":[268,276],"potential":[270],"impacts":[271],"analytics,":[274]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}