Home // FUTURE COMPUTING 2017, The Ninth International Conference on Future Computational Technologies and Applications // View article
Authors:
Hiroshi Umeo
Takuya Yamawaki
Hiroki Uchino
Kaori Ishida
Keywords: cellular automata, FSSP, synchronization
Abstract:
We introduce a new class of minimum-time FSSP (Firing Squad Synchronization Problem) algorithms for two-dimensional (2D) rectangular arrays. The algorithms in the class are all based on L-shaped mapping, where the synchronized configurations on 1D arrays are mapped in an L-shaped form onto 2D arrays efficiently, yielding minimum-time FSSP algorithms. We also present a comparative study of their recent implementations. Several state-efficient implementations, new insights into 2D synchronization and multi-dimensional extensions are also discussed.
Pages: 20 to 25
Copyright: Copyright (c) IARIA, 2017
Publication date: February 19, 2017
Published in: conference
ISSN: 2308-3735
ISBN: 978-1-61208-530-2
Location: Athens, Greece
Dates: from February 19, 2017 to February 23, 2017