Fast and Generalized Polynomial Time Memory Consistency Verification

Details Fast and Generalized Polynomial Time Memory Consistency Verification Fast and Generalized Polynomial Time Memory Consistency Verification

2006-05-09

arxiv.org/abs/cs/0605039v4

Computer Science

Hardware Architecture

To appear in the proceedings of Computer Aided Verification (CAV) 2006

Scientific paper

The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are often used in practice for microprocessor verification. We present a low complexity and fully parallelized algorithm to check program execution against the processor consistency model. In addition our algorithm is general enough to support a number of consistency models without any degradation in performance. An implementation of this algorithm is currently used in practice to verify processors in the post silicon stage for multiple architectures.

Affiliated with

Also associated with

No associations

Rating

Fast and Generalized Polynomial Time Memory Consistency Verification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast and Generalized Polynomial Time Memory Consistency Verification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast and Generalized Polynomial Time Memory Consistency Verification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675169