### Abstract

A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems (for instance, the traveling salesman problem) for which no efficient optimal algorithm is known. The authors tested their algorithm for 5-, 6-, 7-, 8-, and 9-site examples and compared the vote assignments produced by it with those produced by an optimal algorithm based on solving an integer programming model. The results produced by the randomized algorithm were remarkably close to those produced by the optimal one.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - International Conference on Distributed Computing Systems |

Editors | Anon |

Publisher | Publ by IEEE |

Pages | 412-419 |

Number of pages | 8 |

ISBN (Print) | 0818621443 |

State | Published - May 1 1991 |

Event | Proceedings of the 11th International Conference on Distributed Computing Systems - Arlington, TX, USA Duration: May 20 1991 → May 24 1991 |

### Publication series

Name | Proceedings - International Conference on Distributed Computing Systems |
---|

### Other

Other | Proceedings of the 11th International Conference on Distributed Computing Systems |
---|---|

City | Arlington, TX, USA |

Period | 5/20/91 → 5/24/91 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

*Proceedings - International Conference on Distributed Computing Systems*(pp. 412-419). (Proceedings - International Conference on Distributed Computing Systems). Publ by IEEE.

}

*Proceedings - International Conference on Distributed Computing Systems.*Proceedings - International Conference on Distributed Computing Systems, Publ by IEEE, pp. 412-419, Proceedings of the 11th International Conference on Distributed Computing Systems, Arlington, TX, USA, 5/20/91.

**A randomized voting algorithm.** / Kumar, Akhil.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A randomized voting algorithm

AU - Kumar, Akhil

PY - 1991/5/1

Y1 - 1991/5/1

N2 - A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems (for instance, the traveling salesman problem) for which no efficient optimal algorithm is known. The authors tested their algorithm for 5-, 6-, 7-, 8-, and 9-site examples and compared the vote assignments produced by it with those produced by an optimal algorithm based on solving an integer programming model. The results produced by the randomized algorithm were remarkably close to those produced by the optimal one.

AB - A randomized algorithm for vote assignment is described. Given a collection of sites where copies of a file are replicated, and the individual site reliabilities, the algorithm assigns votes to sites so as to maximize overall availability. It is based on the concept of simulated annealing which has been successfully applied for various complex problems (for instance, the traveling salesman problem) for which no efficient optimal algorithm is known. The authors tested their algorithm for 5-, 6-, 7-, 8-, and 9-site examples and compared the vote assignments produced by it with those produced by an optimal algorithm based on solving an integer programming model. The results produced by the randomized algorithm were remarkably close to those produced by the optimal one.

UR - http://www.scopus.com/inward/record.url?scp=0026160390&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026160390&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026160390

SN - 0818621443

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 412

EP - 419

BT - Proceedings - International Conference on Distributed Computing Systems

A2 - Anon, null

PB - Publ by IEEE

ER -