Result: Parallelization of divide-and-conquer eigenvector accumulation
Title:
Parallelization of divide-and-conquer eigenvector accumulation
Authors:
Source:
Euro-Par 2005 parallel processing (Lisbon, 30 August - 2 September 2005)Lecture notes in computer science. :847-856
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Calcul réparti, Distributed computing, Cálculo repartido, Haute performance, High performance, Alto rendimiento, Modélisation, Modeling, Modelización, Méthode arborescente, Tree structured method, Método arborescente, Méthode diviser pour régner, Divide and conquer method, Método dividir para vencer, Parallélisation, Parallelization, Paralelisacíon, Performance algorithme, Algorithm performance, Resultado algoritmo, Système réparti, Distributed system, Sistema repartido
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute for Distributed and Multimedia Systems University of Vienna Lenaugasse 2/8, 1080 Vienna, Austria
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17095292
Database:
PASCAL Archive
Further Information
This paper discusses and compares several parallelization strategies for tree-structured computations. In particular, we focus on the parallelization of the eigenvector accumulation process in divide-and-conquer eigensolvers, such as the recently developed block divide-and-conquer (BD&C) eigensolver. We describe a model algorithm for evaluating the performance of several parallel variants of this accumulation process, and we develop a block parallel approach which is shown to achieve good speedup in experiments on PC clusters.