• Home
  • Search
  • Studying Asynchronous Shared Memory Computations
  • https://doi.org/10.1109/pact.2007.4336241Copy DOI Icon

Studying Asynchronous Shared Memory Computations

  • Sep 1, 2007
  • Simo Juvaste
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

We present an experimental framework, F-PRAM model, for modeling, studying, and teaching the impacts of different properties of parallel computers. The performance model is a parameterized model similar to BSP [4] and LogP [1] with some additional parameters for more refined analysis when needed. To use the model, we present an emulation and experimentation system to study the impact of the parameters and communication network design decisions on application algorithm performance. Even if the parameterized models suite well for algorithm development and analysis, they cannot, however, represent accurately a complex real parallel computer, for example, hierarchical structure of computing clusters. Consequently, we use simulated network as a basis for comparison. With the simulated network approach, we can simulate any network topology, link/node speed, and routing algorithm. Using the simulated system, we can execute either benchmarks to measure the values of F-PRAM parameters (such as latency and bandwidth), or application algorithms to analyze their performance. The emulator takes as input the application algorithm (high level language), input data, machine parameters (such as number of processors and memory modules), other details (such as memory module latency and bandwidth), interconnection network topology and properties, routing algorithm (in C), length of buffers, and memory allocation (hash) scheme. During the execution, the program can do any output, but usually we are interested in the number of clock cycles needed for the execution. To use system efficiently, we have an automated measurement system that takes sets of configuration parameters and executes the simulation for every combination of the parameters, records the results, and visualizes the results with one or more graphs. For example, we select an application algorithm, input size, a number of processors, a set of different shapes of 3D mesh network, and mesh usage sparseness to see which is optimal for our algorithm. Or, we can select a set of hash algorithms and variations of application algorithm to see if some access patterns perform better than others.Our programming model is simplified Modula-2 with additional par-do to divide the execution threads for parallel execution. Shared memory data (variables) must be asynchronously pre-fetched to local variables before usage. Similarly, shared memory is updated with asynchronous writes. Programmer has the responsibility of memory consistency. The programmer can use the values of model parameters in program to make program to adapt to machine properties. In case of simulated network, the routing algorithm can collect statistics of the delays, and adjust the parameters accordingly on runtime. Our current set of example algorithms includes generic benchmarks (for latency and bandwidth), maximum finding, odd-even merge sort, matrix multiplication, matrix inversion, and image smoothing. Detailed descriptions of algorithms can be found in [2]. Our current set of network topologies include butterfly (deflection routing), hypercube, and 3D mesh/torus. We are planning to implement hierarchical memory structures, e.g., mesh of SMP nodes. Current version of the system is available at [3].

Similar Papers
  • Conference Article

Studying Asynchronous Shared Memory Computations

  • Sep 15, 2007
  • Simo Juvaste
  • Research Article
  • Citations1

Wait-free deflection routing of long messages

  • May 01, 2001
  • IEEE Transactions on Parallel and Distributed Systems
  • L Kucera
  • Research Article
  • Citations1

Executing tree routing algorithms on a high-performance pattern associative router

  • Aug 01, 1998
  • Journal of Systems Architecture
  • Douglas H Summerville +2
  • Research Article
  • Citations50

Fault‐tolerant processor interconnection networks

  • Jan 01, 1986
  • Systems and Computers in Japan
  • Makoto Imase +2
  • Book Chapter
  • Citations7

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance

  • Jan 01, 2002
  • D Barth +5
  • Research Article
  • Citations30

CoreVA-MPSoC: A Many-Core Architecture with Tightly Coupled Shared and Local Data Memories

  • May 01, 2018
  • IEEE Transactions on Parallel and Distributed Systems
  • Johannes Ax +8
  • Conference Article
  • Citations6

Achieving Gbps Throughput for Millimeter-Wave WPAN with an Anti-Blocking Scheme Using Deflection Routing

  • Sep 01, 2009
  • Zhou Lan +7
  • Research Article
  • Citations18

Recursive cube of rings: a new topology for interconnection networks

  • Mar 01, 2000
  • IEEE Transactions on Parallel and Distributed Systems
  • Y Sun +2
  • Research Article

Ad Hoc Networks: GPS-Based Routing Algorithm

  • Jan 01, 2008
  • Encyclopedia of Wireless and Mobile Communications
  • Young-Joo Suh +2
  • Conference Article
  • Citations1

An efficient long-lived adaptive collect algorithm

  • Jul 20, 2005
  • B Englert
  • Conference Article
  • Citations7

Scalability evaluation in many-core systems due to the memory organization

  • Dec 01, 2016
  • Guilherme Madalozzo +3
  • Conference Article
  • Citations3

Routing Algorithms Study and Comparing in Interconnection Networks

  • Apr 01, 2008
  • Hamid Barati +3
  • Conference Article

Design and fundamental limitations of large-scale coherent dynamical networks

  • Jan 01, 2012
  • Qatar Foundation Annual Research Forum Volume 2012 Issue 1
  • Bassam Bamieh
  • PDF
  • Research Article

Interface Automata for Shared Memory

  • Aug 30, 2021
  • Acta Informatica
  • Ayleen Schinko +4
  • Book Chapter
  • Citations3

On Batcher's merge sorts as parallel sorting algorithms

  • Jan 01, 1998
  • Christine Rüb
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.