default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th SPAA 2024: Nantes, France
- Kunal Agrawal, Erez Petrank:
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17-21, 2024. ACM 2024
Session 1: Concurrency and machine learning
- Jeonghyeon Kim
, Jaehwang Jung, Jeehoon Kang:
Expediting Hazard Pointers with Bounded RCU Critical Sections. 1-13 - Amanda Baran, Jacob Nelson-Slivon, Lewis Tseng, Roberto Palmieri:
ALock: Asymmetric Lock Primitive for RDMA Systems. 15-26 - Javad Abdi, Gilead Posluns, Guozheng Zhang, Boxuan Wang, Mark C. Jeffrey:
When Is Parallelism Fearless and Zero-Cost with Rust? 27-40 - Jacky Kwok, Marten Lohstroh, Edward A. Lee:
Efficient Parallel Reinforcement Learning Framework Using the Reactor Model. 41-51 - Nikolai Karpov, Qin Zhang:
Parallel Best Arm Identification in Heterogeneous Environments. 53-64 - Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak:
Brief Announcement: Lock-free Learned Search Data Structure. 65-67 - dePaul Miller, Ahmed Hassan, Roberto Palmieri:
Brief Announcement: LIT: Lookup Interlocked Table for Range Queries. 69-71 - Ahmed Fahmy, Wojciech Golab:
Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List. 73-75
Session 2: Scheduling
- Kunal Agrawal, Benjamin Moseley, Heather Newman, Kirk Pruhs:
Scheduling Out-Trees Online to Optimize Maximum Flow. 77-88 - Xiaosong Chen, Huanle Xu, ChengZhong Xu:
Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective. 89-100 - William Kuszmaul, Alek Westover:
Scheduling Jobs with Work-Inefficient Parallel Solutions. 101-111 - Guozheng Zhang, Gilead Posluns, Mark C. Jeffrey:
Multi Bucket Queues: Efficient Concurrent Priority Scheduling. 113-124 - Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover:
A Nearly Quadratic Improvement for Memory Reallocation. 125-135 - Matthew Akram, Dominik Schreiber:
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. 137-139 - Mozhengfu Liu, Xueyan Tang:
Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms. 141-143
Session 3: Algebra
- Jaehyun Koo:
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS. 145-154 - Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel:
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. 155-168 - Raghavendra Kanakagiri, Edgar Solomonik:
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. 169-181 - Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou, Fabrice Rastello:
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern. 183-193 - Yves Baumann, Rasmus Kyng:
A Framework for Parallelizing Approximate Gaussian Elimination. 195-206 - Roy Nissim, Oded Schwartz, Yuval Spiizer:
Fault-Tolerant Parallel Integer Multiplication. 207-218
Session 4: Parallel Algorithms
- Xiangyun Ding, Yan Gu, Yihan Sun:
Parallel and (Nearly) Work-Efficient Dynamic Programming. 219-232 - Laxman Dhulipala, Xiaojun Dong, Kishen N. Gowda, Yan Gu:
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. 233-245 - Daniel Anderson, Guy E. Blelloch:
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. 247-258 - Nodari Sitchinava, Rolf Svenning:
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. 259-268 - Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee:
Log Diameter Rounds MST Verification and Sensitivity in MPC. 269-280 - Jiawei Wang, Yutao Liu, Ming Fu, Hermann Härtig, Haibo Chen:
Brief Announcement: Work Stealing through Partial Asynchronous Delegation. 281-283 - Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman:
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. 285-287 - Demian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl:
Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. 289-291
Session 5: Brief Announcements
- Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. 293-295 - Mozhengfu Liu, Xueyan Tang:
Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions. 297-299 - Carter Luck, Charles McGuffey:
Brief Announcement: Suffix Analysis. 301-303 - Chetan Gupta, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi:
Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. 305-307
Session 6: Distributed Algorithms and GPU
- Tianyu Zuo, Xueyan Tang, Bu-Sung Lee:
Cost-Driven Data Replication with Predictions. 309-320 - Kunal Agrawal, William Kuszmaul, Zhe Wang, Jinhao Zhao:
Distributed Load Balancing in the Face of Reappearance Dependencies. 321-330 - Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. 331-343 - Kartik Lakhotia, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini:
PolarStar: Expanding the Horizon of Diameter-3 Networks. 345-357 - Lin Chen, Xiao Li, Shixi Chen, Fan Jiang, Chengeng Li, Wei Zhang, Jiang Xu:
PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge Transfer. 359-370 - Jacob Nelson-Slivon, Reilly Yankovich, Ahmed Hassan, Roberto Palmieri:
Brief Announcement: ROMe: Wait-free Objects for RDMA. 371-373 - Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek:
Brief Announcement: Scalable Distributed String Sorting. 375-377 - Jonathan Zarnstorff, Lucas Lebow, Dillon Remuck, Colin Ruiz, Lewis Tseng:
Brief Announcement: Racos: A Leaderless Erasure Coding State Machine Replication. 379-381
Session 7: Graphs
- Costas Busch, Dariusz R. Kowalski, Peter Robinson:
Sparse Spanners with Small Distance and Congestion Stretches. 383-393 - Alireza Farhadi, Sixue Cliff Liu, Elaine Shi:
Connected Components in Linear Work and Near-Optimal Time. 395-402 - Vladimir Kolmogorov:
A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut. 403-414 - Michal Dory, Shaked Matar:
Massively Parallel Algorithms for Approximate Shortest Paths. 415-426 - Mohsen Ghaffari, Anton Trygub:
Parallel Dynamic Maximal Matching. 427-437 - Xiaojun Dong, Yan Gu, Yihan Sun, Letong Wang:
Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library. 439-441 - Peter Sanders, Daniel Seemaier:
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning. 443-445 - Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. 447-449
Session 8: Scheduling
- Ramesh Adhikari, Costas Busch, Dariusz R. Kowalski:
Stable Blockchain Sharding under Adversarial Transaction Generation. 451-461 - Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. 463-474
Session 9: Scheduling
- Christopher Chung, William Jannen, Samuel McCauley, Bertrand Simon:
Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees. 475-477 - Klaus Jansen, Malin Rau, Malte Tutas:
Hardness and Tight Approximations of Demand Strip Packing. 479-489 - Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. 491-497
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
