{"id":3920,"date":"2011-05-14T09:37:07","date_gmt":"2011-05-14T09:37:07","guid":{"rendered":"http:\/\/hgpu.org\/?p=3920"},"modified":"2011-05-14T09:37:07","modified_gmt":"2011-05-14T09:37:07","slug":"understanding-the-efficiency-of-parallel-incomplete-cholesky-preconditioners-on-the-performance-of-iccg-solvers-for-multi-core-and-gpu-systems","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=3920","title":{"rendered":"Understanding the efficiency of parallel incomplete Cholesky preconditioners on the performance of ICCG solvers for multi-core and GPU systems"},"content":{"rendered":"<p>This paper aims at understanding the effect of parallelizing incomplete Cholesky (IC) factorization on the overall performance of the incomplete Cholesky conjugate gradient (ICCG) solver method, optimized on multi-core and GPU based Systems. Parallel IC preconditioners, which are based on graph reordering and arbitrary levels of allowed fill-in, are tested on structured and unstructured matrices to study the tradeoffs between the level of fill-in, degree of IC parallelism and convergence rate of the ICCG solver.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>This paper aims at understanding the effect of parallelizing incomplete Cholesky (IC) factorization on the overall performance of the incomplete Cholesky conjugate gradient (ICCG) solver method, optimized on multi-core and GPU based Systems. Parallel IC preconditioners, which are based on graph reordering and arbitrary levels of allowed fill-in, are tested on structured and unstructured matrices [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[36,157,3],"tags":[1787,580,1796],"class_list":["post-3920","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-mathematics","category-paper","tag-algorithms","tag-conjugate-gradient-solver","tag-mathematics"],"views":1873,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/3920","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3920"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/3920\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3920"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3920"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3920"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}