Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures最新文献

Brief Announcement: Tight Bounds for Repeated Balls-into-Bins 简短声明:重复投球的限制很紧

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538561

Dimitrios Los, Thomas Sauerwald

{"title":"Brief Announcement: Tight Bounds for Repeated Balls-into-Bins","authors":"Dimitrios Los, Thomas Sauerwald","doi":"10.1145/3490148.3538561","DOIUrl":"https://doi.org/10.1145/3490148.3538561","url":null,"abstract":"We study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta [3]. This process starts with m balls arbitrarily distributed across n bins. At each step t = 1, 2, . . ., we select one ball from each non-empty bin, and then place it into a bin chosen independently and uniformly at random. We prove the following results: For any n ⩽ m ⩽ poly(n), we prove a lower bound of Ω(m/n · logn) on the maximum load. For the special case m = n, this matches the upper bound of O (logn), as shown in [3]. It also provides a positive answer to the conjecture in [3] that for m = n the maximum load is ω(log n /log log n) in a polynomially large window. For m ∈ [ω (n), n logn], our new lower bound also disproves the conjecture in [3] that the maximum load remains O (logn). For any n ≤ m ≤ poly(n), we prove an upper bound of O (m/n · logn) on the maximum load for a polynomially large window, which matches our lower bound. For any m ≥ n, our analysis also implies an O (m2 /n) waiting time to a configuration with O (m/n . log m) maximum load, even for worst-case initial distributions. For m ≥ n, we show that every ball visits every bin in O (m log m) steps. For m = n, this improves the previous upper bound of O (n log2 n) in [3] and for any n ≤ m ≤ poly(n) this is tight up to multiplicative constants. Full version of the paper at: https://arxiv.org/abs/2203.12400.","PeriodicalId":112865,"journal":{"name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Brief Announcement: Spatial Locality and Granularity Change in Caching 简要公告:缓存中的空间局部性和粒度变化

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538559

Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey

引用次数: 0

Keynote Talk: Large Scale Parallel Sparse Matrix Streaming Graph/Network Analysis 主题演讲:大规模并行稀疏矩阵流图/网络分析

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538597

J. Kepner

引用次数: 0

Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions 简要公告:一种更鲁棒的流时间调度预测算法

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538557

Tianming Zhao, Chunhao Li, Wei Li, Albert Y. Zomaya

引用次数: 1

Brief Announcement: Composable Dynamic Secure Emulation 简短公告:可组合动态安全仿真

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538562

Pierre Civit, M. Potop-Butucaru

引用次数: 1

Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go? 主题演讲:算法改进:进展有多快，还能走多远?

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538596

Neil C. Thompson

引用次数: 0

Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path Problem 简要公告:一个并行(Δ， Γ)步进算法的约束最短路径问题

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538555

Tayebeh Bahreini, N. Fisher, Daniel Grosu

引用次数: 0

HybriDS 混合动力车

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538591

Jiwon Choe, A. Crotty, T. Moreshet, Maurice Herlihy, R. I. Bahar

{"title":"HybriDS","authors":"Jiwon Choe, A. Crotty, T. Moreshet, Maurice Herlihy, R. I. Bahar","doi":"10.1145/3490148.3538591","DOIUrl":"https://doi.org/10.1145/3490148.3538591","url":null,"abstract":"In recent years, the ever-increasing impact of memory access bottlenecks has brought forth a renewed interest in near-memory processing (NMP) architectures. In this work, we propose and empirically evaluate hybrid data structures, which are concurrent data structures custom-designed for these new NMP architectures. We focus on cache-optimized data structures, such as skiplists and B+ trees, that are often used as index structures in online transaction processing (OLTP) systems to enable fast key-based lookups. These data structures are hierarchical, where lookups begin at a small number of top-level nodes and diverge to many different node paths as they move down the hierarchy, such that nodes in higher levels benefit more from caching. Our proposed hybrid data structures split traditional hierarchical data structures into a host-managed portion consisting of higher-level nodes and an NMP-managed portion consisting of the remaining lower-level nodes, thus retaining and further enhancing the cache-conscious optimizations of their conventional implementations. Although the idea might seem relatively simple, the splitting of the data structure prompts new synchronization problems, and careful implementation is required to ensure high concurrency and correctness. We provide implementations of a hybrid skiplist and a hybrid B+ tree, and we empirically evaluate them on a cycle-accurate full-system architecture simulator. Our results show that the hybrid data structures have the potential to improve performance by more than 2x compared to state-of-the-art concurrent data structures.","PeriodicalId":112865,"journal":{"name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124957877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion 简短公告:多重身份的(有限)力量:通过共谋提高弹性的异步拜占庭可靠广播

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538556

Thorsten Götte, C. Scheideler

引用次数: 0

Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics 简短公告:分布式轻量级扳手结构单位球图加倍指标

Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2022-07-11 DOI: 10.1145/3490148.3538553

D. Eppstein, Hadi Khodabandeh

引用次数: 0