A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem
書誌事項
- タイトル別名
-
- A Geometrical Approach
この論文をさがす
説明
An existence or non-existence of five-state firing squad synchronization protocol has been a long-standing, famous open problem for a long time. In this paper, we answer partially to this problem by proposing a small five-state firing squad synchronization algorithm that can synchronize any one-dimensional cellular array of length n = 2$^k$ in 3n − 3 steps for any positive integer k.
収録刊行物
-
- Fundamenta Informaticae
-
Fundamenta Informaticae 91 161-178, 2009-01-01
SAGE Publications