Towards a complexity model for design and analysis of PGAS-based algorithms

Authors:
Mohamed Bakhouya;Jaafar Gaber;Tarek El-Ghazawi
Affiliations:
Department of Electrical and Computer Engineering, High Performance Computing Laboratory, The George Washington University;Universite de Technologies de Belfort-Montbeliard;Department of Electrical and Computer Engineering, High Performance Computing Laboratory, The George Washington University
Venue:
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Year:
2007

Citing 11
Cited 3

A bridging model for parallel computation

Communications of the ACM
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
A quantitative comparison of parallel computation models

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Can shared-memory model serve as a bridging model for parallel computation?

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A performance analysis of the Berkeley UPC compiler

ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Models of parallel computation: a survey and synthesis

HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Quantifying Locality Effect in Data Access Delay: Memory logP

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Fast Address Translation Techniques for Distributed Shared Memory Compilers

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
UPC: Distributed Shared Memory Programming (Wiley Series on Parallel and Distributed Computing)

UPC: Distributed Shared Memory Programming (Wiley Series on Parallel and Distributed Computing)
A performance model for fine-grain accesses in UPC

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

A PGAS-Based Algorithm for the Longest Common Subsequence Problem

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Developing parallel programs: A design-oriented perspective

IWMSE '09 Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering
Predicting remote reuse distance patterns in UPC applications

Proceedings of the Fourth Conference on Partitioned Global Address Space Programming Model

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PGAS programming languages provide ease-of-use through a global shared address space while emphasizing performance by providing locality awareness and a partition of the address space. Examples of PGAS languages include the Unified Parallel C (UPC), Co-array Fortran, and Titanium languages. Therefore, the interest in complexity design and analysis of PGAS algorithms is growing and a complexity model to capture implicit communication and fine-grain programming style is required. In this paper, a complexity model is developed to characterize the performance of algorithms based on the PGAS programming model. The experimental results shed further light on the impact of data distributions on locality and performance and confirm the accuracy of the complexity model as a useful tool for the design and analysis of PGAS-based algorithms.