Home // CLOUD COMPUTING 2016, The Seventh International Conference on Cloud Computing, GRIDs, and Virtualization // View article

How to Synchronize Large-Scale Ultra-Fine-Grained Processors in Optimum-Time

Authors:
Hiroshi Umeo

Keywords: cellular automata, FSSP

Abstract:
We introduce a new class of FSSP (firing squad synchronization problem) algorithms based on recursive-halving and construct a survey on recent developments in FSSP algorithms for one-dimensional cellular arrays. The algorithms being compared are Balzer [1], Gerken [2], Waksman [20], a number of revised versions thereof, and their generalized versions such as Moore and Langdon [8], Settle and Simon [10], Szwerinski [11], all included in the proposed new class of FSSP algorithms. We present herein a comparison of the quantitative aspects of the optimum-time FSSP algorithms developed so far. Several state-efficient new implementations and new insights into synchronization algorithms and multi-dimensional expansions are also given.

Pages: 81 to 86

Copyright: Copyright (c) IARIA, 2016

Publication date: March 20, 2016

Published in: conference

ISSN: 2308-4294

ISBN: 978-1-61208-460-2

Location: Rome, Italy

Dates: from March 20, 2016 to March 24, 2016