Kavianpour, A. (2011, June), Testing Strategy in Multiprocessor Systems with Cube Connections  Paper presented at 2011 ASEE Annual Conference & Exposition, Vancouver, BC. 10.18260/1-2--18740

\bibitem{asee_peer_18740}
  Kavianpour, A. (2011, June), \emph{Testing Strategy in Multiprocessor Systems with Cube Connections}
  Paper presented at 2011 ASEE Annual Conference \& Exposition, Vancouver, BC.
  10.18260/1-2--18740

Alireza Kavianpour.  "Testing Strategy in Multiprocessor Systems with Cube Connections".  2011 ASEE Annual Conference & Exposition, Vancouver, BC, 2011, June.  ASEE Conferences, 2011.  https://peer.asee.org/18740 Internet.  24 Apr, 2024

\bibitem{asee_peer_18740}
  Alireza Kavianpour.
  "Testing Strategy in Multiprocessor Systems with Cube Connections".
  \emph{2011 ASEE Annual Conference \& Exposition, Vancouver, BC, 2011, June}.
  ASEE Conferences, 2011.
  https://peer.asee.org/18740 Internet.  24 Apr, 2024

@INPROCEEDINGS{asee_peer_18740
author = "Alireza Kavianpour"
title = "Testing Strategy in Multiprocessor Systems with Cube Connections"
booktitle = "2011 ASEE Annual Conference \& Exposition"
year = "2011"
month = "June"
address = "Vancouver, BC"
publisher = "ASEE Conferences"
note = {https://peer.asee.org/18740}
number = {10.18260/1-2--18740}
}

TY  - CPAPER
AB  -         Testing Strategy in multiprocessor systems with cube connectionsSystem-level testing approach in multi-computer systems in particular hypercube is the subjectstudied in this paper. An n-dimensional hypercube multi-computer system, or an n-cube forshort, contains 2n processors each of which is a self-contained computer with its own localmemory. Each processor is assigned a unique n-bit address. Two processors are linked if andonly if their addresses differ in exactly one bit position. Therefore, each processor has directcommunication links to n other processors. One-step testing of hypercubes which involves onlyone testing phase during which processors test each other is discussed. Two different kinds ofone-step testing are considered: one called the precise one-step testing and studied earlier byother researchers and the other called the pessimistic one-step testing and studied first by authorin the context of application to hypercubes. One of the two main results presented here is thatthe degree of fault tolerance of the n-dimensional hypercube (for short, n-cube), where n > 4,increases from n to 2n-2 as the testing strategy changes from the precise one-step strategy to thepessimistic one-step testing strategy. The other main result is the that if the fault bound, i.e., theupper bound on the possible number of faulty processors, is kept to the same number n in bothcases of precise and pessimistic testing, then the pessimistic strategy requires n/2+1 testing linksper processor whereas the precise strategy requires n testing links per processor. An algorithmfor selecting (n/2+1)*n/2 (2-way) links in an n-cube for use as testing links is presented.
AU  - Alireza Kavianpour
CY  - Vancouver, BC
DA  - 2011/06/26
PB  - ASEE Conferences
TI  - Testing Strategy in Multiprocessor Systems with Cube Connections
UR  - https://peer.asee.org/18740
DO  - 10.18260/1-2--18740
ER  -