Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  message passing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Parallel implementation of a PIC simulation algorithm using OpenMP
EN
Particle-in-cell (PIC) simulations are focusing on the individual trajectories of a very large number of particles in self-consistent and external electric and magnetic fields; they are widely used in the study of plasma jets, for example. The main disadvantage of PIC simulations is the large simulation runtime,which often requires a parallel implementation of the algorithm. The current paper focuses on a PIC1d3v simulation algorithm and describes the successful implementation of a parallel version of it on a multi-core architecture, using OpenMP, with very promising experimental and theoretical results.
2
Content available remote Equations for Asynchronous Message Passing
3
Content available remote An Ultrahigh Performance MPI Implementation on SGI® ccNUMA Altix® Systems
EN
The SGI® Message Passing Toolkit (MPT) software has implemented algorithms that provide extremely high-performance message passing on SGI Altix systems based on the SGI NUMAlink™ interconnect technology. Using Linux® OS infrastructure and SGI XPMEM cross-host memory-mapping software, SGI MPI delivers extremely high MPI performance on shared-memory single host/SMP Altix systems as well as multihost superclusters. This paper outlines the Altix hardware features, OS features, and library software algorithms that have been developed to provide the low-latency and high-bandwidth capabilities. We present high-performance features like direct copy send/receive, collectives, and the ultralow-latency SHMEM™ data transfer library. We include MPI benchmark results, including an MPI ping pong latency that ranges from 1.2 to 2.3 microseconds on a 512-CPU Altix system with 1.5 GHz Intel® Itanium® 2 Processors.
4
Content available remote An algorithm for detection of transient fault in any arbitrarily connected network
EN
This paper deals with fault diagnosis problem of interconnected multiprocessor systems. Our previous work dealt with diagnosis of faulty nodes as well as faulty links but that was restricted to dead-faults only. To make the fault diagnosis more realistic - an efficient approach is presented here, which can detect transient faults as well. The algorithm presented here is truly distributed and generalized in nature. The algorithm guarantees proper faulty unit detection as long as the system remains connected even in the presence of faults i.e., the number of faulty processors should not exceed the node connectivity of the network. Another attractive feature of the algorithm is that every non-faulty node can diagnose the faulty units independently without the help of any central unit i.e., the algorithm is truly parallel.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.