A lock-based cache coherence protocol for scope consistency
Directory protocols are widely adopted to maintain cache coherence of distributed shared memory multiprocessors. Although scalable to a certain extent, directory protocols are complex enough to prevent it from being used in very large scale ...
A framework of memory consistency models
Previous descriptions of memory consistency models in shared-memory multiprocessor systems are mainly expressed as constraints on the memory access event ordering and hence are hardware-centric. This paper presents a framework of memory ...
Out-of-order execution in sequentially consistent shared-memory systems: Theory and experiments
Traditional implementation of sequential consistency in shared-memory systems requires memory accesses to be globally performed in program order. Based on an event ordering model for correct executions in shared-memory systems, this paper proposes ...
Parallel implementation of linear algebra problems on Dawning-1000
In this paper, some parallel algorithms are described for solving numerical linear algebra problems on Dwning-1000. They include matrix multiplication,LU factorization of a dense matrix, Cholesky factorization of a symmetric matrix, and ...
Functional-level Fault Simulation with concurrent and parallel mechanisms using object-oriented VLSI model
The functional-level test has been proposed as an alternative to reduce the complexity of test when VLSI gets larger and more complicated. It has been successful for circuits such as memories, PLAs and microprocessors. However, the functional-...
The processing and improvement of multi-statement queries in Chiql
Chiql is a novel Chinese relational database query language for Chinese users. It supports procedural query style in which users can specify a complex database request in multiple simple statements. This facility renders Chiql simple-to-use and ...
Tableau systems for paraconsistency and minimal inconsistency
In this paper, the semantics of a paraconsistent logic and its nonmonotonic extension by minimal inconsistency are presented first. And then signed tableaux for paraconsistent logic and minimal tableaux for logic of minimal inconsistency is ...
Analysis on attribute reduction strategies of rough set
Several strategies for the minimal attribute reduction with polynomial time complexity (O(nk)) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on the discernibility matrix (DM),...
