#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2010

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Meghanad D. Wagh, Khadidja Bendjilali
- 2010 Ninth International Symposium on Parallel…
- 2010

This paper obtains all the automorphisms of a wrapped Butterfly network of degree n using an algebraic model. It also investigates the translation of butterfly edges by automorphisms. It proposes a new strategy for algorithm mappings on an architecture with faulty edges. This strategy essentially consists of finding an automorphism that would map the faulty… (More)

Mapping an algorithm to an architecture with faults is an important problem in parallel processing. This paper deals with wrapped butterfly architectures with edge faults. We investigate the effect of automorphisms of a wrapped butterfly on its edges. Given a fault set, one can then choose an appropriate automorphism to map the algorithm to use only… (More)

- Meghanad D. Wagh, Khadidja Bendjilali
- 2011 IEEE International Conference on High…
- 2011

Interconnection networks often constrain the performance of multi-cores chips or parallel computers. Cube Connected Cycles (CCC) is an attractive interconnection network because of its symmetry, small constant node degree and a small diameter. This paper develops an algebraic model for the CCC using the direct product of a cyclic group and a finite field.… (More)

- ‹
- 1
- ›