51 research outputs found
Star Structure Connectivity of Folded hypercubes and Augmented cubes
The connectivity is an important parameter to evaluate the robustness of a
network. As a generalization, structure connectivity and substructure
connectivity of graphs were proposed. For connected graphs and , the
-structure connectivity (resp. -substructure connectivity
) of is the minimum cardinality of a set of subgraphs
of that each is isomorphic to (resp. to a connected subgraph of ) so
that is disconnected or the singleton. As popular variants of hypercubes,
the -dimensional folded hypercubes and augmented cubes are
attractive interconnected network prototypes for multiple processor systems. In
this paper, we obtain that
for , , and
for
Computational methods and software systems for dynamics and control of large space structures
Two key areas of crucial importance to the computer-based simulation of large space structures are discussed. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area involves massively parallel computers
Fully Retroactive Approximate Range and Nearest Neighbor Searching
We describe fully retroactive dynamic data structures for approximate range
reporting and approximate nearest neighbor reporting. We show how to maintain,
for any positive constant , a set of points in indexed by time
such that we can perform insertions or deletions at any point in the timeline
in amortized time. We support, for any small constant ,
-approximate range reporting queries at any point in the timeline
in time, where is the output size. We also show how to
answer -approximate nearest neighbor queries for any point in the
past or present in time.Comment: 24 pages, 4 figures. To appear at the 22nd International Symposium on
Algorithms and Computation (ISAAC 2011
Computational methods and software systems for dynamics and control of large space structures
This final report on computational methods and software systems for dynamics and control of large space structures covers progress to date, projected developments in the final months of the grant, and conclusions. Pertinent reports and papers that have not appeared in scientific journals (or have not yet appeared in final form) are enclosed. The grant has supported research in two key areas of crucial importance to the computer-based simulation of large space structure. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area, as reported here, involves massively parallel computers
Probabilistic structural mechanics research for parallel processing computers
Aerospace structures and spacecraft are a complex assemblage of structural components that are subjected to a variety of complex, cyclic, and transient loading conditions. Significant modeling uncertainties are present in these structures, in addition to the inherent randomness of material properties and loads. To properly account for these uncertainties in evaluating and assessing the reliability of these components and structures, probabilistic structural mechanics (PSM) procedures must be used. Much research has focused on basic theory development and the development of approximate analytic solution methods in random vibrations and structural reliability. Practical application of PSM methods was hampered by their computationally intense nature. Solution of PSM problems requires repeated analyses of structures that are often large, and exhibit nonlinear and/or dynamic response behavior. These methods are all inherently parallel and ideally suited to implementation on parallel processing computers. New hardware architectures and innovative control software and solution methodologies are needed to make solution of large scale PSM problems practical
Mapping Algorithms and Software Environment for Data Parallel
We consider computations associated with data parallel iterative solvers used for the numerical solution of Partial Differential Equations (PDEs). The mapping of such computations into load balanced tasks requiring minimum synchronization and communication is a difficult combinatorial optimization problem. Its optimal solution is essential for the efficient parallel processing of PDE computations. Determining data mappings that optimize a number of criteria, like workload balance, synchronization and local communication, often involves the solution of an NP-Complete problem. Although data mapping algorithms have been known for a few years there is lack of qualitative and quantitative comparisons based on the actual performance of the parallel computation. In this paper we present two new data mapping algorithms and evaluate them together with a large number of existing ones using the actual performance of data parallel iterative PDE solvers on the nCUBE II. Comparisons on the performance of data parallel iterative PDE solvers on medium and large scale problems demonstrate that some computationally inexpensive data block partitioning algorithms are as effective as the computationally expensive deterministic optimization algorithms. Also, these comparisons demonstrate that the existing approach in solving the data partitioning problem is inefficient for large scale problems. Finally, a software environment for the solution of the partitioning problem of data parallel iterative solvers is presented
- …