{"id":"https://openalex.org/W2990888271","doi":"https://doi.org/10.1177/1094342019888567","title":"Parallelization of the solve phase in a task-based Cholesky solver using a sequential task flow model","display_name":"Parallelization of the solve phase in a task-based Cholesky solver using a sequential task flow model","publication_year":2019,"publication_date":"2019-11-29","ids":{"openalex":"https://openalex.org/W2990888271","doi":"https://doi.org/10.1177/1094342019888567","mag":"2990888271"},"language":"en","primary_location":{"id":"doi:10.1177/1094342019888567","is_oa":false,"landing_page_url":"https://doi.org/10.1177/1094342019888567","pdf_url":null,"source":{"id":"https://openalex.org/S60606485","display_name":"The International Journal of High Performance Computing Applications","issn_l":"1094-3420","issn":["1094-3420","1741-2846"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of High Performance Computing Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://purl.org/net/epubs/work/39440019","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079368076","display_name":"S\u00e9bastien Cayrols","orcid":"https://orcid.org/0000-0003-3740-8985"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S\u00e9bastien Cayrols","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111633713","display_name":"Iain Duff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iain S Duff","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014227566","display_name":"Florent Lopez","orcid":"https://orcid.org/0000-0002-8479-5749"},"institutions":[{"id":"https://openalex.org/I1286704778","display_name":"Rutherford Appleton Laboratory","ror":"https://ror.org/03gq8fr08","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1286704778","https://openalex.org/I162524378","https://openalex.org/I4210087105"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Florent Lopez","raw_affiliation_strings":["Scientific Computing Department, STFC Rutherford Appleton Laboratory, Harwell Campus, Oxfordshire, UK"],"affiliations":[{"raw_affiliation_string":"Scientific Computing Department, STFC Rutherford Appleton Laboratory, Harwell Campus, Oxfordshire, UK","institution_ids":["https://openalex.org/I1286704778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079368076"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4446,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81724498,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":"3","first_page":"340","last_page":"356"},"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.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9819999933242798,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9029545783996582},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7991877794265747},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.796644926071167},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.7868641018867493},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.7486185431480408},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6961615085601807},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.5776023864746094},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5339601635932922},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5095562934875488},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5016555786132812},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.42607414722442627},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4108714759349823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.358764111995697},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.32845622301101685},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.2739913761615753},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.16072747111320496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1497766375541687}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9029545783996582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7991877794265747},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.796644926071167},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.7868641018867493},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.7486185431480408},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6961615085601807},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.5776023864746094},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5339601635932922},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5095562934875488},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5016555786132812},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.42607414722442627},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4108714759349823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.358764111995697},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.32845622301101685},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2739913761615753},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.16072747111320496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1497766375541687},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1177/1094342019888567","is_oa":false,"landing_page_url":"https://doi.org/10.1177/1094342019888567","pdf_url":null,"source":{"id":"https://openalex.org/S60606485","display_name":"The International Journal of High Performance Computing Applications","issn_l":"1094-3420","issn":["1094-3420","1741-2846"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of High Performance Computing Applications","raw_type":"journal-article"},{"id":"pmh:oai:purl.org/net/epubs:work/39440019","is_oa":true,"landing_page_url":"http://purl.org/net/epubs/work/39440019","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:purl.org/net/epubs:work/44673165","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/44673165","pdf_url":null,"source":{"id":"https://openalex.org/S4306400600","display_name":"ePubs (Science and Technology Facilities Council, Research Councils UK)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162524378","host_organization_name":"Science and Technology Facilities Council","host_organization_lineage":["https://openalex.org/I162524378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:purl.org/net/epubs:work/39440019","is_oa":true,"landing_page_url":"http://purl.org/net/epubs/work/39440019","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7220325705","display_name":null,"funder_award_id":"671633","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2004951603","https://openalex.org/W2013424510","https://openalex.org/W2014730252","https://openalex.org/W2019527978","https://openalex.org/W2035080386","https://openalex.org/W2052602889","https://openalex.org/W2087440962","https://openalex.org/W2087618354","https://openalex.org/W2097827306","https://openalex.org/W2121893797","https://openalex.org/W2149381887","https://openalex.org/W2729067377","https://openalex.org/W4245285511"],"related_works":["https://openalex.org/W2078637543","https://openalex.org/W2381435995","https://openalex.org/W2809896915","https://openalex.org/W1987177655","https://openalex.org/W2966631139","https://openalex.org/W1509943448","https://openalex.org/W2526784484","https://openalex.org/W2146296113","https://openalex.org/W4246966070","https://openalex.org/W2127144731"],"abstract_inverted_index":{"We":[0,205],"describe":[1],"the":[2,5,9,22,27,40,42,45,49,57,61,79,87,96,116,120,130,133,136,148,202,222],"parallelization":[3],"of":[4,24,29,192,201,221],"solve":[6,46,88,121,144,176,195],"phase":[7,74,89,122],"in":[8,75,98,109,113,119,225],"sparse":[10,31],"Cholesky":[11],"solver":[12,157],"SpLLT":[13,203],"when":[14],"using":[15,158],"a":[16,30,85,142,153,159,189,193,214,218],"sequential":[17],"task":[18],"flow":[19],"model.":[20],"In":[21,48,182],"context":[23],"direct":[25],"methods,":[26],"solution":[28],"linear":[32],"system":[33],"is":[34,68,90,123,147],"achieved":[35],"through":[36],"three":[37],"main":[38],"phases:":[39],"analyse,":[41],"factorization":[43,58,97],"and":[44,66,101,135,187],"phases.":[47],"last":[50],"two":[51],"phases,":[52],"which":[53],"involve":[54],"numerical":[55],"computation,":[56],"corresponds":[59],"to":[60,71,77,125,175],"most":[62],"computationally":[63],"costly":[64],"phase,":[65],"it":[67],"therefore":[69],"crucial":[70],"parallelize":[72],"this":[73,110,183],"order":[76],"reduce":[78],"time-to-solution":[80,224],"on":[81,213],"modern":[82],"architectures.":[83],"As":[84],"consequence,":[86],"often":[91,106],"not":[92,107],"as":[93,95],"optimized":[94],"state-of-the-art":[99],"solvers,":[100],"opportunities":[102],"for":[103,132,150,152,197],"parallelism":[104],"are":[105,166,173],"exploited":[108],"phase.":[111],"However,":[112],"some":[114,226],"applications,":[115],"time":[117,131],"spent":[118],"comparable":[124],"or":[126],"even":[127],"greater":[128],"than":[129],"factorization,":[134],"user":[137],"could":[138],"dramatically":[139],"benefit":[140],"from":[141],"faster":[143],"routine.":[145],"This":[146],"case,":[149],"example,":[151],"conjugate":[154],"gradient":[155],"(CG)":[156],"block":[160],"Jacobi":[161],"preconditioner.":[162],"The":[163],"diagonal":[164],"blocks":[165],"factorized":[167],"once":[168],"only,":[169],"but":[170],"their":[171],"factors":[172],"used":[174],"subsystems":[177],"at":[178],"each":[179],"CG":[180],"iteration.":[181],"study,":[184],"we":[185,208],"design":[186],"implement":[188],"parallel":[190],"version":[191,200],"task-based":[194],"routine":[196],"an":[198],"OpenMP":[199],"solver.":[204],"show":[206],"that":[207],"can":[209],"obtain":[210],"good":[211],"scalability":[212],"multicore":[215],"architecture":[216],"enabling":[217],"dramatic":[219],"reduction":[220],"overall":[223],"applications.":[227]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2019-12-05T00:00:00"}