Adaptive Barrier Algorithm in MPI Based on Analytical Evaluations for Communication Time in the LogP Model of Parallel Computation

Zharikov, Vitalii V.; Paznikov, Alexey A.; Pavsky, K.V.; Pavsky, Valery

doi:10.1109/fareastcon.2018.8602527

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Historically, extensive research efforts have been dedicated to collective algorithms. Numerous algorithms have been devised for each collective type, each tailored to address specific considerations related to message sizes and the number of processes [14,15].…”

Section: Related Workmentioning

confidence: 99%

“…Our study delves into the MPI model for collective operations, exploring its characteristics, potential advantages and disadvantages, and strategies to overcome its challenges. We also investigate future advancements and prospects of the MPI RMA model for collective operations, complemented by realworld applications [14].…”

Section: Introductionmentioning

confidence: 99%

“…To our knowledge, no prior collective algorithms have been proposed for the MPI one-sided interface (RMA model) [9,14]. However, in RMA-based programs, particularly those using passive target synchronization, certain processes need to access specific data in the memories of all other processes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Enhancing MPI remote memory access model for distributed-memory systems through one-sided broadcast implementation

Abuelsoud,

Kogutenko,

Naveen

2024

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Efficiently processing vast and expanding data volumes is a pressing challenge. Traditional high-performance computers, utilizing distributed-memory architecture and a message-passing model, grapple with synchronization issues, hampering their ability to keep up with the growing demands. Remote Memory Access (RMA), often referred to as one-sided MPI communications, offers a solution by allowing a process to directly access another process’s memory, eliminating the need for message exchange and significantly boosting performance. Unfortunately, the existing MPI RMA standard lacks a collective operation interface, limiting efficiency. To overcome this constraint, we introduce an algorithm design that enables efficient parallelizable collective operations within the RMA framework. Our study focuses primarily on the advantages of collective operations, using the broadcast algorithm as a case study. Our implementations surpass traditional methods, highlighting the promising potential of this technique, as indicated by initial performance tests.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%