Rutherford Appleton Laboratory Technical Reports最新文献

Experiments with sparse Cholesky using a sequential task-flow implementation 实验用稀疏Cholesky实现了一个顺序任务流

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.3934/NACO.2018014

I. Duff, J. Hogg, Florent Lopez

{"title":"Experiments with sparse Cholesky using a sequential task-flow implementation","authors":"I. Duff, J. Hogg, Florent Lopez","doi":"10.3934/NACO.2018014","DOIUrl":"https://doi.org/10.3934/NACO.2018014","url":null,"abstract":"We describe the development of a prototype code for the solution of large sparse symmetric positive definite systems that is efficient on parallel architectures. We implement a DAG-based Cholesky factorization that offers good performance and scalability on multicore architectures. Our approach uses a runtime system to execute the DAG. The runtime system plays the role of a software layer between the application and the architecture and handles the management of task dependencies as well as the task scheduling. In this model, the application is expressed using a high-level API, independent of the hardware details, thus enabling portability across different architectures. Although widely used in dense linear algebra, this approach is nevertheless challenging for sparse algorithms because of the irregularity and variable granularity of the DAGs arising in these systems. We assess the ability of two different Sequential Task Flow implementations to address this challenge: one implemented with the OpenMP standard, and the other with the modern runtime system StarPU. We compare these implementations to the state-of-the-art solver HSL_MA87 and demonstrate comparable performance on a multicore architecture.","PeriodicalId":407290,"journal":{"name":"Rutherford Appleton Laboratory Technical Reports","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116839030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Pulsed magnetic fields and pulsed neutron sources 脉冲磁场和脉冲中子源

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1080/10448639708231951

Uschi Steigenberger, Keith McEwen

引用次数: 0

PARASOL an Integrated Programming Environment for Parallel Sparse Matrix Solvers 并行稀疏矩阵求解的集成编程环境

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1007/978-1-4615-4873-7_9

P. Amestoy, I. Duff, J. L’Excellent, Peter Plecháč

引用次数: 16

Sparse system solution and the HSL Library 稀疏系统解和HSL库

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1142/9789812709356_0005

I. Duff

引用次数: 6

An Introduction to Algorithms for Nonlinear Optimization 非线性优化算法导论

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1007/978-3-642-55692-0_4

N. Gould, S. Leyffer

引用次数: 38

Combinatorial problems in solving linear systems 求解线性系统中的组合问题

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1201/b11644-3

I. Duff, B. Uçar

引用次数: 15

MA62 - a frontal code for sparse positive definite symmetric systems from finite element applications MA62 -从有限元应用稀疏正定对称系统的正面代码

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.4203/csets.1.1

I. S. Duff, Jennifer A. Scott

引用次数: 10

On implicit-factorization constraint preconditioners 关于隐式分解约束前置条件

Rutherford Appleton Laboratory Technical Reports Pub Date : 1900-01-01 DOI: 10.1007/0-387-30065-1_5

H. Dollar, N. Gould, A. Wathen

引用次数: 15