Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures最新文献_第3页

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines 共享内存多核机器上并行算法的工具包

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400254

G. Blelloch, Daniel Anderson, Laxman Dhulipala

引用次数: 43

Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory 使用独占读写内存的高速缓存高效并行分区算法

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400234

William Kuszmaul, Alek Westover

{"title":"Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory","authors":"William Kuszmaul, Alek Westover","doi":"10.1145/3350755.3400234","DOIUrl":"https://doi.org/10.1145/3350755.3400234","url":null,"abstract":"We present an in-place algorithm for the parallel-partition problem with linear work and polylogarithmic span. The algorithm uses only exclusive read/write shared variables and can be implemented using parallel-for-loops without any additional concurrency considerations (i.e., the algorithm is EREW). A key feature of the algorithm is that it exhibits provably optimal cache behavior up to small-order factors. We also present a second in-place EREW algorithm with work O(n) and span O(log n · log log n), which is within an O(log log n) factor of the optimal span. By using this low-span algorithm as a subroutine within the cache-friendly algorithm, we obtain a single EREW algorithm that combines their theoretical guarantees: the algorithm achieves span O(log n · log log n) and exhibits optimal cache behavior. As an immediate consequence, we also get an in-place EREW Quicksort algorithm with work O(n log n) and span O(log2 n · log log n). Whereas the standard EREW algorithm for parallel-partition is memory-bandwidth bound on large numbers of cores, our cache-friendly algorithm is able to achieve near-ideal scaling in practice by avoiding the memory-bandwidth bottleneck. Our algorithm's performance is comparable to that of the Blocked Strided Algorithm of Francis, Pannan, Frias, and Petit, which is the previous state-of-the-art for parallel EREW sorting algorithms, but which lacks theoretical guarantees on its span and cache behavior.","PeriodicalId":218208,"journal":{"name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096236","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}

引用次数: 1

Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures 内存标记:可扩展并发数据结构的极简同步

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400213

Dan Alistarh, Trevor Brown, N. Singhal

{"title":"Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures","authors":"Dan Alistarh, Trevor Brown, N. Singhal","doi":"10.1145/3350755.3400213","DOIUrl":"https://doi.org/10.1145/3350755.3400213","url":null,"abstract":"There has been a significant amount of research on hardware and software support for efficient concurrent data structures; yet, the question of how to build correct, simple, and scalable data structures has not yet been definitively settled. In this paper, we revisit this question from a minimalist perspective, and ask: what is the smallest amount of synchronization required for correct and efficient concurrent search data structures, and how could this minimal synchronization support be provided in hardware? To address these questions, we introduce memory tagging, a simple hardware mechanism which enables the programmer to \"tag\" a dynamic set of memory locations, at cache-line granularity, and later validate whether the memory has been concurrently modified, with the possibility of updating one of the underlying locations atomically if validation succeeds. We provide several examples showing that this mechanism can enable fast and arguably simple concurrent data structure designs, such as lists, binary search trees, balanced search trees, range queries, and Software Transactional Memory (STM) implementations. We provide an implementation of memory tags in the Graphite multi-core simulator, showing that the mechanism can be implemented entirely at the level of L1 cache, and that it can enable non-trivial speedups versus existing implementations of the above data structures.","PeriodicalId":218208,"journal":{"name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066642","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}

引用次数: 1

Green Paging and Parallel Paging 绿色分页和并行分页

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400231

Kunal Agrawal, M. A. Bender, Rathish Das, William Kuszmaul, E. Peserico, Michele Scquizzato

引用次数: 5

pTrans: A Scalable Algorithm for Reservation Guarantees in Distributed Systems pTrans:分布式系统中可扩展的预约保证算法

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400273

Yuhan Peng, P. Varman

{"title":"pTrans: A Scalable Algorithm for Reservation Guarantees in Distributed Systems","authors":"Yuhan Peng, P. Varman","doi":"10.1145/3350755.3400273","DOIUrl":"https://doi.org/10.1145/3350755.3400273","url":null,"abstract":"Providing performance QoS (Quality-of-Service) guarantees in a distributed data center environment poses unique challenges. In a typical setting, a client must be guaranteed a minimum amount of service (its contractual reservation) aggregated over all servers on which it has demand for service. A server may receive service demands from multiple clients, which may in aggregate exceed its service capacity. The system must decide how much service to provide to each client on each server that it has demand, in order to satisfy all clients' reservations. In case there is no feasible allocation of the service, the amount of reservation that is fulfilled must be maximized. In practice, the number of clients is several orders of magnitude larger than the number of servers. We describe a simple iterative algorithm called pTrans for reservation allocation based on a directed graph model; servers are vertices and edges are characterized by a vector of feasible service transfers between adjacent servers. We provide formal proofs that the algorithm converges to the global optimal and has a polynomial worst-case running time. Moreover, pTrans can be easily parallelized using multiple threads. Empirical evaluation results show pTrans has low runtime overheads.","PeriodicalId":218208,"journal":{"name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124445604","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}

引用次数: 4

Feasibility of Cross-Chain Payment with Success Guarantees 有成功保证的跨链支付的可行性

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400264

R. V. Glabbeek, V. Gramoli, Pierre Tholoniat

引用次数: 6

A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs 一类平面图最小支配集的局部常数逼近因子算法

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400217

Sharareh Alipour, A. Jafari

引用次数: 8

Benchmarking Recoverable Mutex Locks 可恢复互斥锁的基准测试

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400269

J. Xiao, Zheng Zhang, W. Golab

引用次数: 1

Reconstructing Binary Trees in Parallel 并行二叉树的重构

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400229

Ramtin Afshar, M. Goodrich, Pedro A. Matias, Martha C. Osegueda

引用次数: 6

Communication vs Synchronisation in Parallel String Comparison 并行字符串比较中的通信与同步

Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures Pub Date : 2020-07-06 DOI: 10.1145/3350755.3400225

A. Tiskin

引用次数: 2