Affiliation:
1. Stanford University, Stanford, CA
Abstract
Transactional Coherence and Consistency (TCC) offers a way to simplify parallel programming by executing all code within transactions. In TCC systems, transactions serve as the fundamental unit of parallel work, communication and coherence. As each transaction completes, it writes all of its newly produced state to shared memory atomically, while restarting other processors that have speculatively read stale data. With this mechanism, a TCC-based system automatically handles data synchronization correctly, without programmer intervention. To gain the benefits of TCC, programs must be decomposed into transactions. We describe two basic programming language constructs for decomposing programs into transactions, a loop conversion syntax and a general transaction-forking mechanism. With these constructs, writing correct parallel programs requires only small, incremental changes to correct sequential programs. The performance of these programs may then easily be optimized, based on feedback from real program execution, using a few simple techniques.
Publisher
Association for Computing Machinery (ACM)
Reference38 articles.
1. Shared memory consistency models: a tutorial
2. Clock rate versus IPC
3. Broadcom Corp. "The Broadcom BCM-1250 Multiprocessor " Presentation at 2002 Embedded Processor Forum April 2002. Broadcom Corp. "The Broadcom BCM-1250 Multiprocessor " Presentation at 2002 Embedded Processor Forum April 2002.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献