{"id":"https://openalex.org/W7014200982","doi":null,"title":"Ordering schemes for sparse matrices using modern programming \\nparadigms","display_name":"Ordering schemes for sparse matrices using modern programming \\nparadigms","alternate_titles":[],"publication_year":2000,"publication_date":"2000-11-18","ids":{"openalex":"https://openalex.org/W7014200982"},"language":"en","primary_location":{"id":"pmh:qt4pc9n42t","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/4pc9n42t","pdf_url":"https://escholarship.org/content/qt4pc9n42t/qt4pc9n42t.pdf?t=lnoqw1","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Oliker, Leonid; Li, Xiaoye; Husbands, Parry; &amp; Biswas, Rupak. (2000). Ordering schemes for sparse matrices using modern programming \\nparadigms. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/4pc9n42t","raw_type":"article"},"parent_works":[],"lineage":["https://openalex.org/W7014200982"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt4pc9n42t/qt4pc9n42t.pdf?t=lnoqw1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Oliker, Leonid","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oliker, Leonid","raw_affiliation_strings":["Berkeley National Laboratory NASA Ames Research Center One Cyclotron Rd , Mail Stop 50B-2239 Mail Stop T27A-1 Berkeley , CA 94720 USA Moett Field CA 94035 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Berkeley National Laboratory NASA Ames Research Center One Cyclotron Rd , Mail Stop 50B-2239 Mail Stop T27A-1 Berkeley , CA 94720 USA Moett Field CA 94035 USA","institution_ids":["https://openalex.org/I1280536761"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Li, Xiaoye","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li, Xiaoye","raw_affiliation_strings":["Berkeley National Laboratory NASA Ames Research Center One Cyclotron Rd , Mail Stop 50B-2239 Mail Stop T27A-1 Berkeley , CA 94720 USA Moett Field CA 94035 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Berkeley National Laboratory NASA Ames Research Center One Cyclotron Rd , Mail Stop 50B-2239 Mail Stop T27A-1 Berkeley , CA 94720 USA Moett Field CA 94035 USA","institution_ids":["https://openalex.org/I1280536761"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033402901","display_name":"Parry Husbands","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Husbands, Parry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Biswas, Rupak","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Biswas, Rupak","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"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_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.8765000104904175,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.8765000104904175,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.12229999899864197,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.00019999999494757503,"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/sparse-matrix-reordering","display_name":"sparse matrix reordering","score":0.8289999961853027},{"id":"https://openalex.org/keywords/sparse-linear-systems","display_name":"sparse linear systems","score":0.6959999799728394},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"conjugate gradient method","score":0.8859999775886536},{"id":"https://openalex.org/keywords/preconditioned-conjugate-gradient-method","display_name":"preconditioned conjugate gradient","score":0.9670000076293945},{"id":"https://openalex.org/keywords/hybrid-mpi-openmp","display_name":"hybrid MPI/OpenMP","score":0.7860000133514404},{"id":"https://openalex.org/keywords/ibm-sp","display_name":"IBM SP","score":0.6100000143051147},{"id":"https://openalex.org/keywords/ill-conditioned-linear-systems","display_name":"ill-conditioned linear systems","score":0.7110000252723694},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.3880000114440918},{"id":"https://openalex.org/keywords/programming-paradigms","display_name":"programming paradigms","score":0.6240000128746033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7354999780654907},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.6575000286102295},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6550999879837036},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6146000027656555},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5932999849319458},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.5095000267028809},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4916999936103821},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4498000144958496},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4372999966144562},{"id":"https://openalex.org/C70388272","wikidata":"https://www.wikidata.org/wiki/Q5968558","display_name":"IBM","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C54219892","wikidata":"https://www.wikidata.org/wiki/Q4080929","display_name":"Matrix-free methods","level":4,"score":0.28029999136924744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2797999978065491},{"id":"https://openalex.org/C123213974","wikidata":"https://www.wikidata.org/wiki/Q833089","display_name":"LU decomposition","level":4,"score":0.2759000062942505},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.25850000977516174},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2556000053882599}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:qt4pc9n42t","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/4pc9n42t","pdf_url":"https://escholarship.org/content/qt4pc9n42t/qt4pc9n42t.pdf?t=lnoqw1","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Oliker, Leonid; Li, Xiaoye; Husbands, Parry; &amp; Biswas, Rupak. (2000). Ordering schemes for sparse matrices using modern programming \\nparadigms. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/4pc9n42t","raw_type":"article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt4pc9n42t","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/4pc9n42t","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"pmh:qt4pc9n42t","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/4pc9n42t","pdf_url":"https://escholarship.org/content/qt4pc9n42t/qt4pc9n42t.pdf?t=lnoqw1","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Oliker, Leonid; Li, Xiaoye; Husbands, Parry; &amp; Biswas, Rupak. (2000). Ordering schemes for sparse matrices using modern programming \\nparadigms. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/4pc9n42t","raw_type":"article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7014200982.pdf","grobid_xml":"https://content.openalex.org/works/W7014200982.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1507741241","https://openalex.org/W1588430211","https://openalex.org/W2005923302","https://openalex.org/W2070232376","https://openalex.org/W2095420020","https://openalex.org/W2129412583","https://openalex.org/W2155819987","https://openalex.org/W4244621175"],"related_works":["https://openalex.org/W1598936701","https://openalex.org/W1971343078","https://openalex.org/W7014168445","https://openalex.org/W1588430211","https://openalex.org/W1601533222","https://openalex.org/W4389317258","https://openalex.org/W2504824111","https://openalex.org/W2751923936","https://openalex.org/W2085789510"],"abstract_inverted_index":{"The":[0],"Conjugate":[1],"Gradient":[2],"(CG)":[3],"algorithm":[4,64],"is":[5,93,135],"perhaps":[6],"the":[7,27,36,62,66,72,111,117,121,133,138,143,151,168],"best-known":[8],"iterative":[9],"technique":[10],"to":[11,51,83,96,167],"solve":[12],"sparse":[13],"linear":[14,90],"systems":[15],"that":[16,71,116],"are":[17],"symmetric":[18],"and":[19,32,44,69,114],"positive":[20],"definite.":[21],"In":[22],"previous":[23],"work,":[24],"we":[25,56],"investigated":[26],"effects":[28],"of":[29,38,61,120,132,153,170],"various":[30],"ordering":[31,119],"partitioning":[33],"strategies":[34],"on":[35,65,137],"performance":[37,80],"CG":[39,63,108],"using":[40,110],"different":[41],"programming":[42,76],"paradigms":[43],"architectures.":[45],"This":[46],"paper":[47],"makes":[48],"several":[49],"extensions":[50],"our":[52],"prior":[53],"research.":[54],"First,":[55],"present":[57,102],"a":[58,84,98,129],"hybrid(MPI+OpenMP)":[59],"implementation":[60,147],"IBM":[67],"SP":[68],"show":[70,115],"hybrid":[73],"paradigm":[74],"increases":[75],"complexity":[77],"with":[78],"little":[79],"gains":[81],"compared":[82],"pure":[85],"MPI":[86,103],"implementation.":[87],"For":[88],"ill-conditioned":[89],"systems,":[91],"it":[92],"often":[94],"necessary":[95],"use":[97],"preconditioning":[99],"technique.":[100],"We":[101],"results":[104],"for":[105],"ILU(0)":[106],"preconditioned":[107],"(PCG)":[109],"BlockSolve95":[112],"library,":[113],"initial":[118],"input":[122],"matrix":[123],"dramatically":[124],"affect":[125],"PCG's":[126],"performance.":[127],"Finally,":[128],"multithreaded":[130],"version":[131],"PCG":[134],"developed":[136],"Cray":[139],"(Tera)":[140],"MTA.":[141],"Unlike":[142],"message-passing":[144],"version,":[145],"this":[146],"did":[148],"not":[149],"require":[150],"complexities":[152],"special":[154],"orderings":[155],"or":[156],"graph":[157],"dependency":[158],"analysis.":[159],"However,":[160],"only":[161],"limited":[162],"scalability":[163],"was":[164],"achieved":[165],"due":[166],"lack":[169],"available":[171],"thread":[172],"level":[173],"parallelism.":[174]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7014200982","counts_by_year":[],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2025-10-10T00:00:00"}
