27,753 research outputs found

    Parallel, iterative solution of sparse linear systems: Models and architectures

    Get PDF
    A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed

    A model of asynchronous iterative algorithms for solving large, sparse, linear systems

    Get PDF
    Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension

    Stencils and problem partitionings: Their influence on the performance of multiple processor systems

    Get PDF
    Given a discretization stencil, partitioning the problem domain is an important first step for the efficient solution of partial differential equations on multiple processor systems. Partitions are derived that minimize interprocessor communication when the number of processors is known a priori and each domain partition is assigned to a different processor. This partitioning technique uses the stencil structure to select appropriate partition shapes. For square problem domains, it is shown that non-standard partitions (e.g., hexagons) are frequently preferable to the standard square partitions for a variety of commonly used stencils. This investigation is concluded with a formalization of the relationship between partition shape, stencil structure, and architecture, allowing selection of optimal partitions for a variety of parallel systems

    Evaluation of the capture efficiency and size selectivity of four pot types in the prospective fishery for North Pacific giant octopus (Enteroctopus dofleini)

    Get PDF
    Over 230 metric tons of octopus is harvested as bycatch annually in Alaskan trawl, long-line, and pot fisheries. An expanding market has fostered interest in the development of a directed fishery for North Pacific giant octopus (Enteroctopus dofleini). To investigate the potential for fishery development we examined the efficacy of four different pot types for capture of this species. During two surveys in Kachemak Bay, Alaska, strings of 16 –20 sablefish, Korean hair crab, shrimp, and Kodiak wooden lair pots were set at depths ranging between 62 and 390 meters. Catch per-unit-of-ef for t estimates were highest for sablefish and lair pots. Sablefish pots caught significantly heavier North Pacific giant octopuses but also produced the highest bycatch of commercially important species, such as halibut (Hippoglossus stenolepis), Pacific cod (Gadus macrocephalus), and Tanner crab (Chionoecetes bairdi)

    Thermodynamic properties of extremely diluted symmetric Q-Ising neural networks

    Full text link
    Using the replica-symmetric mean-field theory approach the thermodynamic and retrieval properties of extremely diluted {\it symmetric} QQ-Ising neural networks are studied. In particular, capacity-gain parameter and capacity-temperature phase diagrams are derived for Q=3,4Q=3, 4 and Q=∞Q=\infty. The zero-temperature results are compared with those obtained from a study of the dynamics of the model. Furthermore, the de Almeida-Thouless line is determined. Where appropriate, the difference with other QQ-Ising architectures is outlined.Comment: 16 pages Latex including 6 eps-figures. Corrections, also in most of the figures have been mad

    Detecting solar axions using Earth's magnetic field

    Full text link
    We show that solar axion conversion to photons in the Earth's magnetosphere can produce an x-ray flux, with average energy \sim 4 keV, which is measurable on the dark side of the Earth. The smallness of the Earth's magnetic field is compensated by a large magnetized volume. For axion masses < 10^{-4} eV, a low-Earth-orbit x-ray detector with an effective area of 10^4 cm^2, pointed at the solar core, can probe the photon-axion coupling down to 10^{-11} GeV^{-1}, in one year. Thus, the sensitivity of this new approach will be an order of magnitude beyond current laboratory limits.Comment: 3 pages, 1 figure, typos corrected, references adde

    Propagation and organization in lattice random media

    Full text link
    We show that a signal can propagate in a particular direction through a model random medium regardless of the precise state of the medium. As a prototype, we consider a point particle moving on a one-dimensional lattice whose sites are occupied by scatterers with the following properties: (i) the state of each site is defined by its spin (up or down); (ii) the particle arriving at a site is scattered forward (backward) if the spin is up (down); (iii) the state of the site is modified by the passage of the particle, i.e. the spin of the site where a scattering has taken place, flips (↑⇔↓\uparrow \Leftrightarrow \downarrow ). We consider one dimensional and triangular lattices, for which we give a microscopic description of the dynamics, prove the propagation of a particle through the scatterers, and compute analytically its statistical properties. In particular we prove that, in one dimension, the average propagation velocity is =1/(3−2q) = 1/(3-2q), with qq the probability that a site has a spin ↑\uparrow, and, in the triangular lattice, the average propagation velocity is independent of the scatterers distribution: =1/8 = 1/8. In both cases, the origin of the propagation is a blocking mechanism, restricting the motion of the particle in the direction opposite to the ultimate propagation direction, and there is a specific re-organization of the spins after the passage of the particle. A detailed mathematical analysis of this phenomenon is, to the best of our knowledge, presented here for the first time.Comment: 30 pages, 15 separate figures (in PostScript); submitted to J. Stat. Phy

    Information Flow in Entangled Quantum Systems

    Get PDF
    All information in quantum systems is, notwithstanding Bell's theorem, localised. Measuring or otherwise interacting with a quantum system S has no effect on distant systems from which S is dynamically isolated, even if they are entangled with S. Using the Heisenberg picture to analyse quantum information processing makes this locality explicit, and reveals that under some circumstances (in particular, in Einstein-Podolski-Rosen experiments and in quantum teleportation) quantum information is transmitted through 'classical' (i.e. decoherent) information channels.Comment: PostScript version now available: http://www.qubit.org/people/patrickh/Papers/InformationFlow.p
    • …
    corecore