Geodesic
Formal Kinetic Model of Structureless Small-grained Parallelism
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 2 (1999) no. 3, pp. 239-256 
Katya O. Gorbunova. Formal Kinetic Model of Structureless Small-grained Parallelism. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 2 (1999) no. 3, pp. 239-256. http://geodesic.mathdoc.fr/item/SJVM_1999_2_3_a3/
@article{SJVM_1999_2_3_a3,
     author = {Katya O. Gorbunova},
     title = {Formal {Kinetic} {Model} of {Structureless} {Small-grained} {Parallelism}},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {239--256},
     year = {1999},
     volume = {2},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_1999_2_3_a3/}
}
TY  - JOUR
AU  - Katya O. Gorbunova
TI  - Formal Kinetic Model of Structureless Small-grained Parallelism
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 1999
SP  - 239
EP  - 256
VL  - 2
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/SJVM_1999_2_3_a3/
LA  - ru
ID  - SJVM_1999_2_3_a3
ER  - 
%0 Journal Article
%A Katya O. Gorbunova
%T Formal Kinetic Model of Structureless Small-grained Parallelism
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 1999
%P 239-256
%V 2
%N 3
%U http://geodesic.mathdoc.fr/item/SJVM_1999_2_3_a3/
%G ru
%F SJVM_1999_2_3_a3

Voir la notice de l'article provenant de la source Math-Net.Ru

A new abstract model of parallel calculations – the Kirdin kinetic machine – is suggested. It is expected that this model will play the same role for parallel calculations, as Markov normal algorithms, Kolmogorov and Turing machine or the Post schemes for consecutive calculations. The basic ways of realization of calculations are described in the article, correctness of the elementary programs for the Kirdin kinetic machine is investigated, it is proved that the determined Kirdin kinetic machine is the effective calculator.

[1] Kirdin A. N., “Idealnaya ansamblevaya model parallelnykh vychislenii”, Tez. dokl. V Vseross. seminara “Neiroinformatika i ee prilozheniya”, KGTU, Krasnoyarsk, 1997, 101

[2] Gorbunova E. O., “Analiz prosteishikh programm dlya idealnoi ansamblevoi modeli parallelnykh vychislenii”, Tez. dokl. Tretego sibirskogo kongressa po prikladnoi i industrialnoi matematike (INPRIM-98), Izd-vo Instituta matematiki, Novosibirsk, 1998, 77

[3] Gorbunova E. O., “Finitnost i determinirovannost prostykh programm dlya kineticheskoi mashiny Kirdina”, Metody neiroinformatiki. Sb. nauchn. trudov, eds. A. N. Gorban, KGTU, Krasnoyarsk, 1998, 23–40

[4] Gorbunova E. O., “K voprosu ob algoritmicheskoi universalnosti kineticheskoi mashiny Kirdina”, Tez. dokl. VI Vseross. seminara “Neiroinformatika i ee prilozheniya”, KGTU, Krasnoyarsk, 1998, 47–48

[5] Markov A. A., Nagornyi N. M., Teoriya algorifmov, Nauka, M., 1984 | MR

[6] Uspenskii V. A., Semenov A. L., Teoriya algoritmov: osnovnye otkrytiya i prilozheniya, Nauka, M., 1987, Bibl-ka programmista | MR

[7] Gorban A. N., Rossiev D. A., Neironnye seti na personalnom kompyutere, Nauka, Novosibirsk, 1996 | MR

[8] Latkin E. I., “SCAM: khimicheskii kompyuter”, Teoriya vychislenii i yazyki spetsifikatsii, Vychislitelnye sistemy, 152, Novosibirsk, 1995, 140–151 | MR | Zbl

[9] Achasova S. M., Bandman O. L., Korrektnost parallelnykh vychislitelnykh protsessov, Nauka. Sib. Otd-nie, Novosibirsk, 1990 | MR | Zbl

[10] D. Dasgupta (ed.), Artificial Immune Systems and Their Applications, Springer, 1998