Language bindings for a data-parallel runtime
Bryan Carpenter,Geoffrey C. Fox,Donald Leskiw,Xinying Li,Yuhong Wen,Guansong Zhang +5 more
- 30 Mar 1998
- pp 42-49
TL;DR: A class of more easily implementable data parallel language extensions that preserve many of the attractive features of HPF, while providing the programmer with direct access to runtime libraries such as the NPAC PCRC kernel are discussed.
read more
Abstract: The NPAC kernel runtime, developed in the PCRC (Parallel Compiler Runtime Consortium) project, is a runtime library with special support for the High Performance Fortran data model. It provides array descriptors for a generalized class of HPF like distributed arrays, support for parallel access to their elements, and a rich library of collective communication and arithmetic operations for manipulating these arrays. The library has been successfully used as a component in experimental HPF translation systems. With prospects for early appearance of fully featured, efficient HPF compilers looking questionable, we discuss a class of more easily implementable data parallel language extensions that preserve many of the attractive features of HPF, while providing the programmer with direct access to runtime libraries such as the NPAC PCRC kernel.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
ARMCI: A Portable Remote Memory Copy Libray for Ditributed Array Libraries and Compiler Run-Time Systems
Jarek Nieplocha,Bryan Carpenter +1 more
- 12 Apr 1999
TL;DR: ARMCI provides one-sided communication capabilities for distributed array libraries and compiler run-time systems and supports remote memory copy, accumulate, and synchronization operations optimized for non-contiguous data transfers including strided and generalized UNIX I/O vector interfaces.
284
PaDDMAS: parallel and distributed data mining application suite
Omer Rana,David W. Walker,Maozhen Li,S. Lynden,M. Ward +4 more
- 01 May 2000
TL;DR: The architecture of PaDDMAS is described, a component based system for developing distributed data mining applications that provides a tool set for combining pre-developed or custom components using a dataflow approach, with components performing analysis, data extraction or data management and translation.
32
A Distributed Framework for Parallel Data Mining Using HPJava
TL;DR: The framework supports parallelism across workstation clusters, using the message-passing interface as middleware, and can support different analysis algorithms, wrapped as Java objects, and linked to various databases using the Java database connectivity interface.
13
Parallel and Distributed Computing using Pervasive Web and Object Technologies
Geoffrey C. Fox,Wojtek Furmanski +1 more
- 01 Jan 1998
TL;DR: It is shown that the architecture with distinct interface, server and specialized service implementation layers, naturally allows advances in each area to be easily incorporated and can be applied to both metacomputing and to provide improved parallel programming environments.
The Use of JAVA in High Performance Computing: A Data Mining Example
David W. Walker,Omer Rana +1 more
- 12 Apr 1999
TL;DR: The role of Java in high performance computing is discussed with particular reference to the efforts of the Java Grande Forum to develop Java into the environment of choice for large-scale, resource-hungry applications.
1
References
Communication optimizations for irregular scientific computations on distributed memory architectures
TL;DR: A detailed performance and scalability analysis of the communication primitives is presented, carried out using a workload generator, kernels from real applications, and a large unstructured adaptive application.
216
An integrated runtime and compile-time approach for parallelizing structured and block structured applications
TL;DR: In this paper, the authors present runtime and compile-time analysis for block structured codes on distributed memory parallel machines in an efficient and machine-independent fashion, which can be used by compilers for HPF-like parallel programming languages in compiling codes in which data distribution, loop bounds and/or strides are unknown at compile time.
Supporting irregular distributions using data-parallel languages
TL;DR: Languages such as Fortran D provide irregular distribution schemes that can efficiently support irregular problems and compilers can incorporate runtime procedures to automatically support these distributions.
PCRC-based HPF Compilation
Guansong Zhang,Bryan Carpenter,Geoffrey C. Fox,Xiaoming Li,Xinying Li,Yuhong Wen +5 more
- 07 Aug 1997
TL;DR: The design and implementation of an HPF compilation system based on PCRC runtime based on the approaches to issues such as directive analysis and communication detection are discussed in detail.
Global arrays: a nonuniform memory access programming model for high-performance computers
TL;DR: The key concept of GAs is that they provide a portable interface through which each process in a MIMD parallel program can asynchronously access logical blocks of physically distributed matrices, with no need for explicit cooperation by other processes.