J 2006

Different time solutions for the firing squad synchronization problem on basic grid networks

GRUSKA, Jozef; Salvatore LA TORRE; Margherita NAPOLI and Mimmo PARENTE

Basic information

Original name

Different time solutions for the firing squad synchronization problem on basic grid networks

Name in Czech

Různá časová řešení pro FSSP v základních gridových sítích

Authors

GRUSKA, Jozef (703 Slovakia, guarantor); Salvatore LA TORRE (380 Italy); Margherita NAPOLI (380 Italy) and Mimmo PARENTE (380 Italy)

Edition

RAIRO - Theoretical Informatics and Applications, EDP, 2006, 0988-3754

Other information

Language

English

Type of outcome

Article in a journal

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

is not subject to a state or trade secret

Impact factor

Impact factor: 0.692

RIV identification code

RIV/00216224:14330/06:00016166

Organization unit

Faculty of Informatics

UT WoS

000239790500007

Keywords in English

Firing Squad Synchronization Problems

Tags

International impact, Reviewed
Changed: 29/6/2009 21:49, RNDr. Lukáš Boháč

Abstract

In the original language

We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes. The nodes are finite state processors that work in unison with other processors and in synchronized discrete steps. The networks we deal with are: the line, the ring and the square. For all of these models we consider one- and two-way communication modes and we also constrain the quantity of information that adjacent processors can exchange at each step. We first present synchronization algorithms that work in time $n^2$, $n \log n$, $n\sqrt n$, $2^n$, where n is a total number of processors. Synchronization methods are described through so called signals that are then used as building blocks to compose synchronization solutions for the cases that synchronization times are expressed by polynomials with nonnegative coefficients.

In Czech

Je prezentováno několik řešení problému FSSP v gridových sítích různých tvarů. Uzly jsou konečně stavové procesory, které pracují v souladu s ostatními procesory a v synchronizovaných diskrétních krocích.

Links

GA201/04/1153, research and development project
Name: Kvantové zdroje a primitiva
Investor: Czech Science Foundation, Quantum Resources and primitives
MSM0021622419, plan (intention)
Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems