Zobrazeno 1 - 10
of 130
pro vyhledávání: '"A. Kossatchev"'
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 5, Pp 283-310 (2018)
Distributed algorithms of solving problems on undirected graphs are considered. In section 2, a model is defined featuring a root as a starting and ending point of the algorithm execution. Synchronous and asynchronous versions of the model are descri
Externí odkaz:
https://doaj.org/article/a53cbfaef09748b8a3984dab4d10e70c
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 6, Pp 69-88 (2019)
SDN-technology is efficiently used for implementing service function chains can be efficiently implemented utilizing common resources and their management principles in virtual networks. The network is based on a connected undirected graph of physica
Externí odkaz:
https://doaj.org/article/7ccdf1511387421893b21ddd2af881c7
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 1, Pp 69-88 (2018)
The paper provides a review of distributed graph algorithms research conducted by authors. We consider an asynchronous distributed system model represented by a strongly connected directed rooted graph with bounded edge capacity (in a sense that only
Externí odkaz:
https://doaj.org/article/1d0f71207fef455e956026fea46bb62d
Autor:
Igor Burdonov, Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 28, Iss 1, Pp 151-184 (2018)
The problem of testing of aggregate systems is considered. The system components are described with finite automata with multiple entries and exits. The communication between automata is described with message passing over simplex communication chann
Externí odkaz:
https://doaj.org/article/c5865285b5304054bd8d7bb8f80c592b
Autor:
I. B. Burdonov, A. S. Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 28, Iss 1, Pp 103-130 (2018)
The problem of testing of aggregate systems is considered. The system is described with an oriented graph of links. The nodes correspond to automata of the components and arcs correspond to simplex communication channels. The hypothesis of the links
Externí odkaz:
https://doaj.org/article/809c9c8b492c448e88210334ce74ce62
Autor:
I. B. Burdonov, A. S. Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 2, Pp 167-194 (2018)
For a distributed system based on a directed graph without multiple edges and loops, the backtracing problem is considered: how to transfer a message from the final vertex of the arc to its initial vertex. The task is to create a structure on the gra
Externí odkaz:
https://doaj.org/article/756834a0b1794c0ea97e29e48e18680d
Autor:
Igor Burdonov, Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 27, Iss 2, Pp 189-220 (2018)
The problem of parallel computation of the value of a function of multiset of values recorded at the vertices of a directed strongly connected graph is considered. Computation is performed by automata that are located at the graph vertices. The autom
Externí odkaz:
https://doaj.org/article/b5e4bd4137d643589e75f190d7cc0ed4
Autor:
Alexander Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 23, Iss 0 (2018)
The paper discusses the problem of dependency between errors defined by specification and the related problem of test optimization. There is a dependency between errors if a strict subset of errors exists such that any nonconforming implementation (i
Externí odkaz:
https://doaj.org/article/f538157ae5cb444b93db1c50956fff46
Publikováno v:
Proceedings of the Institute for System Programming of the RAS. 34:159-172
The paper discusses the execution of a program of tasks on the SDN data plane, modeled by a finite connected undirected graph of physical connections; the execution is understood in the sense of the object-oriented programming paradigm as consisting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4456efaadbfb22fc97a5dfd464096616
https://doi.org/10.15514/ispras-2022-34(3)-11
https://doi.org/10.15514/ispras-2022-34(3)-11
Publikováno v:
Programming and Computer Software. 47:505-514
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3df3d316a9370bf692c1659d94deeca
https://doi.org/10.1134/s0361768821070033
https://doi.org/10.1134/s0361768821070033