NIST(National Institute of Standards and Technology) statistical test recognized as the most authoritative is widely used in verifying the randomness of binary sequences. The Non-overlapping Template Matching Test as ...NIST(National Institute of Standards and Technology) statistical test recognized as the most authoritative is widely used in verifying the randomness of binary sequences. The Non-overlapping Template Matching Test as the 7 th test of the NIST Test Suit is remarkably time consuming and the slow performance is one of the major hurdles in the testing process. In this paper, we present an efficient bit-parallel matching algorithm and segmented scan-based strategy for execution on Graphics Processing Unit(GPU) using NVIDIA Compute Unified Device Architecture(CUDA). Experimental results show the significant performance improvement of the parallelized Non-overlapping Template Matching Test, the running speed is 483 times faster than the original NIST implementation without attenuating the test result accuracy.展开更多
The stability and robustness of routing protocol implementations (RPI) in a router are becoming more and more important with the growth of Internet scale. A novel approach named stress testing is proposed to test the ...The stability and robustness of routing protocol implementations (RPI) in a router are becoming more and more important with the growth of Internet scale. A novel approach named stress testing is proposed to test the properties of RPI. Compared with some traditional test techniques, stress testing is remarkably necessary to inspect and analyze RPI. The test environment is proposed and the test process of OSPF RPI is illustrated by a stochastic Petri Net model with large-scale route simulation and OSPF protocol emulation. Based on this model, the integrated performance tester (IP-TEST) is designed and developed, with which we test a CISCO2600 router. With mathematical methods, we find that the computational complexity of OSPF implementation in this router is O((lnN) 4)to the number of its routing table entries. This experiment shows that this technique can inspect the stability, the computational complexity and the scalability of RPI. Furthermore, it can also be widely used with other routing protocols, such as RIP and BGP.展开更多
基金supported in part by Shanxi Scholarship Council of China(Grant No.2017-key-2)the Natural Science Foundation of Shanxi Province(Grant No.201801D121145)+1 种基金the Natural Science Foundation of China(NSFC)(Grant No.61731014,61705157,61927811)the Program for Guangdong Introducing Innovative and Entrepreneurial Teams。
文摘NIST(National Institute of Standards and Technology) statistical test recognized as the most authoritative is widely used in verifying the randomness of binary sequences. The Non-overlapping Template Matching Test as the 7 th test of the NIST Test Suit is remarkably time consuming and the slow performance is one of the major hurdles in the testing process. In this paper, we present an efficient bit-parallel matching algorithm and segmented scan-based strategy for execution on Graphics Processing Unit(GPU) using NVIDIA Compute Unified Device Architecture(CUDA). Experimental results show the significant performance improvement of the parallelized Non-overlapping Template Matching Test, the running speed is 483 times faster than the original NIST implementation without attenuating the test result accuracy.
文摘The stability and robustness of routing protocol implementations (RPI) in a router are becoming more and more important with the growth of Internet scale. A novel approach named stress testing is proposed to test the properties of RPI. Compared with some traditional test techniques, stress testing is remarkably necessary to inspect and analyze RPI. The test environment is proposed and the test process of OSPF RPI is illustrated by a stochastic Petri Net model with large-scale route simulation and OSPF protocol emulation. Based on this model, the integrated performance tester (IP-TEST) is designed and developed, with which we test a CISCO2600 router. With mathematical methods, we find that the computational complexity of OSPF implementation in this router is O((lnN) 4)to the number of its routing table entries. This experiment shows that this technique can inspect the stability, the computational complexity and the scalability of RPI. Furthermore, it can also be widely used with other routing protocols, such as RIP and BGP.
