Reduction of the total execution time to achieve the optimal k-node reliability of distributed computing systems using a novel heuristic algorithm

  • Authors:

  • Chin-Ching Chiu;Yi-Shiung Yeh;Ruey-Shun Chen

  • Affiliations:

  • Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan;Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan;Institute of Information Management, Institute of Computer Science and Information Engineering, Hsinchu, Taiwan

  • Venue:
  • Computer Communications
  • Year:
  • 2000

Quantified Score

Hi-index 0.24

Visualization

Abstract

A distributed computing system is a collection of processor-memory pairs connected by communication links. A k-node set is a subset of total nodes in a distributed computing system. A k-node set with capacity constraint is a k-node set that possesses sufficient node capacity. Because computing the reliability of a distributed computing system is generally an NP-hard problem, an adequate k-node set with a given capacity constraint must be determined by an effective algorithm with an approximate reliability. Relatively few investigations, namely an exact method and a k-tree reduction method, have examined k-node reliability optimization with capacity constraint. Such investigations either spent an exponential time or rarely obtained an optimal solution. Therefore, in this work, we present a novel heuristic algorithm to reduce the computational time and deviation from an exact solution. The proposed algorithm has simple independent steps, including selection of k-node sets according to a node's weight or a link's weight. The number of selected k-node sets is either one or two, thereby spending less time to compute the reliability of k-node sets. Computational results demonstrate that the proposed algorithm is more effective and provides a better solution for a large distributed computing system than those in previous investigations.