Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Gheorghe Almasi"'
Publikováno v:
Languages and Compilers for Parallel Computing ISBN: 9783319174723
LCPC
LCPC
Partitioned Global Address Space (PGAS) languages are a popular alternative when building applications to run on large scale parallel machines. Unified Parallel C (UPC) is a well known PGAS language that is available on most high performance computin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64414713a93b40b45ac48b46d8b43bcc
https://doi.org/10.1007/978-3-319-17473-0_13
https://doi.org/10.1007/978-3-319-17473-0_13
Publikováno v:
IBM Journal of Research and Development. 60:5:1-5:10
OpenStack® (the leading open source platform for public and private infrastructure-as-a-service clouds) is composed of a set of loosely coupled and rapidly evolving projects that support a wide set of technologies and configuration options. Deciding
Publikováno v:
SBAC-PAD
Modern large scale parallel machines feature an increasingly deep hierarchy of interconnections. Individual processing cores employ simultaneous multithreading (SMT) to better exploit functional units, multiple coherent processors are collocated in a
Publikováno v:
ICS
The Power7 IH (P7IH) is one of IBM's latest generation of supercomputers. Like most modern parallel machines, it has a hierarchical organization consisting of simultaneous multithreading (SMT) within a core, multiple cores per processor, multiple pro
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642387173
VECPAR
VECPAR
We present the automatic synthesis of the HPC Challenge’s Global FFT, a large 1D FFT across a whole supercomputer system. We extend the Spiral system to synthesize specialized single-node FFT libraries that combine a data layout transformation with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf275724a81c9346fc7497032521ae74
Publikováno v:
HPDC
Programming for large-scale, multicore-based architectures requires adequate tools that offer ease of programming while not hindering application performance. StarSs is a family of parallel programming models based on automatic function level paralle
Publikováno v:
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models.
Irregular graph algorithms for distributed-memory systems are hard to implement and optimize. Recent developments in PGAS languages make the implementation of irregular algorithms easier. In this paper we present our study of PRAM-based parallel conn
Autor:
Sayantan Sur, Ganesh Bikshandi, Vijay Saraswat, Sreedhar B. Kodali, Igor Peshansky, Gheorghe Almasi
Publikováno v:
Proceedings of the Third Conference on Partitioned Global Address Space Programing Models.
High-performance Linpack (HPL) benchmark is used to evaluate the performance of super computers. It implements blocked, right-looking Gaussian elimination with row partial pivoting. Block cyclic distribution is used in the parallel variant.In this pa
Autor:
Michael A. Blocksome, Dong Chen, Ahmad Faraj, Joseph D. Ratterman, Mark E. Giampapa, Gabor Dozsa, Philip Heidelberger, Sameer Kumar, Charles J. Archer, Brian E. Smith, Gheorghe Almasi, Jeffrey J. Parker
Publikováno v:
ICS
We present the architecture of the Deep Computing Messaging Framework (DCMF), a message passing runtime designed for the Blue Gene/P machine and other HPC architectures. DCMF has been designed to easily support several programming paradigms such as t
Autor:
Ganesh Bikshandi, Gheorghe Almasi, José E. Moreira, David Padua, Jia Guo, María Jesús Garzarán, Basilio B. Fraguela
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540280095
LCPC
Scopus-Elsevier
LCPC
Scopus-Elsevier
In this paper, we describe our experience in writing parallel numerical algorithms using Hierarchically Tiled Arrays (HTAs). HTAs are classes of objects that encapsulate parallelism. HTAs allow the construction of single-threaded parallel programs wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::607eed44447f13ee4193e6e4a8ed201a
https://doi.org/10.1007/11532378_8
https://doi.org/10.1007/11532378_8