Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications

Authors: Singhi N.M.¹; Shriniwas I.²; Antony T.A.³

Source: European Journal of Combinatorics, Volume 17, Number 2-3, February 1996 , pp. 97-111(15)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

The main objective of this contribution is to outline briefly, a set of interesting problems in computer science that involve the use of combinatorial objects and techniques. We also present our results for the case of fault-tolerance in hypercube-based parallel computer architectures, where we show the involvement of t- designs and t- covers in the structure of extremal fault-sets, which is useful in the construction of fault-tolerant m- partitions of the n- cube.

Language: English

Document Type: Miscellaneous

Affiliations: 1: School of Mathematics, Tata Institute of Fundamental Research, Bombay 4, India 2: Department of Computer Technology, Victoria Jubilee Technical Institute, Bombay 19, India 3: Research and Development Division, Progressive Science Information Pvt. Ltd, Bombay 50, India

Publication date: 1996-02-01