Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations - Tapa blanda
Resultados de la búsqueda para Balanced Partitioning of Grids and Related Graphs....
Imagen del vendedor
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Impresión bajo demandaLibrería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This thesis considers the k-BALANCED PARTITIONING problem, which is defined as follows. Find the minimum number of edges in a graph that, when cut, partition the vertices into k (almost) equally sized sets. Amongst others, the problem derives its importance from the need to distribute data within a parallel-computing architecture. In this setting we are particularly interested in 2D finite element model (FEM) simulations. We therefore model the input as a regular quadrilateral tiling of the plane. More precisely, we focus on solid grid graphs. These are finite connected subgraphs of the infinite 2D grid without holes. However we also consider other graph classes. In particular, trees often give surprising conclusions to the problem on grid graphs. We provide several efficient algorithms computing provably good solutions. For the case when k=2 (the BISECTION problem) these include methods to compute optimal as well as approximate solutions. When k can take arbitrary values we provide two kinds of approximation algorithms. First we give a method that is fast but, for practical applications, has unsatisfactory approximation ratios. Additionally we provide an algorithm computing near-optimal solutions, which however is too slow to be used in practice. We also prove that the gained tradeoff between fast runtime and good approximation factors is unavoidable. For this we provide corresponding hardness results. 218 pp. Englisch. Nº de ref. del artículo: 9783954041251
Comprar nuevo
EUR 31,35
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Balanced Partitioning of Grids and Related Graphs
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThis thesis considers the k-BALANCED PARTITIONING problem, which is defined as follows. Find the minimum number of edges in a graph that, when cut, partition the vertices into k (almost) equally sized sets. Amongst others, the pro. Nº de ref. del artículo: 146287275
Comprar nuevo
EUR 31,35
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Publicado por
Cuvillier, Cuvillier Jun 2012, 2012
ISBN 10: 3954041251
ISBN 13: 9783954041251
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Neuware -This thesis considers the k-BALANCED PARTITIONING problem, which is defined as follows. Find the minimum number of edges in a graph that, when cut, partition the vertices into k (almost) equally sized sets. Amongst others, the problem derives its importance from the need to distribute data within a parallel-computing architecture. In this setting we are particularly interested in 2D finite element model (FEM) simulations. We therefore model the input as a regular quadrilateral tiling of the plane. More precisely, we focus on solid grid graphs. These are finite connected subgraphs of the infinite 2D grid without holes. However we also consider other graph classes. In particular, trees often give surprising conclusions to the problem on grid graphs. We provide several efficient algorithms computing provably good solutions. For the case when k=2 (the BISECTION problem) these include methods to compute optimal as well as approximate solutions. When k can take arbitrary values we provide two kinds of approximation algorithms. First we give a method that is fast but, for practical applications, has unsatisfactory approximation ratios. Additionally we provide an algorithm computing near-optimal solutions, which however is too slow to be used in practice. We also prove that the gained tradeoff between fast runtime and good approximation factors is unavoidable. For this we provide corresponding hardness results.Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen 218 pp. Englisch. Nº de ref. del artículo: 9783954041251
Comprar nuevo
EUR 31,35
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This thesis considers the k-BALANCED PARTITIONING problem, which is defined as follows. Find the minimum number of edges in a graph that, when cut, partition the vertices into k (almost) equally sized sets. Amongst others, the problem derives its importance from the need to distribute data within a parallel-computing architecture. In this setting we are particularly interested in 2D finite element model (FEM) simulations. We therefore model the input as a regular quadrilateral tiling of the plane. More precisely, we focus on solid grid graphs. These are finite connected subgraphs of the infinite 2D grid without holes. However we also consider other graph classes. In particular, trees often give surprising conclusions to the problem on grid graphs. We provide several efficient algorithms computing provably good solutions. For the case when k=2 (the BISECTION problem) these include methods to compute optimal as well as approximate solutions. When k can take arbitrary values we provide two kinds of approximation algorithms. First we give a method that is fast but, for practical applications, has unsatisfactory approximation ratios. Additionally we provide an algorithm computing near-optimal solutions, which however is too slow to be used in practice. We also prove that the gained tradeoff between fast runtime and good approximation factors is unavoidable. For this we provide corresponding hardness results. Nº de ref. del artículo: 9783954041251
Comprar nuevo
EUR 31,35
Gastos de envío:
EUR 61,45
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations | Andreas Emil Feldmann | Taschenbuch | Englisch | 2012 | Cuvillier | EAN 9783954041251 | Verantwortliche Person für die EU: Cuvillier Verlag, Nonnenstieg 8, 37075 Göttingen, info[at]cuvillier[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 121577438
Comprar nuevo
EUR 28,20
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles