High Performance Remote Memory Access Communication: The Armci Approach

Nieplocha, Jaroslaw; Tipparaju, Vinod; Krishnan, Manojkumar; Panda, Dhabaleswar K.

doi:10.1177/1094342006064504

Cited by 92 publications

(54 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the number of partitions increases, every process has to communicate with only a small number of other processes. Therefore, the communi- cation costs are reduced by using one-sided point-to-point communication APIs provided by ARMCI [28].…”

Section: F Communication Between Processesmentioning

confidence: 99%

Code generation for parallel execution of a class of irregular loops on distributed memory systems

Ravishankar¹,

Eisenlohr²,

Pouchet³

et al. 2012

2012 International Conference for High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

Abstract-Parallelization and locality optimization of affine loop nests has been successfully addressed for shared-memory machines. However, many large-scale simulation applications must be executed in a distributed-memory environment, and use irregular/sparse computations where the control-flow and arrayaccess patterns are data-dependent.In this paper, we propose an approach for effective parallel execution of a class of irregular loop computations in a distributedmemory environment, using a combination of static and runtime analysis. We discuss algorithms that analyze sequential code to generate an inspector and an executor. The inspector captures the data-dependent behavior of the computation in parallel and without requiring complete replication of any of the data structures used in the original computation. The executor performs the computation in parallel. The effectiveness of the framework is demonstrated on several benchmarks and a climate modeling application.

show abstract

Section: F Communication Between Processesmentioning

confidence: 99%

Code generation for parallel execution of a class of irregular loops on distributed memory systems

Ravishankar¹,

Eisenlohr²,

Pouchet³

et al. 2012

2012 International Conference for High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

show abstract

“…For example, ARMCI (Aggregate Remote Memory Copy Interface) [21], [22] and Global Arrays (GA) [23]- [25] are ported based on such strategy. In such case, user cannot optimize translated MPI programs.…”

Section: One Sided Communication and Pgas Environmentsmentioning

confidence: 99%

Network Interface Architecture with Scalable Low-Latency Message Receiving Mechanism

Tanabe

Ohta

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYMost of scientists except computer scientists do not want to make efforts for performance tuning with rewriting their MPI applications. In addition, the number of processing elements which can be used by them is increasing year by year. On large-scale parallel systems, the number of accumulated messages on a message buffer tends to increase in some of their applications. Since searching message queue in MPI is time-consuming, system side scalable acceleration is needed for those systems. In this paper, a support function named LHS (Limited-length Head Separation) is proposed. Its performance in searching message buffer and hardware cost are evaluated. LHS accelerates searching message buffer by means of switching location to store limited-length heads of messages. It uses the effects such as increasing hit rate of cache on host with partial offloading to hardware. Searching speed of message buffer when the order of message reception is different from the receiver's expectation is accelerated 14.3 times with LHS on FPGA-based network interface card (NIC) named DIMMnet-2. This absolute performance is 38.5 times higher than that of IBM BlueGene/P although the frequency is 8.5times slower than BlueGene/P. LHS has higher scalability than ALPU in the performance per frequency. Since these results are obtained with partially on loaded linear searching on old Pentium R 4, performance gap will increase using state of art CPU. Therefore, LHS is more suitable for larger parallel systems. The discussions for adopting proposed method to state of art processors and systems are also presented. key words: network interface, MPI, message passing, queue management, low latency communication, scalability

show abstract

“…The diagram illustrates the box management. Empty boxes (5,8,10,11,12) are not stored. The ibox vector associates the box number with each particle.…”

Section: Initial Data Distributionmentioning

confidence: 99%

Latency-Optimized Parallelization of the FMM Near-Field Computations

Kabadshow

Lang

2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. In this paper we present a new parallelization scheme for the FMM near-field. The parallelization is based on the Global Arrays Toolkit and uses one-sided communication with overlapping. It employs a purely static load-balancing approach to minimize the number of communication steps and benefits from a maximum utilization of data locality. In contrast to other implementations the communication is initiated by the process owning the data via a put call, not the process receiving the data (via a get call).

show abstract

High Performance Remote Memory Access Communication: The Armci Approach

Cited by 92 publications

References 10 publications

Code generation for parallel execution of a class of irregular loops on distributed memory systems

Code generation for parallel execution of a class of irregular loops on distributed memory systems

Network Interface Architecture with Scalable Low-Latency Message Receiving Mechanism

Latency-Optimized Parallelization of the FMM Near-Field Computations

Contact Info

Product

Resources

About