An adaptive algorithm for p system synchronization

Authors:
Michael J. Dinneen;Yun-Bum Kim;Radu Nicolescu
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 6
Cited 1

Network structure and the firing squad synchronization problem

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Tissue P systems

Theoretical Computer Science
Bounding the firing synchronization problem on a ring

Theoretical Computer Science
Fast Synchronization in P Systems

Membrane Computing
Faster synchronization in P systems

Natural Computing: an international journal

Parallel and distributed algorithms in p systems

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-structured P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P system to send the final command to synchronize. With e being the eccentricity of the general and r denoting the radius of the underlying digraph, our new algorithm guarantees to synchronize all cells of the system, between e +2r +3 steps (for all trees structures and many digraphs) and up to 3e +7 steps, in the worst case for any digraph. Empirical results show our new algorithm for tree-structured P systems yields at least 20% reduction in the number of steps needed to synchronize over the previous best-known algorithm.