A novel memory consistency model for thousand-core processors is presented. The model simplifies cache coherence for the full chip, and reduces cache design complexity. In addition, the model has the ability to descri...
详细信息
This article uses the vector space model to express microblogging text in quantity, via the cosine of the angle of text clustering method to calculate the similarity between the text. We can generate alternative micro...
详细信息
Compared with traditional Hardware Design Languages (HDL) programming, High-Level Synthesis (HLS) can reduce the design difficulty of reconfigurable system. Most HLS tools target for systems on programmable chips, and...
详细信息
Fuzz testing is an important way of vulnerability discovery, however, the existing fuzzers based on symbolic execution and others have inherent shortcomings like needing more computing resource, in-depth analysis and ...
详细信息
ISBN:
(纸本)9781849199094
Fuzz testing is an important way of vulnerability discovery, however, the existing fuzzers based on symbolic execution and others have inherent shortcomings like needing more computing resource, in-depth analysis and so on. To solve above problems, this paper presents a smart fuzzing method based on Markov chain. Firstly, this method optimizes the testing input sample to get the minimal sample set. Secondly, this method records program execution information by using instrument, and makes a Markov model about state. Finally, this method uses Markov chain to detect the change of execution path, and leads tester to choose better samples to mutate. Meanwhile, we analyse mutation strategies in depth for better triggering exception. Experimental data shows that the presented method can help fuzzer to generate effective test samples. We discovers 51 vulnerabilities in software like WPS, along with the code coverage increases of nearly 49% comparing with zzuf and the average exception discovery rate increase nearly 9 times comparing with MiniFuzz.
In this paper, we partly determine the cycle structure of two types of Nonlinear feedback shift registers(NFSRs). Based on these results, the cycle structure of a class of NFSRs with symmetric feedback functions can b...
详细信息
In this paper, we partly determine the cycle structure of two types of Nonlinear feedback shift registers(NFSRs). Based on these results, the cycle structure of a class of NFSRs with symmetric feedback functions can be completely characterized. Furthermore, an alternative proof of Kjeldsen’s results is presented. Compared with the original proof based on abstract algebra theory, ours is straightforward and easy to understand.
Replacement and substitution encryption are two basic types of encryption historically. The classical encryption algorithm has been compromised now, but they still can play special role for modern cryptology. For exam...
详细信息
We experimentally simulate the spin networks—a fundamental description of quantum spacetime at the Planck level. We achieve this by simulating quantum tetrahedra and their interactions. The tensor product of these qu...
详细信息
Chip multiprocessor presents brand new opportunities for holistic on-chip data and coherence management solutions. An intelligent protocol should be adaptive to the fine-grain accessing behavior. And in terms of stora...
详细信息
Chip multiprocessor presents brand new opportunities for holistic on-chip data and coherence management solutions. An intelligent protocol should be adaptive to the fine-grain accessing behavior. And in terms of storage of metadata, the size of conventional directory grows as the square of the number of processors, making it very expensive in large-scale systems. In this paper, we propose a metadata cache framework to achieve three goals: 1) reducing the latency of data access and coherence activities, 2) saving the storage of metadata, and 3) providing support for other optimization techniques. The metm:lata is implemented with compact structures and tracks the dynamically changing access pattern. The pattern information is used to guide the delegation and replication of decoupled data and metadata to allow fast access. We also use our metadata cache as a building block to enhance stream prefetching. Using detailed execution-driven simulation, we demonstrate that our protocol achieves an average speedup of 1.12X compared with a shared cache protocol with 1/5 of the storage of metadata.
暂无评论