Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1281100.1281160acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Transactions and privatization in Delaunay triangulation

Published: 12 August 2007 Publication History
  • Get Citation Alerts
  • Abstract

    No abstract available.

    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]
    L. Guibas and J. Stolfi. Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams. ACM Trans. on Graphics, 4(2):74--123, Apr. 1985.
    [7]
    M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software Transactional Memory for Dynamic-sized Data Structures. 22nd ACM Symp. on Principles of Distributed Computing, July 2003.
    [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]
    M. F. Spear, A. Shriraman, L. Dalessandro, S. Dwarkadas, and M. L. Scott. Nonblocking Transactions Without Indirection Using Alert-on-Update. 19th ACM Symp. on Parallelism in Algorithms and Architectures, June 2007.

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
    August 2007
    424 pages
    ISBN:9781595936165
    DOI:10.1145/1281100
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 August 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. benchmarks
    2. privatization
    3. synchronization
    4. transactional memory

    Qualifiers

    • Article

    Conference

    PODC07

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)STAMP-Rust: Language and Performance Comparison to C on Transactional BenchmarksBenchmarking, Measuring, and Optimizing10.1007/978-3-031-31180-2_10(160-175)Online publication date: 13-May-2023
    • (2010)Transactional Memory, 2nd editionSynthesis Lectures on Computer Architecture10.2200/S00272ED1V01Y201006CAC0115:1(1-263)Online publication date: 22-Dec-2010
    • (2009)Feedback-directed barrier optimization in a strongly isolated STMACM SIGPLAN Notices10.1145/1594834.148090944:1(213-225)Online publication date: 21-Jan-2009
    • (2009)Feedback-directed barrier optimization in a strongly isolated STMProceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1480881.1480909(213-225)Online publication date: 21-Jan-2009
    • (2008)Using Hardware Memory Protection to Build a High-Performance, Strongly-Atomic Hybrid Transactional MemoryACM SIGARCH Computer Architecture News10.1145/1394608.138213236:3(115-126)Online publication date: 1-Jun-2008
    • (2008)Using Hardware Memory Protection to Build a High-Performance, Strongly-Atomic Hybrid Transactional MemoryProceedings of the 35th Annual International Symposium on Computer Architecture10.1109/ISCA.2008.34(115-126)Online publication date: 21-Jun-2008
    • (2008)STAMP: Stanford Transactional Applications for Multi-Processing2008 IEEE International Symposium on Workload Characterization10.1109/IISWC.2008.4636089(35-46)Online publication date: Oct-2008

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media