In this paper we categorize the coherence traffic in update-based protocols and show that, for most applications, more than 90% of all updates generated by the protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These tech...

We present a first attempt in applying a genetic algorithm for checking the correctness of communication protocols (expressed as a pair of communicating FSMs). The GA measures the fitness of a given string by making use of a protocol simulator. Every string in the population is a trace of the execution of the protocol. The simulator evaluates the trace by running it, provoking changes and messa...

Non-volatile memory cells are exposed to adversary attacks since any active countermeasure is useless when the device powered off. In this context, work proposes association of two serial RRAM devices as a basic cell store sensitive data, which could solve bothersome problem. This has three states: ‘1’, ‘0’, and masked. When system off or data not used, set masked state, where still stores ‘1’ ...

Recently, a variety of new measures of quantum Rényi mutual information and quantum Rényi conditional entropy have been proposed, and some of their mathematical properties explored. Here, we show that the Rényi mutual information attains operational meaning in the context of composite hypothesis testing, when the null hypothesis is a fixed bipartite state and the alternate hypothesis consists o...

Cache coherence protocols for shared-memory multiprocessors use invalidations or updates to maintain coherence across processors. Although invalidation protocols usually produce higher miss rates, update protocols typically perform worse. Detailed simulations of these two classes of protocol show that the excessive network traac caused by update protocols signiicantly degrades performance , eve...