Brief announcement: program regularization in verifying memory consistency

Authors:
Lei Li;Tianshi Chen;Yunji Chen;Ling Li;Cheng Qian;Weiwu Hu
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, P.R.China, Beijing, China
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 3
Cited 0

On testing cache-coherent shared memories

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Testing Shared Memories

SIAM Journal on Computing
Linear Time Memory Consistency Verification

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Verifying memory consistency, which is to verify the executions of parallel test programs on a multiprocessor system against the given memory consistency model, is NP-hard. To accelerate verifying memory consistency in practice, we devise a technique called "program regularization". The key intuition behind program regularization is that a parallel program with some specific patterns can enable efficient verification. More specifically, for any original program, program regularization introduces some auxiliary memory locations, and periodically inserts store/load operations accessing these locations to the original program. With the regularized program, verifying memory consistency only requires a linear time complexity (with respect to the number of memory operations).