Interprocessor communication and multitasking

2006 ◽  
pp. 57-79
Keyword(s):  
Interprocessor Communication

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

1995 ◽  
Vol 05 (03) ◽  
pp. 331-341 ◽  
Author(s):  
MICHAEL G. NORMAN ◽  
SUSANNA PELAGATTI ◽  
PETER THANISCH
Keyword(s):  
Execution Time ◽  
Communication Delay ◽  
Interprocessor Communication ◽  
Communication Latency ◽  
Processor Scheduling ◽  
Np Completeness

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.

Message scheduling for real-time interprocessor communication

2015 ◽  
Vol 61 (8) ◽  
pp. 374-382
Author(s):  
Stefan Waldherr ◽  
Sigrid Knust ◽  
Stefan Aust
Keyword(s):  
Real Time ◽  
Interprocessor Communication ◽  
Message Scheduling

2-D pseudo-spectral viscoacoustic modeling in a distributed-memory multi-processor computer

1993 ◽  
Vol 83 (5) ◽  
pp. 1345-1354
Author(s):  
Quingbo Liao ◽  
George A. McMechan
Keyword(s):  
Distributed Memory ◽  
Fourier Transforms ◽  
Relaxation Times ◽  
Empirical Method ◽  
Interprocessor Communication ◽  
Computing Environment ◽  
Absorbing Boundaries ◽  
Matrix Transposition ◽  
Pseudo Spectral ◽  
Frequency Curves

Abstract Two pseudo-spectral implementations of 2-D viscoacoustic modeling are developed in a distributed-memory multi-processor computing environment. The first involves simultaneous computation of the response of one model to many source locations and, as it requires no interprocessor communication, is perfectly parallel. The second involves computation of the response, to one source, of a large model that is distributed across all processors. In the latter, local rather than global, Fourier transforms are used to minimize interprocessor communication and to eliminate the need for matrix transposition. In both algorithms, absorbing boundaries are defined as zones of decreased Q as part of the model, and so require no extra computation. An empirical method of determining sets of relaxation times for a broad range of Q values eliminates the need for iterative fitting of Q-frequency curves.

Reduced interprocessor-communication architecture and its implementation on EM-4

1995 ◽  
Vol 21 (5) ◽  
pp. 753-769 ◽  
Author(s):  
Shuichi Sakai ◽  
Yuetsu Kodama ◽  
Mitsuhisa Sato ◽  
Andrew Shaw ◽  
Hiroshi Matsuoka ◽  
...  
Keyword(s):  
Interprocessor Communication ◽  
Communication Architecture

Parallel Iterative Methods for the Helmholtz Equation With Exact Nonreflecting Boundaries

2002 ◽  
Author(s):  
Cristian Ianculescu ◽  
Lonny L. Thompson
Keyword(s):  
Helmholtz Equation ◽  
Iterative Methods ◽  
Scale Up ◽  
Low Rank ◽  
Interprocessor Communication ◽  
Parallel Iterative Methods ◽  
Local Boundary Condition ◽  
Non Local ◽  
Parallel Iterative ◽  
Low Rank Update

Parallel iterative methods for fast solution of large-scale acoustic radiation and scattering problems are developed using exact Dirichlet-to-Neumann (DtN), nonreflecting boundaries. A separable elliptic nonreflecting boundary is used to efficiently model unbounded regions surrounding elongated structures. We exploit the special structure of the non-local DtN map as a low-rank update of the system matrix to efficiently compute the matrix-by-vector products found in Krylov subspace based iterative methods. For the complex non-hermitian matrices resulting from the Helmholtz equation, we use a distributed-memory parallel BICG-STAB iterative method in conjunction with a parallel Jacobi preconditioner. Domain decomposition with interface minimization was performed to ensure optimal interprocessor communication. For the architectures tested, and using the MPICH version of MPI, we show that when implemented as a low-rank update, the non-local character of the DtN map does not signicantly decrease the scale up and parallel eciency versus a purely approximate local boundary condition.

Sign in / Sign up

Export Citation Format

Share Document