Time and work optimal simulation of basic reconfigurable meshes on hypercubes

Authors:
Alan A. Bertossi;Alessandro Mei
Affiliations:
Department of Computer Science, University of Bologna, Italy;Department of Computer Science, University of Rome "La Sapienza", Rome, Italy
Venue:
Journal of Parallel and Distributed Computing
Year:
2004

Citing 14
Cited 0

Polymorphic-Torus Architecture for Computer Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Scans as Primitive Parallel Operations

IEEE Transactions on Computers
Polymorphic-Torus Network

IEEE Transactions on Computers
The power of reconfiguration

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms

An introduction to parallel algorithms
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
Parallel solutions to geometric problems in the scan model of computation

Journal of Computer and System Sciences
Efficient self-simulation algorithms for reconfigurable arrays

Journal of Parallel and Distributed Computing
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
Parallel Prefix Computation

Journal of the ACM (JACM)
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
Efficient Parallel Processing of Image Contours

IEEE Transactions on Pattern Analysis and Machine Intelligence
Polymorphic Processor Arrays

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a constant slow-down, optimal and locally normal simulation for basic reconfigurable meshes on hypercubes, if the log-time delay model for broadcasting is assumed. Such a simulation algorithm is based on: (i) an O(log B) time algorithm for the segmented scan problem on a (2n - 1)-node toroidal X-tree, where B is the size of the longest segment; this algorithm is time optimal; (ii) a constant slow-down optimal and locally normal simulation algorithm for basic reconfigurable meshes on the mesh of toroidal X-trees; and (iii) a constant slow-down optimal simulation of locally normal algorithms for meshes of toroidal X-trees on the hypercube.