Advertisement

Journal of Electronic Testing

, Volume 12, Issue 3, pp 171–185 | Cite as

An Implementation Approach of the IEEE 1149.1 for the Routing Test of a VLSI Massively Parallel Architecture

  • C. Aktouf
  • C. Robach
  • A. Marinescu
  • G. Mazare
Article

Abstract

This paper presents an implementation approach for the test of routers in a fine grain massively parallel architecture. First, an ad hoc test technique which diffuses test messages router by router is analyzed. Even though the technique does not add hardware, it is shown inefficient and not applicable due to practical constraints such as the limited number of pins of the chip implementing the machine. Based on a hierarchical implementation of the IEEE 1149.1 standard, two approaches are proposed and compared in terms of the area overhead, the overall test time and the flexibility in applying tests and diagnosing the routers inside the machine. The basic idea for both approaches is to construct groups of basic cells which are driven by the same test block and compare their test results after the same test vectors are applied at each cell input. The two approaches differ in the granularity of a basic cell. The choice of an implementation approach is not trivial. It is shown that each approach presents better performance than the other, that is, the approach which allows better fault coverage and less test time requires more silicon and less diagnostic possibilities compared to the second approach.

MIMD architectures routing test IEEE 1149.1 built-in self-test diagnosis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L.R. Goke and G.L. Lipovski, “Banyan Networks for Partitioning Multiprocessor Systems,” Proc. of the First Annual Computer Architecture Conference, 1973, pp. 21–28.Google Scholar
  2. 2.
    “Fine-Grain Concurrent Computation,” Caltech Computer Science TR. 5242: TR. 87.Google Scholar
  3. 3.
    P.M. Kogge, “Execube—A New Architecture for Scalable mpps,” Proc. of the International Conference on Parallel Processing, 1994, pp. 77–84.Google Scholar
  4. 4.
    C. Aktouf, G. Mazaré, and C. Robach, “Memory Testing in a Massively Parallel Machine,” Microprocessing and Microprogramming: The Euromicro Journal, Vol. 38, Nos. 1–5, pp. 245–252, Sept. 1993.Google Scholar
  5. 5.
    C. Aktouf, C. Robach, J. Johansson, and G. Mazaré, “Functional Testing and Reconfiguration of Massively MIMD Machines,” Proc. of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, 1993, pp. 72–79.Google Scholar
  6. 6.
    C.M. Maunder and R.E. Tulloss, “The Test Access Port and Boundary-Scan Architecture,” IEEE Computer Society Press, 1990.Google Scholar
  7. 7.
    D. Landis and P. Singh, “Optimal Placement of IEEE 1149.1 Port and Boundary-Scan Resources for Wafer Scale Integration,” Proc. of the International Test Conference, 1990, pp. 120–126.Google Scholar
  8. 8.
    D. Landis, “A Self-Test System Architecture for Reconfigurable WSI,” Proc. of the International Test Conference, 1989, pp. 275–281.Google Scholar
  9. 9.
    Y. Zorian, “A Structured Approach to Complex VLSI Test Using BIST and Boundary-Scan,” Proc. of ATE West Symposium, 1990, p. 69.Google Scholar
  10. 10.
    C. Aktouf, Y. Latrous, and G. Mazaré, “Asynchronous Processor Network: The Project of the Polytechnique Institute of Grenoble,” Supercomputer Journal, Vol. XII-2, pp. 20–25, 1996.Google Scholar
  11. 11.
    C. Aktouf, C. Robach, and A. Marinescu, “A Routing Testing of a VLSI Massively Parallel Machine Based on IEEE 1149.1,” Proc. of the International Test Conference, Washington, 1995, pp. 781–788.Google Scholar
  12. 12.
    F. Boiteux and M. Robichon, “Réalisation d'une Interface Matérielle et Logicielle Entre un Ordinateur Hôte Macintosh II et un Réseau Parallèle Cellulaire,” Master report, ENSIMAGENSERG, June 1991.Google Scholar
  13. 13.
    C.M. Maunder and R.E. Tulloss, “An Introduction to the Boundary-Scan Standard: ANSI/IEEE Std. 1149.1,” Journal of Electronic Testing: Theory and Applications, Vol. 2, pp. 27–41, 1991.Google Scholar
  14. 14.
    A. Dahbura and M.U. Uyar, “An Optimal Test Sequence for the JTAG/IEEE P.1149.1 Test Access Port Controller,” Proc. of the International Test Conference, 1989, pp. 55–62.Google Scholar
  15. 15.
    K.E. Batcher, “Sorting Networks and their Applications,” Proc. of AFIPS, 1968, pp. 307–314.Google Scholar
  16. 16.
    T. Sheu, C. Das, and M. Irwin, “Distributed Fault Diagnosis in the Butterfly Parallel Processor,” Proc. of the International Conference on Parallel Processing, 1989, pp. 172–175.Google Scholar
  17. 17.
    C. Aktouf, G. Mazaré, C. Robach, and R. Velazco, “A Practical Approach for the Diagnosis of MIMD Network,” Proc. of the First Asian Test Symposium, 1992, pp. 387–390.Google Scholar
  18. 18.
    V.K. Agarwal, B. Nadeau-Dostie, and Ph.S. Wilcox, “A Scanbased BIST Technique Using Pair-wise Compare of Identical Components,” Proc. of the International Test Conference, 1991, pp. 225–230.Google Scholar
  19. 19.
    A. Marinescu, “Test de Routage d'une Architecture Massivement Parallèle Basée sur le Boundary-Scan,” Master's thesis, Laboratoire de Gènie Informatique, Grenoble, France, July 1994.Google Scholar
  20. 20.
    W. Dally et al., “The J-Machine: A Fine Grain Concurent Computer,” Proc. of the IFIP Congress, 1989, pp. 1147–1153.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • C. Aktouf
    • 1
  • C. Robach
    • 1
  • A. Marinescu
    • 1
  • G. Mazare
    • 1
  1. 1.LCIS-INPG-50Valence Cedex 9France

Personalised recommendations