Hill-climbing heuristics for optimal hardware dimensioning and software allocation in fault-tolerant distributed systems

Author

Distante, Fausto ; Piuri, Vincenzo

Author_Institution

Politecnico di Milano, Italy

Volume

38

Issue

1

fYear

1989

fDate

4/1/1989 12:00:00 AM

Firstpage

28

Lastpage

39

Abstract

An optimum distributed architecture with fault-tolerance capabilities for a given software application may be obtained by allowing allocation algorithms to evolve without any existing-hardware constraint. Distributed software partitioning and allocation is done using the simulated annealing optimization algorithm. To define the cost function used by the optimization algorithm, a model for interacting processes constituting the software application is presented. Tuning of algorithm parameters has been considered to assure convergence at a reasonable cost in terms of computation time

Keywords

distributed processing; fault tolerant computing; optimisation; convergence; cost function; distributed software partitioning; fault-tolerant distributed systems; hill climbing heuristics; interacting processes; optimal hardware dimensioning; simulated annealing optimization algorithm; software allocation; Application software; Computational modeling; Computer architecture; Convergence; Cost function; Fault tolerance; Hardware; Partitioning algorithms; Simulated annealing; Software algorithms;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.24571

Filename

24571