@inproceedings{6caf35c0c3ef4b92903da9b56f695a24,
title = "The complexity of sequential consistency",
abstract = "Sequential consistency is the most-widely used correctness condition for multiprocessor memory systems. This paper explores the complexity of deciding whether an execution of a shared-memory multiprocessor is sequentially consistent. We present the first results showing the NP-completeness of this problem, even for short programs or small machines. We also explore possible augmentations to the memory system: a fast decision algorithm is presented for such an augmented shared memory.",
author = "Gibbons, {Phillip B.} and Ephraim Korach",
note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992 ; Conference date: 01-12-1992 Through 04-12-1992",
year = "1992",
month = jan,
day = "1",
doi = "10.1109/SPDP.1992.242728",
language = "English",
series = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "317--325",
booktitle = "Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992",
address = "United States",
}