About: Optimal time and communication solutions of FSSP on square arrays, toruses and rings     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • A new solution for the Firing Squad Synchronization Problem (FSSP) on two-dimensional square arrays is presented and its correctness is demonstrated in detail. Our new solution is time as well as communication optimal (the so-called minimal time 1-bit solution). In addition, it is shown that the technique developed and the results obtained allow also to solve in optimal time & communication FSSP for several other variants of this problem on networks shaped as square grids (with four Generals), square toruses and rings. This research has been completed while the first author was visiting the Dipartimento di Informatica ed Applicazioni, Universit degli Studi di Salerno. Work partially supported by MIUR grant ex-60% 2003 Universit di Salerno. The first author is also supported by the grant GAČR, 201/04/1153.
  • A new solution for the Firing Squad Synchronization Problem (FSSP) on two-dimensional square arrays is presented and its correctness is demonstrated in detail. Our new solution is time as well as communication optimal (the so-called minimal time 1-bit solution). In addition, it is shown that the technique developed and the results obtained allow also to solve in optimal time & communication FSSP for several other variants of this problem on networks shaped as square grids (with four Generals), square toruses and rings. This research has been completed while the first author was visiting the Dipartimento di Informatica ed Applicazioni, Universit degli Studi di Salerno. Work partially supported by MIUR grant ex-60% 2003 Universit di Salerno. The first author is also supported by the grant GAČR, 201/04/1153. (en)
  • Je prezentováno nové řešení problému Firing Squad Synchronization Problem (FSSP) na čtvercových polícha a je detailně demonstrována jeho korektnost. Naše řešení je optimální časově i komunikačně (tzv. minimal time 1-bit solution). Navíc je ukázáno, že vyvinutá technika a získané výsledky také umožňují při optimálním čase a komunikaci vyřešit FSSP v některých dalších variantách tohoto problému na sítích tvaru čtvercových polí, čtvercových torech a prstencích. Tento výzkum byl dokončen během navštěvy prvního z autorů v Dipartimento di Informatica ed Applicazioni, Universit degli Studi di Salerno. Práce byla částečně podporována z grantu MIUR ex-60% 2003 Universit di Salerno. První z autorů je také podporován z grantu GAČR, 201/04/1153. (cs)
Title
  • Řešení problému FSSP na čtvercových polích, torech a prstencích optimální v čase i komunikaci (cs)
  • Optimal time and communication solutions of FSSP on square arrays, toruses and rings
  • Optimal time and communication solutions of FSSP on square arrays, toruses and rings (en)
skos:prefLabel
  • Řešení problému FSSP na čtvercových polích, torech a prstencích optimální v čase i komunikaci (cs)
  • Optimal time and communication solutions of FSSP on square arrays, toruses and rings
  • Optimal time and communication solutions of FSSP on square arrays, toruses and rings (en)
skos:notation
  • RIV/00216224:14330/04:00010792!RIV08-MSM-14330___
http://linked.open.../vavai/riv/strany
  • 200-211
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/01/0413), Z(MSM 143300001)
http://linked.open...iv/cisloPeriodika
  • 3340
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 578166
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/04:00010792
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Firing Squad Synchronization Problems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [B80E7FBCBE90]
http://linked.open...i/riv/nazevZdroje
  • Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 2006
http://linked.open...iv/tvurceVysledku
  • Gruska, Jozef
  • La Torre, Salvatore
  • Parente, Dominik
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software