Verwandte Artikel zu Balanced Partitioning of Grids and Related Graphs:...
Balanced Partitioning of Grids and Related Graphs: A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Balanced Partitioning of Grids and Related Graphs:...
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 29158727-n
Neu kaufen
EUR 33,75
EUR 2,28 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations (Paperback or Softback)
Verlag:
Cuvillier 6/7/2012, 2012
ISBN 10: 3954041251
ISBN 13: 9783954041251
Neu
Paperback or Softback
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback or Softback. Zustand: New. Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations. Book. Bestandsnummer des Verkäufers BBS-9783954041251
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 29158727
Gebraucht kaufen
EUR 34,46
EUR 2,28 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers L2-9783954041251
Neu kaufen
EUR 37,39
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers L2-9783954041251
Neu kaufen
EUR 32,87
EUR 6,86 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 29158727-n
Neu kaufen
EUR 32,86
EUR 17,53 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Balanced Partitioning of Grids and Related Graphs
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 29158727
Gebraucht kaufen
EUR 35,27
EUR 17,53 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Print-on-DemandAnbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783954041251
Neu kaufen
EUR 31,35
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Balanced Partitioning of Grids and Related Graphs
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 146287275
Neu kaufen
EUR 31,35
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Balanced Partitioning of Grids and Related Graphs. A Theoretical Study of Data Distribution in Parallel Finite Element Model Simulations
Verlag:
Cuvillier, Cuvillier Jun 2012, 2012
ISBN 10: 3954041251
ISBN 13: 9783954041251
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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. Bestandsnummer des Verkäufers 9783954041251
Neu kaufen
EUR 31,35
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar