检索结果-内蒙古大学图书馆

19th International Conference on Computational Science and Its Applications (ICCSA)

作者： de Oliveira, S. L. Gonzaga Abreu, A. A. A. M. Osthoff, C. Henderson Guedes de Oliveira, L. N. Univ Fed Lavras Lavras MG Brazil Inst Fed Educ Ciencia & Tecnol Santa Catarina Canoinhas SC Brazil Lab Nacl Comp Cient LNCC Petropolis RJ Brazil Univ Estado Rio de Janeiro Nova Friburgo RJ Brazil

ISBN: (纸本)9783030242893

This paper evaluates a variant of the George-Liu algorithm for finding a pseudoperipheral vertex in a graph aiming at returning a vertex having a larger eccentricity than the original algorithm. The experiments show that the Reverse Cuthill-McKee method with ordering started with vertices given by the new variant of the George-Liu algorithm yields promising results when applied to small symmetric matrices.

关键词： Pseudoperipheral vertices Reverse Cuthill-McKee method Bandwidth reduction Profile reduction reordering algorithms Graph labeling Sparse matrices Orderings

来源：评论

学校读者我要写书评

暂无评论

An Experimental Analysis of Heuristics for Profile Reduction 19th

An Experimental Analysis of Heuristics for Profile Reduction

引用

19th International Conference on Computational Science and Its Applications (ICCSA)

作者： Gonzaga de Oliveira, S. L. Osthoff, C. Henderson Guedes de Oliveira, L. N. Univ Fed Lavras Lavras MG Brazil Lab Nacl Comp Cient LNCC Petropolis RJ Brazil Univ Estado Rio de Janeiro Nova Friburgo RJ Brazil

ISBN: (纸本)9783030242893

This paper concentrates on low-cost heuristics for profile reduction. Low-cost methods for profile reduction are mainly heuristic in nature and based on graph-theoretic concepts. The contribution of this paper is twofold. Firstly, the paper includes a section involving a numerical examination of the current state-of-art metaheuristic and graph-theoretic methods for matrix profile reduction. With the support of extensive experiments, this paper shows that the metaheuristic-based algorithm is capable of reducing the profile of some matrices where the other algorithms do not perform well, but on average, the profile reduction obtained is similar for these algorithms, whereas the metaheuristicbased algorithm takes seven orders of magnitude more running time. These high execution times make the metaheuristic-based algorithm a noncontender for sparse matrix factorization and related problems. Secondly, this paper experimentally evaluates a hybrid algorithm based on the MPG and NSloan heuristics. This paper also evaluates the new hybrid heuristic for profile reduction when applied to matrices arising from two application areas against the most promising low-cost heuristics for solving the problem. The results obtained on a set of standard benchmark matrices show that the new hybrid heuristic method does not compare favorably with existing low-cost heuristics for profile reduction when applied to large-scale matrices.

关键词： Profile reduction Sparse matrices Graph labelling Combinatorial optimization Graph theory Search methods reordering algorithms Renumbering Ordering Graph algorithm Permutation of sparse matrices

来源：评论

学校读者我要写书评

暂无评论

An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

引用

COMPUTATIONAL & APPLIED MATHEMATICS 2018年第2期37卷 1412-1471页

作者： Gonzaga de Oliveira, Sanderson L. Bernardes, Junior A. B. Chagas, Guilherme O. Univ Fed Lavras Lavras Brazil

Hundreds of heuristics have been proposed to resolve the problems of bandwidth and profile reductions since the 1960s. We found 132 heuristics that have been applied to these problems in reviews of the literature. Among them, 14 were selected for which no other simulation or comparison revealed that the heuristic could be superseded by any other algorithm in the analyzed articles with respect to bandwidth or profile reduction. We also considered the computational costs of the heuristics during this process. Therefore, these 14 heuristics were selected as potentially being the best low-cost methods to solve the bandwidth and/or profile reduction problems. Results of the 14 selected heuristics are evaluated in this work. For evaluation on the set of test problems, a metric based on the relative percentage distance to the best possible bandwidth or profile is proposed. The most promising heuristics for several application areas are identified. Moreover, it was found that the FNCHC and GPS heuristics showed the best overall results in reducing the bandwidth of symmetric and asymmetric matrices among the evaluated heuristics, respectively. In addition, the NSloan and MPG heuristics showed the best overall results in reducing the profile of symmetric and asymmetric matrices among the heuristics among the evaluated heuristics, respectively.

关键词： Bandwidth reduction Profile reduction Combinatorial optimization Envelope reduction problem Heuristics Metaheuristics reordering algorithms Sparse matrices reordering algorithms Renumbering Ordering Graph labeling Bandwidth minimization

来源：评论

学校读者我要写书评

暂无评论

Finding a Starting Vertex for the Reverse Cuthill-McKee Method for Bandwidth Reduction: A Comparative Analysis Using Asymmetric Matrices 18th

Finding a Starting Vertex for the Reverse Cuthill-McKee Meth...

引用

18th International Conference on Computational Science and Its Applications (ICCSA)

作者： Gonzaga de Oliveira, Sanderson L. de Abreu, Alexandre A. A. M. Robaina, Diogo T. Kischinhevsky, Mauricio Univ Fed Lavras Lavras MG Brazil Inst Fed Educ Ciencia & Tec Santa Catarina Canoinhas SC Brazil Univ Fed Fluminense Niteroi RJ Brazil

ISBN: (纸本)9783319951621;9783319951614

The need to find pseudo-peripheral vertices arises from many methods for ordering sparse matrix equations. Several algorithms have been proposed to find proper starting vertices to be used in conjunction with heuristics for bandwidth reductions since the 1970s. This paper reviews the main algorithms for the identification of pseudo-peripheral vertices and selects seven out of these algorithms as potentially being the most promising low-cost methods for solving the problem of finding a proper pseudo-peripheral vertex in a graph. This work evaluates these seven low-cost methods. Extensive experiments among these algorithms in conjunction with the reverse Cuthill-McKee method applied to a large set of standard benchmark instances suggest that Pachl's algorithm is a suitable alternative for reducing the bandwidth of matrices with asymmetric sparsity patterns.

关键词： Bandwidth reduction Graph labeling reordering algorithms Reverse Cuthill-McKee method Sparse matrix

来源：评论

学校读者我要写书评

暂无评论

A variant of Snay's algorithm 37

A variant of Snay's algorithm

引用

37th International Conference of the Chilean-Computer-Science-Society (SCCC)

作者： Gonzaga de Oliveira, Sanderson L. Bernardes, Junior A. B. de Abreu, Alexandre A. A. M. Univ Fed Lavras Dept Ciencia Comp Lavras Brazil Inst Fed Educ Ciencia & Tecnol Santa Catarina Canoinhas Brazil

ISBN: (纸本)9781538692332

This paper presents a variant of Snay's algorithm for profile reduction of matrices. The new heuristic for profile reduction shows better results when compared with the results of several reordering algorithms with regards to reducing the computational cost of the zero-fill incomplete Cholesky-preconditioned conjugate gradient method applied to small linear systems arising from a computational fluid dynamics problem.

关键词： Sparse matrices reordering algorithms renumbering ordering graph labeling graph algorithm bandwidth reduction profile reduction numbering graph theory conjugate gradient method incomplete Cholesky factorization heat conduction equation

来源：评论

学校读者我要写书评

暂无评论

An evaluation of pseudoperipheral vertex finders for the Reverse Cuthill-McKee method for bandwidth and profile reductions of symmetric matrices 37

An evaluation of pseudoperipheral vertex finders for the Rev...

引用

37th International Conference of the Chilean-Computer-Science-Society (SCCC)

作者： Gonzaga de Oliveira, Sanderson L. de Abreu, Alexandre A. A. M. Univ Fed Lavras Dept Ciencia Comp Lavras Brazil Inst Fed Educ Ciencia & Tecnol Santa Catarina Canoinhas Brazil

ISBN: (纸本)9781538692332

Previous publications have reviewed the main algorithms for the identification of pseudoperipheral vertices in graphs. Based on this experience, this paper evaluates seven promising methods for solving the problem of finding a proper pseudoperipheral vertex in a graph. This paper analyzes these seven pseudoperipheral vertex finders along with a new variant of Kaveh's B algorithm. This paper evaluates these algorithms with the purpose of identifying proper starting vertices for the Reverse Cuthill-McKee method. Extensive experiments among these pseudoperipheral vertex finders show that the George-Liu algorithm remains in the state of the practice to provide pseudoperipheral vertices to the Reverse Cuthill-McKee method when applied to matrices with symmetric sparsity patterns.

关键词： Sparse matrices reordering algorithms renumbering ordering graph labeling Reverse Cuthill-McKee method profile reduction graph theory bandwidth reduction

来源：评论

学校读者我要写书评

暂无评论

Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers 16

Communication Characterization and Optimization of Applicati...

引用

7th ACM/SPEC International Conference on Performance Engineering (ICPE)

作者： Sreepathi, Sarat D'Azevedo, Ed Philip, Bobby Worley, Patrick Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)9781450340809

On large supercomputers, the job scheduling systems may assign a non-contiguous node allocation for user applications depending on available resources. With parallel applications using MPI (Message Passing Interface), the default process ordering does not take into account the actual physical node layout available to the application. This contributes to non-locality in terms of physical network topology and impacts communication performance of the application. In order to mitigate such performance penalties, this work describes techniques to identify suitable task mapping that takes the layout of the allocated nodes as well as the application's communication behavior into account. During the first phase of this research, we instrumented and collected performance data to characterize communication behavior of critical US DOE (United States - Department of Energy) applications using an augmented version of the mpiP tool. Subsequently, we developed several reordering methods (spectral bisection, neighbor join tree etc.) to combine node layout and application communication data for optimized task placement. We developed a tool called mpiAproxy to facilitate detailed evaluation of the various reordering algorithms without requiring full application executions. This work presents a comprehensive performance evaluation (14,000 experiments) of the various task mapping techniques in lowering communication costs on Titan, the leadership class supercomputer at Oak Ridge National Laboratory.

关键词： Communication Characterization reordering algorithms Topology-Aware Optimization

来源：评论

学校读者我要写书评

暂无评论

A systematic review of heuristics for profile reduction of symmetric matrices

A systematic review of heuristics for profile reduction of s...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Barreto Bernardes, Junior Assis Gonzaga de Oliveira, Sanderson L. Univ Fed Lavras Dept Ciencia Comp Lavras MG Brazil

In this work, a systematic review of heuristics for profile reduction of symmetric matrices is presented. 74 heuristics tested for reduction profile were found. Researchers compared results of their heuristics with results of other heuristics. In this review, these comparisons were analyzed and 8 heuristics were identified as the possible best for the problem. In addition, exchange methods, a form of local search, were identified that can benefit heuristics identified as the best ones for the task.

关键词： profile reduction combinatorial optimization envelope reduction problem graph labelling sparse matrices ordering reordering algorithms renumbering

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review

Metaheuristic-based heuristics for symmetric-matrix bandwidt...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Chagas, Guilherme Oliveira Gonzaga de Oliveira, Sanderson L. Univ Fed Lavras Lavras MG Brazil

Computational and storage costs of resolution of large sparse linear systems Ax = b can be performed by reducing the bandwidth of A. Bandwidth reduction consists of carrying out permutations of lines and columns so that they allow coefficients to remain near the main diagonal. When considering an adjacency matrix of a graph, bandwidth reduction can be considered in the sense of modifying the order in which the graph vertices are numbered. Heuristics for bandwidth reduction are revised in this study, aiming at determining which of them offers the higher bandwidth reduction with a reasonable computational cost. Specifically, metaheuristic-based heuristics are reviewed in this systematic review. Moreover, 29 metaheuristic-based heuristics tested for bandwidth reduction were found. Among them, 4 are recommended as possible state-of-the-art heuristics for addressing the problem.

关键词： Bandwidth reduction metaheuristics sparse matrices reordering algorithms renumbering

来源：评论

学校读者我要写书评

暂无评论

Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction: A Systematic Review

引用

Procedia Computer Science 2015年 51卷 211-220页

作者： Guilherme Oliveira Chagas Sanderson L. Gonzaga de Oliveira Universidade Federal de Lavras Lavras Minas Gerais Brazil

Computational and storage costs of resolution of large sparse linear systems Ax = b can be performed by reducing the bandwidth of A . Bandwidth reduction consists of carrying out permutations of lines and columns so that they allow coefficients to remain near the main diagonal. When considering an adjacency matrix of a graph, bandwidth reduction can be considered in the sense of modifying the order in which the graph vertices are numbered. Heuristics for bandwidth reduction are revised in this study, aiming at determining which of them offers the higher bandwidth reduction with a reasonable computational cost. Specifically, metaheuristic-based heuristics are reviewed in this systematic review. Moreover, 29 metaheuristic-based heuristics tested for bandwidth reduction were found. Among them, 4 are recommended as possible state-of-the-art heuristics for addressing the problem.

关键词： Bandwidth reduction Metaheuristics Sparse matrices reordering algorithms Renumbering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：