Bounding the Size of k-Tuple Covers

Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai,Aj) of applications and every pair (p,q) of processors, there is an assignment f in S that maps (Ai,Aj) to (p,q). More generally, we consider, for all k/spl ges/1, minimum size k-tuple covers. We improve bounds given earlier in by Latifi, where the application for k-tuple covers was fault tolerance of the multidimensional star network. Let F(n,k) denote the minimum cardinality k-tuple cover for n applications and processors. We give bounds for F(n,k) that are within a small multiplicative factor of optimum.

[1]  Colin L. Mallows,et al.  Factor-covering designs for testing software , 1998 .

[2]  Ivan Hal Sudborough,et al.  Comparing Star and Pancake Networks , 2002, The Essence of Computation.

[3]  Pradip K. Srimani,et al.  A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network , 1991, ICPP.

[4]  Zevi Miller,et al.  Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group , 1994, IEEE Trans. Computers.

[5]  Jimmy J. M. Tan,et al.  Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..

[6]  Satoshi Fujita.  A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model , 1999, IEEE Trans. Computers.

[7]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[8]  Shahram Latifi.  On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..

[9]  Shahram Latifi,et al.  A study of fault tolerance in star graph , 2007, Inf. Process. Lett..

[10]  J. S. Hunter,et al.  Statistics for Experimenters: Design, Innovation, and Discovery , 2006 .

[11]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[12]  Selim G. Akl,et al.  On some combinatorial properties of the star graph , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).

[13]  Nader Bagherzadeh,et al.  Embedding an Arbitrary Binary Tree into the Star Graph , 1996, IEEE Trans. Computers.

[14]  D J Evans,et al.  Parallel processing , 1986 .

[15]  Martin Aigner,et al.  Proofs from THE BOOK , 1998 .