Transparent memory tests with even repeating addresses for storage devices

The urgency of the problem of memory testing of modern computing systems is shown. Mathematical models describing the faulty states of storage devices and the methods used for their detection are investigated. The concept of address sequences (pA) with an even repetition of addresses is introduced, which are the basis of the basic element included in the structure of the new transparent march tests March _pA_1 and March _pA_2. Algorithms for the formation of such sequences and examples of their implementations are given. The maximum diagnostic ability of new tests is shown for the case of the simplest faults, such as constant (SAF) and transition faults (TF), as well as for complex pattern sensitive faults (PNPSFk). There is a significantly lower time complexity of the March_pA_1 and March_pA_2 tests compared to classical transparent tests, which is achieved at the expense of less time spent on obtaining a reference signature. New distance metrics are introduced to quantitatively compare the effectiveness of the applied pA address sequences in a single implementation of the March_pA_1 and March_pA_2 tests. The basis of new metrics is the distance D(A(j), pA) determined by the difference between the indices of repeated addresses A(j) in the sequence pA. The properties of new characteristics of the pA sequences are investigated and their applicability is evaluated for choosing the optimal test pA sequences that ensure the high efficiency of new transparent tests. Examples of calculating distance metrics are given and the dependence of the effectiveness of new tests on the numerical values of the distance metrics is shown. As well as in the case of classical transparent tests, multiple applications of new March_pA_1 and March_pA_2 tests are considered. The characteristic V(pA) is introduced, which is numerically equal to the number of different values of the distance D(A(j), pA) of addresses A(j) of the sequence pA. The validity of analytical estimates is experimentally shown and high efficiency of fault detection by the tests March_pA_1 and March_pA_2 is confirmed by the example of coupling faults for p = 2.

1. Sharma A. K. Advanced Semiconductor Memories: Architectures, Designs, and Applications. London, John Wiley & Sons, 2003, 652 р.

2. Pan W., Li Z., Zhang Y., Weng C. The new hardware development trend and the challenges in data management and analysis. Data Science and Engineering, 2018, vol. 6, no. 3, pp. 263-276.

3. Prince B. High-Performance Memories: New Architecture DRAM's and SRAM’s, Evolution and Function. London, John Wiley & Sons, 1999, 354 p.

4. Goor A. J. Testing Semiconductor Memories: Theory and Practice. Chichester, UK, John Wiley & Sons, 1991, 536 p.

5. Yarmolik S. V., Zankovich A. P., Ivaniuk A. A. Marshevue testu dlya samotestirovaniya OZU. RAM SelfTest March Tests. Minsk, Bestprint, 2009, 270 р. (In Russ.).

6. Du X. New Memory BIST and Repair Methods. Iowa, University of Iowa, 2004, 276 р.

7. Chakraborty A. Fault-Tolerance and Reliability Techniques for High-Density Random-Access Memories. Prentice Hall, 2002, 448 p.

8. Nicolaidis M. Theory of transparent BIST for RAMs. IEEE Transactions on Computers, 1996, vol. 45, no. 10, pp. 1141-1156.

9. Yarmolik V. N., Murashko I. A., Kummert A., Ivaniuk A. A. Nerazrushayuschee testirovanie zapominayuschih ustroistv. Transparent Memory Testing. Minsk, Bestprint, 2005, 230 р. (In Russ.).

10. Yarmolik V. N., Zankovich A. P. Overview of transparent testing methods for RAM. Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioelektroniki [Reports of the Belarusian State University of Informatics and Radioelectronics], 2005, no. 4(12), pp. 62-72 (In Russ.).

11. Yarmolik S. V., Yarmolik V. N. Multiple non-destructive marching tests with variable address sequences. Avtomatika i telemehanika [Automation and Remote], 2007, no. 4, рр. 126-137 (In Russ.).

12. Yarmolik V. N., Yarmolik S. V. Address sequences for repeated testing of RAM. Informatika [Informatics], 2014, no. 2(39), рр. 124-136 (In Russ.).

13. Yarmolik V. N., Yarmolik S. V. Modified gray and counter sequences for memory test address generation. Proceedings of the 13th International Conference MIXDES Design of Integrated Circuits and Systems, Gdynia, Poland, 22-24 June 2006. Gdynia, 2006, pp. 572-576.

14. Goor A. J., Kukner H., Hamdioui S. Optimizing memory BIST Address Generator implementations. Proceedings of the 2011 6th International Conference on Design & Technology of Integrated Systems in Nanoscale Era (DTIS), Athens, Greece, 6-8 April 2011. Athens, 2011, pp. 572-576.

15. Yarmolik S. V., Yarmolik V. N. Quasi-random testing of computing systems. Informatika [Informatics], 2013, no. 3(39), рр. 92-103 (In Russ.).

16. Savage C. A survey of combinatorial Gray code. SIAM Review, 1997, vol. 39, no. 4, pp. 605-629.

17. Chi H., Jones E. I. Computational investigations of quasi-random sequences in generating test cases for specification-based tests. Proceedings of the Winter Simulation Conference WSC 2006, Monterey, California, USA, 3-6 December 2006. Monterey, 2006, pp. 975-980.

18. Chen T. Y., Merkel R. Quasi-random testing. IEEE Transaction on Reliability, 2007, vol. 56, no. 3, pp. 562-568.

19. Yarmolik S. V. Address sequences and backgrounds with different hamming distance for multiple run March tests. IEEE International Journal of Applied Mathematics and Computer Science, 2008, vol. 18, no. 3, pp. 329-339.

20. Yarmolik S. V., Kurbatski A. N., Yarmolik V. N. Dissimilarity measure analysis for random access memory testing. Informatika [Informatics], 2008, no. 3(19), рр. 90-98 (In Russ.).

21. Thompson A. C. Minkowski Geometry. Cambridge, New York, 1996, 364 p.

22. Tubbs J. D. Note on binary template matching. Pattern Recognition, 1989, vol. 22, no 4, pp. 359-365.

23. Sokol B., Mrozek I., Yarmolik V. N. Impact of the address changing on the detection of pattern sensitive faults. Information Processing and Security Systems, London, Springer Science + Business Media, Inc., 2005, pp. 217-226.

24. Zhou Z. Q. Using coverage information to guide test case selection in adaptive random testing. Proceedings 34th IEEE Computer Soft and Applications Conference, Seoul, Korea, 19-23 July 2010. Seoul, 2010, pp. 208-213.

25. Chan K. P., Chen T. Y., Towey D. Good random testing. Proceedings 9th Ada-Europe International Conference on Reliable Software Technologies (LNCS), Palma de Mallorca, Spain, 14-18 June 2004. Palma de Mallorca, 2004, pp. 200-212.

26. Kuo F. C. An in-depth study of mirror adaptive random testing. Proceedings 14th European Conference on Soft Quality, Los Alamitos, CA, USA. Los Alamitos, 2009, pp. 51-58.

27. Shiyi Xu. Orderly random testing for both hardware and software. Proceedings Pacific Rim International Symposium on Dependable Computing, Taipei, Taiwan, 15-17 December 2008. Taipei, 2008, pp. 160-167.

28. Yarmolik S. V., Yarmolik V. N. Controlled random testing. Informatika [Informatics], 2011, no. 1(29), рр. 79-88 (In Russ.).

29. Yarmolik V. N., Levantsevich V. A., Mrozek I. Multiple controlled probability tests. Informatika [Informatics], 2015, no. 2(12), рр. 63-76 (In Russ.).