Transactional collection classes Export

@inproceedings{citeulike:1761572, abstract = {While parallel programmers find it easier to reason about large atomic regions, the conventional mutual exclusion-based primitives for synchronization force them to interleave many small operations to achieve performance. Transactional memory promises that programmer scan use large atomic regions while achieving similar performance. However, these large transactions can conflict when operating on shared data structures, even for logically independent operations. Transactional collection classes address this problem by allowing long-running transactions to operate on shared data while eliminating unnecessary conflicts. Transactional collection classes wrap existing data structures, without the need for custom implementations or knowledge of data structure internals.}, address = {New York, NY, USA}, author = {Carlstrom, Brian D. and Mcdonald, Austen and Carbin, Michael and Kozyrakis, Christos and Olukotun, Kunle}, booktitle = {PPoPP '07: Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming}, citeulike-article-id = {1761572}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1229441}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1229428.1229441}, doi = {10.1145/1229428.1229441}, isbn = {978-1-59593-602-8}, keywords = {cdc}, location = {San Jose, California, USA}, pages = {56--67}, posted-at = {2007-10-12 20:38:50}, priority = {2}, publisher = {ACM}, title = {Transactional collection classes}, url = {http://dx.doi.org/10.1145/1229428.1229441}, year = {2007} }

TY - CONF ID - citeulike:1761572 L3 - citeulike-article-id:1761572 N2 - While parallel programmers find it easier to reason about large atomic regions, the conventional mutual exclusion-based primitives for synchronization force them to interleave many small operations to achieve performance. Transactional memory promises that programmer scan use large atomic regions while achieving similar performance. However, these large transactions can conflict when operating on shared data structures, even for logically independent operations. Transactional collection classes address this problem by allowing long-running transactions to operate on shared data while eliminating unnecessary conflicts. Transactional collection classes wrap existing data structures, without the need for custom implementations or knowledge of data structure internals. CY - San Jose, California, USA SN - 978-1-59593-602-8 AD - New York, NY, USA EP - 67 TI - Transactional collection classes PB - ACM T2 - PPoPP '07: Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming SP - 56 KW - cdc AU - Carlstrom, Brian AU - Mcdonald, Austen AU - Carbin, Michael AU - Kozyrakis, Christos AU - Olukotun, Kunle PY - 2007/// UR - http://dx.doi.org/10.1145/1229428.1229441 ER -