检索结果-南通市图书馆

Intel^(■) Math Kernel Library PARDISO* forIntel^(■) Xeon Phi^(TM) Manycore Coprocessor

Applied Mathematics 2015年第8期6卷 1276-1281页

作者： Alexander Kalinkin Anton anders roman anders Intel Corporation Software and Services Group (SSG) Novosibirsk Russia

The paper describes an efficient direct method to solve an equation Ax = b, where A is a sparse matrix, on the Intel®Xeon PhiTM coprocessor. The main challenge for such a system is how to engage all available threads (about 240) and how to reduce OpenMP* synchronization overhead, which is very expensive for hundreds of threads. The method consists of decomposing A into a product of lower-triangular, diagonal, and upper triangular matrices followed by solves of the resulting three subsystems. The main idea is based on the hybrid parallel algorithm used in the Intel®Math Kernel Library Parallel Direct Sparse Solver for Clusters [1]. Our implementation exploits a static scheduling algorithm during the factorization step to reduce OpenMP synchronization overhead. To effectively engage all available threads, a three-level approach of parallelization is used. Furthermore, we demonstrate that our implementation can perform up to 100 times better on factorization step and up to 65 times better in terms of overall performance on the 240 threads of the Intel®Xeon PhiTM coprocessor.

关键词： Multifrontal Method Direct Method Sparse Linear System HPC OpenMP* Intel^(■) MKL Intel^(■) Xeon Phi^(TM) Coprocessor

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Schur Complement Computations in Intel^(■) Math Kernel Library PARDISO

引用

Applied Mathematics 2015年第2期6卷 304-311页

作者： Alexander Kalinkin Anton anders roman anders Intel Corporation Software and Services Group(SSG)NovosibirskRussia

This paper describes a method of calculating the Schur complement of a sparse positive definite matrix A. The main idea of this approach is to represent matrix A in the form of an elimination tree using a reordering algorithm like METIS and putting columns/rows for which the Schur complement is needed into the top node of the elimination tree. Any problem with a degenerate part of the initial matrix can be resolved with the help of iterative refinement. The proposed approach is close to the “multifrontal” one which was implemented by Ian Duff and others in 1980s. Schur complement computations described in this paper are available in Intel®Math Kernel Library (Intel®MKL). In this paper we present the algorithm for Schur complement computations, experiments that demonstrate a negligible increase in the number of elements in the factored matrix, and comparison with existing alternatives.

关键词： Multifrontal Method Direct Method Sparse Linear System Schur Complement HPC Intel^(■) MKL

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

血管性认知损害诊断的进一步规范化：血管性认知损害分类共识研究组指南

引用

国际脑血管病杂志 2018年第4期26卷 241-250页

作者： Olivia A. Skrobot Sandra E. Black Christopher Chen Charles DeCarli Timo Erkinjuntti Gary A. Ford Rajesh N. Kalaria John O'Brien Leonardo Pantoni Florence Pasquier Gustavo C. roman anders Wallin Perminder Sachdev Ingmar Skoog the VICCCS group Yoav Ben-Shlomo Anthony P. Passmore Seth Love Patrick G. Kehoe 朱婷珂徐俊 Translational Health Sciences University of Bristol Bristol UK Sunnybrook Research Institute University of Toronto Ontario Canada Department of Pharmacology National University of Singapore Singapore Department of Neurology and Center for Neuroscience University of California at Davis Sacramento California USA Neurology University of Helsinki and Helsinki University Hospital Helsinki Finland Divison of Medical Sciences Oxford University Oxford UK Institute of Neuroscience Newcastle University Newcastle UK Department of Psychiatry University of Cambridge School of Clinical Medicine Cambridge UK NEUROFARBA Department University of FlorenceFlorence Italy Inserm U1171 University of Lille Lille France Methodist Neurological Institute Houston Texas USA Memory Clinic at Department of Neuropsychiatry Sahlgrenska University Hospital Molndal Sweden Institute of Neuroscience and Physiology Sahlgrenska AcademyUniversity of Gothenburg Sweden School of Psychiatry University of New South WalesSydney Australia Neuropsychiatric Institute Prince of Wales Hospital Randwick New South WalesAustralia Population Health Sciences University of Bristol Bristol UK Institute of Institute of Clinical Sciences Block B Queens University Belfast Belfast UK 116044 大连医科大学 116044 苏北人民医院神经内科扬州225001 首都医科大学附属北京天坛医院神经内科北京100069

引言血管性认知损害（vascular cognitive impairment,VCI）诊断共识的缺乏（体现为多种不同评估方案的使用）,妨碍了对其理解和治疗的推进.多个国家的大量临床医生和研究人员参与了2个阶段血管性认知损害分类共识研究（Vascular Impair... 详细信息

引言血管性认知损害（vascular cognitive impairment,VCI）诊断共识的缺乏（体现为多种不同评估方案的使用）,妨碍了对其理解和治疗的推进.多个国家的大量临床医生和研究人员参与了2个阶段血管性认知损害分类共识研究（Vascular Impairment of Cognition Classification Consensus Study,VICCCS）,旨在就VCI的诊断原则（VICCCS-1）和诊断方案（VICCCS-2）达成一致意见.本文提供了VICCCS-2的相关内容.方法使用VICCCS-1达成的原则和已发表的诊断指南作为在线德尔菲（Delphi）调查的参考基点,以期对VCI的临床诊断达成共识.结果共进行了6轮调查,每轮有65～79名专家参与,他们就VICCCS修订的轻度和重度VCI的诊断指南达成共识,并肯定了美国国立神经疾病与卒中研究所-加拿大卒中网（National Institute of Neurological Disorders and Stroke–Canadian Stroke Network,NINDS-CSN）发布的神经心理学评估方案和对影像学检查的推荐意见.讨论VICCCS-2建议规范化应用NINDS-CSN推荐的神经心理学和影像学评估方案诊断VCI,以促进研究协作.

关键词：血管性认知损害血管性痴呆指南标准共识德尔菲法

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：