ACM Home Page
Please provide us with feedback. Feedback
Transactions and privatization in Delaunay triangulation
Full text PdfPdf (184 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing table of contents
Portland, Oregon, USA
SESSION: Brief announcements - track A table of contents
Pages: 336 - 337  
Year of Publication: 2007
ISBN:978-1-59593-616-5
Authors
Michael L. Scott  University of Rochester, Rochester, NY
Michael F. Spear  University of Rochester, Rochester, NY
Luke Dalessandro  University of Rochester, Rochester, NY
Virendra J. Marathe  University of Rochester, Rochester, NY
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 41,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281100.1281160
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The Rochester Software Transactional Memory Runtime, 2006. www.cs.rochester.edu/research/synchronization/rstm/.
 
2
A. Alexandrescu. Smart Pointers. In Modern C++ Design: Generic Programming and Design Patterns Applied, C++ In--Depth Series, chapter 7. Addison Wesley Professional, 2001.
 
3
L. Dalessandro, V. J. Marathe, M. F. Spear, and M. L. Scott. Capabilities and Limitations of Library-Based Software Transactional Memory in C++. 2nd ACM SIGPLAN Workshop on Transactional Computing, Aug. 2007.
 
4
B. Delaunay. Sur la Sphere Vide. Bulletin of the USSR Academy of Sciences, Classe des Sciences Mathematiques et Naturelles, 7:793--800, 1934.
 
5
R. A. Dwyer. A Faster Divide and Conquer Algorithm for Constructing Delaunay Triangulation. Algorithmica, 2:137--151, 1987.
6
7
 
8
M. Kulkarni, L. P. Chew, and K. Pingali. Using Transactions in Delaunay Mesh Generation. Workshop on Transactional Memory Workloads, June 2006.
 
9
V. J. Marathe, M. F. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. N. Scherer III, and M. L. Scott. Lowering the Overhead of Software Transactional Memory. ACM SIGPLAN Workshop on Transactional Computing, June 2006.
 
10
M. L. Scott, M. F. Spear, L. Dalessandro, and V. J. Marathe. Delaunay Triangulation with Transactions and Barriers. IEEE Intl. Symp. on Workload Characterization, benchmarks track, Sept. 2007.
11


Collaborative Colleagues:
Michael L. Scott: colleagues
Michael F. Spear: colleagues
Luke Dalessandro: colleagues
Virendra J. Marathe: colleagues