• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    ACM Symposium on Parallelism in Algorithms and Architectures

    ACM Symposium on Parallelism in Algorithms and Architectures

    ConferenceCCF 计算机体系结构/并行与分布计算/存储系统 B

    年发文量

    研究主题

    论文(1706)

    排序
    1Lossless Robustification of Packet Scheduling Algorithms.
    Yossi Azar, Or Vardi
    2026
    引用
    AI阅读
    加入学术空间
    2Big Atomics: Non-Blocking Algorithms with a Direct Fast Path.
    Daniel Anderson,Guy E. Blelloch, Zachary Kent,Siddhartha Jayanti
    2026
    引用
    AI阅读
    加入学术空间
    3Reducing Off-Chip Prefetch Request Latency of LLC Hardware Prefetchers Via Neural Prediction.
    Zhengwei Huang, Wei Guo, Yongwen Wang
    2026
    引用
    AI阅读
    加入学术空间
    4Keynote Talk: Lessons Learned from Four Decades of Parallel Computing.
    Phillip B. Gibbons
    2026
    引用
    AI阅读
    加入学术空间
    5Ustm: A Lightweight and Efficient STM Supporting General Types and Deferred Aborts
    Zachary Kent, Guy Blelloch, André Costa

    Software Transactional Memory (STM) systems allow developers to more easily exploit multicore architectures by wrapping arbitrary sequential code in transactions that are executed concurrently. In recent years, the performance of STM systems has approached that of hand-tuned data structures through techniques that avoid unnecessary aborts and exploit the semantics of underlying data structures. Despite achieving excellent performance, most STM systems do not fully address the concerns they targeted in the first place: safety, usability, and generality. In particular, these systems place restrictions on the data types that may be updated transactionally, such as requiring that these types fit within a word, and can require modification of data layout. Moreover, most STM systems abort transactions in the middle of client code to ensure correctness. This can cause space leaks and other bugs not present in the original code. We present ustm, a novel STM system addressing all of these shortcomings while still maintaining excellent performance, all within 300 lines of code. uSTM supports general types while maintaining data layout. Aborts are deferred until the end of the transaction, allowing client code within a transaction to terminate normally. To ensure that uSTM guarantees opacity, we implement a novel timestamping algorithm we call split-increment timestamps. We compare the performance of uSTM to a variety of state-of-the-art (SOTA) STM systems, demonstrating that uSTM matches or outperforms the SOTA on a variety of workloads.

    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1706 篇论文

    高被引作者

    作者引用发文
    Grzegorz Malewicz54553
    Aart Bik54361
    Greg Czajkowski54361
    James C. Dehnert54361
    Ilan Horn54361
    Naty Leiser54361
    Matt Austern54361
    Charles E. Leiserson382424
    Guy E. Blelloch360363
    Phillip B. Gibbons225538

    高产作者

    作者引用发文
    Guy E. Blelloch360363
    Phillip B. Gibbons225538
    Christian Scheideler111933
    Michael A. Bender82227
    Jeremy T. Fineman180826
    Kunal Agrawal23926
    Charles E. Leiserson382424
    Friedhelm Meyer Auf Der Heide48823
    Yan Gu55622
    Ben Moseley60618

    相关期刊

    ACM Transactions on Parallel Computing
    SIAM Symposium on Algorithmic Principles of Computer Systems
    International Conference on the Theory and Application of Cryptographic Techniques
    Combinatorial Scientific Computing
    Annual International Cryptology Conference
    International Conference on Principles of Distributed Systems
    International Conference on the Theory and Application of Cryptology and Information Security
    ACM Symposium on Principles of Distributed Computing
    Distributed Computing
    International Conference on Distributed Computing