20,676 research outputs found
The DUNE-ALUGrid Module
In this paper we present the new DUNE-ALUGrid module. This module contains a
major overhaul of the sources from the ALUgrid library and the binding to the
DUNE software framework. The main changes include user defined load balancing,
parallel grid construction, and an redesign of the 2d grid which can now also
be used for parallel computations. In addition many improvements have been
introduced into the code to increase the parallel efficiency and to decrease
the memory footprint.
The original ALUGrid library is widely used within the DUNE community due to
its good parallel performance for problems requiring local adaptivity and
dynamic load balancing. Therefore, this new model will benefit a number of DUNE
users. In addition we have added features to increase the range of problems for
which the grid manager can be used, for example, introducing a 3d tetrahedral
grid using a parallel newest vertex bisection algorithm for conforming grid
refinement. In this paper we will discuss the new features, extensions to the
DUNE interface, and explain for various examples how the code is used in
parallel environments.Comment: 25 pages, 11 figure
Spectral matrix methods for partitioning power grids: Applications to the Italian and Floridian high-voltage networks
Intentional islanding is used to limit cascading power failures by isolating
highly connected "islands" with local generating capacity. To efficiently
isolate an island, one should break as few power lines as possible. This is a
graph partitioning problem, and here we give preliminary results on islanding
of the Italian and Floridian high-voltage grids by spectral matrix methods.Comment: 4 pages, 2 figures
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write: "It seems that the
tree-width of a planar graph and the tree-width of its geometric dual are
approximately equal - indeed, we have convinced ourselves that they differ by
at most one". They never gave a proof of this. In this paper, we prove a
generalisation of this statement to embedding of hypergraphs on general
surfaces, and we prove that our bound is tight
A theory of the city as object: or, how spatial laws mediate the social construction of urban space
A series of recent papers (Hillier et al 1993, Hillier 1996b, Hillier 2000) have outlined a generic
process by which spatial configurations, through their effect on movement, first shape, and
then are shaped by, land use patterns and densities. The aim of this paper is to make the
spatial dimension of this process more precise. The paper begins by examining a large
number of axial maps, and finds that although there are strong cultural variations in different
regions of the world, there are also powerful invariants. The problem is to understand how
both cultural variations and invariants can arise from the spatial processes that generate cities.
The answer proposed is that socio-cultural factors generate the differences by imposing a
certain local geometry on the local construction of settlement space, while micro-economic
factors, coming more and more into play as the settlement expands, generate the invariants
Achieving High Speed CFD simulations: Optimization, Parallelization, and FPGA Acceleration for the unstructured DLR TAU Code
Today, large scale parallel simulations are fundamental tools to handle complex problems. The number of processors in current computation platforms has been recently increased and therefore it is necessary to optimize the application performance and to enhance the scalability of massively-parallel systems. In addition, new heterogeneous architectures, combining conventional processors with specific hardware, like FPGAs, to accelerate the most time consuming functions are considered as a strong alternative to boost the performance.
In this paper, the performance of the DLR TAU code is analyzed and optimized. The improvement of the code efficiency is addressed through three key activities: Optimization, parallelization and hardware acceleration. At first, a profiling analysis of the most time-consuming processes of the Reynolds Averaged Navier Stokes flow solver on a three-dimensional unstructured mesh is performed. Then, a study of the code scalability with new partitioning algorithms are tested to show the most suitable partitioning algorithms for the selected applications. Finally, a feasibility study on the application of FPGAs and GPUs for the hardware acceleration of CFD simulations is presented
- …