Collective Relocation for Associative Distributed Collections of Objects

Collective Relocation for Associative Distributed Collections of Objects

Daisuke Fujishima (Graduate School of System Informatics, Kobe University, Kobe, Japan) and Tomio Kamada (Advanced Institute for Computational Science, RIKEN, Wako, Japan)
Copyright: © 2017 |Pages: 15
DOI: 10.4018/IJSI.2017040104

Abstract

The field of parallel computing has experienced an increase in the number of computing nodes, allowing broader applications, including computations that have irregular features. Some parallel programming languages handle object data structures and offer marshaling/unmarshaling mechanisms to transpose them. To manage data elements across computing nodes, some research on distributed collections has been conducted. This study proposes a distributed collection library that can handle multiple collections of object elements and change their distributions while maintaining associativity between their elements. This library is implemented on an object-oriented parallel programming language, X10. The authors assume pairs of associative collections such as vehicles and streets in a traffic simulation. When many vehicles are concentrated on streets assigned to certain computing nodes, some of these streets should be moved to other nodes. The authors' library assists the programmer in easily distributing the associative collections over the computing nodes and collectively relocating elements while maintaining the data sharing relationship among associative elements. The programmer can describe the associativity between objects by using both declarative and procedural methods. They show a preliminary performance evaluation of their library on a Linux cluster and the K computer.
Article Preview

2. Memory Model Of X10

X10 is a parallel programming language developed by IBM Research and adopts the PGAS model. Figure 1 illustrates the memory model of X10. The address space is partitioned using places, in which each object belongs to a specific place. Each place represents a shared-memory multiprocessor. An activity represents a sequential computation. Each place can run one or more activities.

Figure 1.

Memory Model of X10

Purchase this article to continue reading all 15 pages >

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 7: 4 Issues (2019): Forthcoming, Available for Pre-Order
Volume 6: 4 Issues (2018)
Volume 5: 4 Issues (2017)
Volume 4: 4 Issues (2016)
Volume 3: 4 Issues (2015)
Volume 2: 4 Issues (2014)
Volume 1: 4 Issues (2013)
View Complete Journal Contents Listing