Transactional Memory Coherence and Consistency
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
In this paper, we propos a new shared memory model: Transactionalmemory Coherence and Consistency (TCC).TCC providesa model in which atomic transactions are always the basicunit of parallel work, communication, memory coherence, andmemory reference consistency.TCC greatly simplifies parallelsoftware by eliminating the need for synchronization using conventionallocks and semaphores, along with their complexities.TCC hardware must combine all writes from each transaction regionin a program into a single packet and broadcast this packetto the permanent shared memory state atomically as a large block.This simplifies the coherence hardware because it reduces theneed for small, low-latency messages and completely eliminatesthe need for conventional snoopy cache coherence protocols, asmultiple speculatively written versions of a cache line may safelycoexist within the system.Meanwhile, automatic, hardware-controlledrollback of speculative transactions resolves any correctnessviolations that may occur when several processors attemptto read and write the same data simultaneously.The cost of thissimplified scheme is higher interprocessor bandwidth.To explore the costs and benefits of TCC, we study the characterisitcsof an optimal transaction-based memory system, and examinehow different design parameters could affect the performanceof real systems.Across a spectrum of applications, the TCC modelitself did not limit available parallelism.Most applications areeasily divided into transactions requiring only small write buffers,on the order of 4-8 KB.The broadcast requirements of TCCare high, but are well within the capabilities of CMPs and small-scaleSMPs with high-speed interconnects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.223990 · Cited by 3,624
Transaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
Transactional memory: architectural support for lock-free data structures
Herlihy, M., & Moss, J. E. B. (1993) · Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93 · doi:10.1145/165123.165164 · Cited by 2,141
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Sohi, G. S., Breach, S. E., & Vijaykumar, T. N. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.224451 · Cited by 971
Weak ordering—a new definition
Adve, S. V., & Hill, M. D. (1998) · doi:10.1145/285930.285996 · Cited by 450
An evaluation of directory schemes for cache coherence
Agarwal, A. K., Simoni, R., Hennessy, J. L., & Horowitz, M. (1998) · doi:10.1145/285930.285995 · Cited by 420
A low-overhead coherence solution for multiprocessors with private cache memories
Papamarcos, M. S., & Patel, J. H. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285987 · Cited by 405
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1998) · doi:10.1145/285930.285984 · Cited by 395
The potential for using thread-level data speculation to facilitate automatic parallelization
Steffan, J. G., & Mowry, T. C. (2002) · Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.1998.650541 · Cited by 345
Transactional lock-free execution of lock-based programs
Rajwar, R., & Goodman, J. R. (2002) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/605397.605399 · Cited by 344
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1983) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800046.801647 · Cited by 307
Martin, M. M. K., Hill, M. D., & Wood, D. A. (2003) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/859618.859640 · Cited by 275
ARB: a hardware mechanism for dynamic reordering of memory references
Franklin, M., & Sohi, G. S. (1996) · IEEE Transactions on Computers · doi:10.1109/12.509907 · Cited by 259
Gopal, S., Vijaykumar, T. N., Smith, J. E., & Sohi, G. S. (2002) · Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.1998.650559 · Cited by 254
A low-overhead coherence solution for multiprocessors with private cache memories
Papamarcos, M. S., & Patel, J. H. (1984) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800015.808204 · Cited by 246
Synchronization, coherence, and event ordering in multiprocessors
Dubois, M., Scheurich, C., & Briggs, F. A. (1988) · Computer · doi:10.1109/2.15 · Cited by 218
Using thread-level speculation to simplify manual parallelization
Prabhu, M. K., & Olukotun, K. (2003) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/781498.781500 · Cited by 94
Self-citation
Cited by
(2006) · Cited by 1,979
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
Lu, S., Park, S., Seo, E., & Zhou, Y. (2008) · Proceedings of the 13th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1346281.1346323 · Cited by 895
STAMP: Stanford Transactional Applications for Multi-Processing
Minh, C. C., Chung, J., Kozyrakis, C., & Olukotun, K. (2008) · 2008 IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2008.4636089 · Cited by 873
Self-citationSniper: exploring the level of abstraction for scalable and accurate parallel multi-core simulation
Carlson, T. E., Heirman, W., & Eeckhout, L. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063454 · Cited by 840
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
Coburn, J., Caulfield, A. M., Akel, A., Grupp, L. M., Gupta, R. K., Jhala, R., & Swanson, S. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950380 · Cited by 646
Metadata
- Authors
- Hammond, L., Wong, V., Chen, M., Carlstrom, B. D., Davis, J. D., Hertzberg, B., Prabhu, M. K., Wijaya, H., Kozyrakis, C., & Olukotun, K.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2004-03-02
- Volume
- 32
- Issue
- 2
- Pages
- 102
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W1986913310
- Cited by
- 643
- References
- 19
- FWCI
- 57.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.