Results 241 to 250 of about 88,794 (289)

Fast complete memory consistency verification

open access: yes2009 IEEE 15th International Symposium on High Performance Computer Architecture, 2009
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new natural partial order: time order. In multiprocessor systems with store atomicity, a time order restriction exists between two operations whose pending periods are disjoint: the
Yunji Chen   +6 more
openaire   +2 more sources

Linear Time Memory Consistency Verification

IEEE Transactions on Computers, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weiwu Hu, Yunji Chen
exaly   +3 more sources

Fast execution for circuit consistency verification

The Integration VLSI Journal, 1986
Abstract In this paper, a fast solution for circuit consistency verification is investigated. It is an efficient algorithm that is implemented to compare the extracted layout data with the originally designed data. A special partitioning method is guided by the circuit philosophy. This method has two major features over other techniques.
J F Wang
exaly   +2 more sources

Program Regularization in Memory Consistency Verification

IEEE Transactions on Parallel and Distributed Systems, 2012
A widely adopted methodology for verifying the memory subsystem of a Chip Multiprocessor (CMP) is to verify executions of parallel test programs on the CMP against the given memory consistency model, which has been long known to be time consuming in both theory and practice.
Yunji Chen, Weiwu Hu
exaly   +2 more sources

Improving the consistency verification and the quality of multimedia presentations

International Journal of Critical Computer-Based Systems, 2011
We propose in this paper a formal methodology that improves the temporal consistency verification of multimedia presentations. It extends the standard approaches to check over inconsistencies due to output resource conflicts. This goal is achieved thanks to the definition of a new model that extends time Petri net to preemptor hyperarcs.
Abdelkrim Abdelli
exaly   +2 more sources

Home - About - Disclaimer - Privacy