Stochastic Analysis of Solving Complex Problem on Distributed Computer

Author

Pavsky, Kirill V.

Author_Institution

Comput. Syst. Lab., Inst. of Semicond., Novosibirsk

fYear

2006

fDate

13-17 Sept. 2006

Firstpage

271

Lastpage

274

Abstract

The analysis of time and readability of parallel solving complex problems on distributed computer systems (CS) is presented. The derivation of equation for calculating the efficiency indices is based on the assumption that the time of problem solution on CS is a function of time of problem solution on one elementary machine, and the function has a finite number of discontinuities. The discontinuities have the probabilistic character and correspond to the CS failures that require reconfiguration of the CS (structure readjustability with regard to working machine only). A notion of complex CS reconfiguration is introduced and the reconfiguration is investigated. A set of integral equations for calculating the function of realizability of problem solution on distributed CSs is derived. A parallel algorithm for its computing is described

Keywords

parallel algorithms; probability; reliability theory; stochastic processes; CS failures; distributed computer systems; integral equations; parallel algorithm; stochastic analysis; Cascading style sheets; Concurrent computing; Distributed computing; Integral equations; Laboratories; Parallel processing; Power system reliability; Robustness; Stochastic processes; Stochastic systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Conference_Location

Bialystok

Print_ISBN

0-7695-2554-7

Type

conf

DOI

10.1109/PARELEC.2006.75

Filename

1698672