In order to understand details in the seismic wave field observed on regional and global scales on the Earth's surface accurate modeling of 3D wave propagation is necessary. While numerical techniques are now rout...
详细信息
In order to understand details in the seismic wave field observed on regional and global scales on the Earth's surface accurate modeling of 3D wave propagation is necessary. While numerical techniques are now routinely applied to local seismic wave propagation, only recently has the possibility of simulating wave propagation on larger scales in spherical geometry been investigated. We apply a high-order staggered-grid finite-difference scheme to the elastic wave equations in spherical coordinates [phi, theta, r]. Using regular grid spacing in a single domain the physical space is limited to spherical sections which do not include the axis theta = 0. While the staggering of the space-dependent fields improves the overall accuracy of the scheme, some of the tensor elements have to be interpolated to the required grid locations. By comparing with quasi-analytical solutions for layered Earth models we demonstrate the accuracy of the algorithm. Finally, the technique is used to study the effects of a source located in a simplified slab structure. The 3D technique will allow us to study the wave field due to laterally heterogeneous structures, such as subduction zones, plumes or oceanic ridges. (C) 2002 Elsevier Science B.V. All rights reserved.
Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors...
详细信息
Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.
The paper analyzes the performance of parallel global optimization algorithm, which is used to optimize grillage-type foundations. The parallel algorithm is obtained by using the automatic parallelization tool. We des...
详细信息
The paper analyzes the performance of parallel global optimization algorithm, which is used to optimize grillage-type foundations. The parallel algorithm is obtained by using the automatic parallelization tool. We describe briefly the layer structure of the Master-Slave Template library and present a detailed mathematical formulation of the application problem. Experiments are done on the homogeneous computer cluster of 7 IBM machines RS6000. The results of experiments are presented.
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorithms are presented for molecular dynami...
详细信息
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorithms are presented for molecular dynamics (MD) simulations and quantum-mechanical (QM) calculations based on the density functional theory. Performance tests have been carried out on 1,088-processor Cray T3E and 1,280-processor IBM SP3 computers. The linear-scaling algorithms have enabled 6.44-billion-atom MD and 111,000-atom QM calculations on 1,024 SP3 processors with parallel efficiency well over 90%. The production-quality programs also feature wavelet-based computational-space decomposition for adaptive load balancing, spacefilling-curve-based adaptive data compression with user-defined error bound for scalable I/O, and octree-based fast visibility culling for immersive and interactive visualization of massive simulation data.
The value of high-throughput genomic research is dramatically enhanced by association with key patient data. These data are generally available but of disparate quality and not typically directly associated. A system ...
详细信息
The value of high-throughput genomic research is dramatically enhanced by association with key patient data. These data are generally available but of disparate quality and not typically directly associated. A system that could bring these disparate data sources into a common resource connected with functional genomic data would be tremendously advantageous. However, the integration of clinical and accurate interpretation of the generated functional genomic data requires the development of information management systems capable of effectively capturing the data as well as tools to make that data accessible to the laboratory scientist or to the clinician. In this review these challenges and current information technology solutions associated with the management, storage and analysis of high-throughput data are highlighted. It is suggested that the development of a pharmacogenomic data management system which integrates public and proprietary databases, clinical datasets, and data mining tools embedded in a high-performance computing environment should include the following components: parallel processing systems, storage technologies, network technologies, databases and database management systems (DBMS), and application services.
In this paper we describe the application of a parallel implementation of the implicit filtering algorithm to a control problem from hydrology. We seek to control the temperature at a group of drinking water wells by ...
详细信息
In this paper we describe the application of a parallel implementation of the implicit filtering algorithm to a control problem from hydrology. We seek to control the temperature at a group of drinking water wells by placing barrier wells between the drinking water wells and a well that injects heated water from an industrial site.
This paper addresses a modified dynamic programming parallel algorithm, and its associated architecture of temporal and spatial complexity of O(N), with N number of processing elements involved in computation. The mod...
详细信息
ISBN:
(纸本)0780376900
This paper addresses a modified dynamic programming parallel algorithm, and its associated architecture of temporal and spatial complexity of O(N), with N number of processing elements involved in computation. The modification consists of the algorithm adaptation to image interest point matching and architecture optimization. parallel algorithm simulates the designed architecture, validates it functionally, and allows temporal performance prediction. The proposed algorithm of low spatial and temporal complexities suits very well for real time on board applications (autonomous robot guidance, trajectory matching, blinds vision guidance,...).
Interconnection networks of various topologies are used in parallel computing. It is important to study the graph theoretical/combinatorial properties of the underlying networks in order to better understand them and ...
详细信息
ISBN:
(纸本)0769515797
Interconnection networks of various topologies are used in parallel computing. It is important to study the graph theoretical/combinatorial properties of the underlying networks in order to better understand them and develop more efficient parallel algorithms as well as fault-tolerant communication/routing algorithms. In this paper, we approach this problem from a new angle by looking into the spectra (eigenvalues and their multiplicities) of these networks. Eigenvalues of the adjacency matrix of a graph can reveal certain properties of the graph since they are closely related to some of its combinatorial invariants. Specifically, for some of the popular interconnection networks, we study their eigenvalues and multiplicities by (1) summarizing the currently available results;(2) deriving some of these results in a more straight forward way;(3) obtaining new results;and (4) presenting experimental results on several interconnection networks. In addition, we briefly survey the results that relate spectra of graphs to their structural properties. Although much work remains to be done, by looking into the spectra of interconnection networks, we hope to bring about a more unified approcah to studying their topological properties.
The paper describes a new stochastic heuristic algorithm for global optimization. The new optimization algorithm, called Intelligent-Particle Swarm Optimization (IPSO), offers more intelligence to particles by using c...
详细信息
The paper describes a new stochastic heuristic algorithm for global optimization. The new optimization algorithm, called Intelligent-Particle Swarm Optimization (IPSO), offers more intelligence to particles by using concepts such as: group experiences, unpleasant memories (tabu to be avoided), local landscape models based on virtual neighbors, and memetic replication of successful behavior parameters. The new individual complexity is amplified at the group level and consequently generates a more efficient optimization procedure. A simplified version of the IPSO algorithm was implemented and compared with the classical PSO algorithm for a simple test function and for the Loney's solenoid.
An optoelectronic correlator based architecture is proposed for implementing algorithms to compute trigonometric elementary functions such as sine, cosine, and tangent. We utilized the symbolic substitution technique ...
详细信息
ISBN:
(纸本)0780375734
An optoelectronic correlator based architecture is proposed for implementing algorithms to compute trigonometric elementary functions such as sine, cosine, and tangent. We utilized the symbolic substitution technique to reduce the number of the computation rules involved. The modified signed-digit (MSD) number system representation is used for computing these complex elementary functions. An arithmetic unit that performs parallel one-step addition (subtraction), multiplication, division, and square root is proposed to perform the computation of trigonometric elementary functions.
暂无评论