{"id":"https://openalex.org/W2020919630","doi":"https://doi.org/10.1145/1065944.1065965","title":"Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications","display_name":"Extracting SMP parallelism for dense linear algebra algorithms from high-level specifications","publication_year":2005,"publication_date":"2005-06-15","ids":{"openalex":"https://openalex.org/W2020919630","doi":"https://doi.org/10.1145/1065944.1065965","mag":"2020919630"},"language":"en","primary_location":{"id":"doi:10.1145/1065944.1065965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","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/A5019607600","display_name":"Tze Meng Low","orcid":"https://orcid.org/0000-0002-5179-8249"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tze Meng Low","raw_affiliation_strings":["University of Texas at Austin, Austin, TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061722569","display_name":"Robert A. Geijn","orcid":"https://orcid.org/0009-0004-6434-8492"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert A. van de Geijn","raw_affiliation_strings":["University of Texas at Austin, Austin, TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035211620","display_name":"Field G. Zee","orcid":"https://orcid.org/0009-0007-2498-9430"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Field G. Van Zee","raw_affiliation_strings":["University of Texas at Austin, Austin, TX"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019607600"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.7701,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73318989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"163"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9948999881744385,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.7837775945663452},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6223351359367371},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5827215313911438},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5607910752296448},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5481094717979431},{"id":"https://openalex.org/keywords/linear-algebra","display_name":"Linear algebra","score":0.5271477699279785},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5061942934989929},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4515126049518585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44730326533317566},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4299091696739197},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42887192964553833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34539392590522766},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12903562188148499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12305745482444763}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7837775945663452},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6223351359367371},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5827215313911438},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5607910752296448},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5481094717979431},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.5271477699279785},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5061942934989929},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4515126049518585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44730326533317566},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4299091696739197},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42887192964553833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34539392590522766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12903562188148499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12305745482444763},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1065944.1065965","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310620","display_name":"University of Texas at Austin","ror":"https://ror.org/00hj54h04"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1589918049","https://openalex.org/W1969152955","https://openalex.org/W1973305402","https://openalex.org/W2002257715","https://openalex.org/W2019592888","https://openalex.org/W2044997049","https://openalex.org/W2047656763","https://openalex.org/W2086794688","https://openalex.org/W2109098465","https://openalex.org/W2116176472"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2372895815","https://openalex.org/W2167833628","https://openalex.org/W2349474539","https://openalex.org/W24774503","https://openalex.org/W2366583813","https://openalex.org/W2045183646","https://openalex.org/W4281622723"],"abstract_inverted_index":{"We":[0,70],"show":[1,71],"how":[2,72],"to":[3,47,86,101,104],"exploit":[4],"high-level":[5,74],"information,":[6],"available":[7],"as":[8],"part":[9],"of":[10,13,43,53,58,76,90,126],"the":[11,40,44,48,51,56,73,77,88,108,123,142],"derivation":[12],"provably":[14],"correct":[15,64],"algorithms,":[16],"so":[17],"that":[18,29],"SMP":[19],"parallelism":[20],"can":[21,35,66,83],"be":[22,36,67,84,102],"systematically":[23,37,68],"identified.":[24],"Recent":[25],"research":[26],"has":[27],"shown":[28],"loop-based":[30],"dense":[31],"linear":[32],"algebra":[33],"algorithms":[34,109],"derived":[38],"from":[39,62],"mathematical":[41],"specification":[42,75],"operation.":[45,146],"Fundamental":[46],"methodology":[49],"is":[50,121,130],"determination":[52],"loop-invariants":[54,82],"(in":[55],"sense":[57],"Dijkstra":[59],"and":[60,106],"Hoare)":[61],"which":[63],"loops":[65],"derived.":[69],"operation":[78],"together":[79],"with":[80],"these":[81],"exploited":[85],"detect":[87],"independence":[89],"loop":[91],"iterations.":[92],"This":[93],"in":[94],"turn":[95],"then":[96],"allows":[97],"a":[98,111,133,139],"Workqueuing":[99],"Model":[100],"used":[103],"implement":[105],"parallelize":[107],"using":[110],"feature":[112,125],"proposed":[113],"for":[114,138],"OpenMP":[115],"3.0,":[116],"task":[117],"queues.":[118],"Although":[119],"performance":[120,129],"not":[122],"main":[124],"this":[127],"paper,":[128],"reported":[131],"on":[132],"4":[134],"CPU":[135],"Itanium2":[136],"server":[137],"concrete":[140],"example,":[141],"symmetric":[143],"rank-k":[144],"update":[145]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}