default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th SPAA 2015: Portland, OR, USA
- Guy E. Blelloch, Kunal Agrawal:
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015. ACM 2015, ISBN 978-1-4503-3588-1
Session 1: Sorting
- Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu
, Julian Shun:
Sorting with Asymmetric Read and Write Costs. 1-12 - Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz:
Practical Massively Parallel Sorting. 13-23 - Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch:
A Top-Down Parallel Semisort. 24-34
Session 2: Caching
- Jacob Scott, Olga Holtz, Oded Schwartz:
Matrix Multiplication I/O-Complexity by Path Routing. 35-45 - Ishai Menache, Mohit Singh:
Online Caching with Convex Costs: Extended Abstract. 46-54
Keynote Address 1
- Hans-Juergen Boehm:
Myths and Misconceptions about Threads. 55
Session 3: Brief Announcements
- Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. 56-58 - Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee:
Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees. 59-61 - Longkun Guo, Kewen Liao, Hong Shen, Peng Li:
Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths. 62-64 - Sungjin Im, Benjamin Moseley:
Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. 65-67 - Amin Mohtasham, João Pedro Barreto:
Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory Applications. 68-70 - Mohamed Mohamedin, Roberto Palmieri, Ahmed Hassan, Binoy Ravindran:
Brief Announcement: Managing Resource Limitation of Best-Effort HTM. 71-73 - Mohamed Mohamedin, Roberto Palmieri, Binoy Ravindran:
Brief Announcement: On Scheduling Best-Effort HTM Transactions. 74-76 - Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann:
Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. 77-79 - Hamza Rihani, Peter Sanders, Roman Dementiev:
Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. 80-82 - Jim Sukha:
Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While Loops. 83-85 - Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz:
Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication. 86-88
Session 4: Tools
- Tao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson:
The Cilkprof Scalability Profiler. 89-100 - Dimitar Dimitrov, Martin T. Vechev, Vivek Sarkar:
Race Detection in Two Dimensions. 101-110 - I-Ting Angelina Lee, Tao B. Schardl:
Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects. 111-122 - Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit:
ThreadScan: Automatic and Scalable Memory Reclamation. 123-132
Session 5: Scheduling
- Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, Debmalya Panigrahi:
Speed Scaling in the Non-clairvoyant Model. 133-142 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. 143-154 - Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. 155-160 - Jeremy T. Fineman, Brendan Sheridan:
Scheduling Non-Unit Jobs to Minimize Calibrations. 161-170 - Sungjin Im, Benjamin Moseley:
Scheduling in Bandwidth Constrained Tree Networks. 171-180
Keynote Address 2
- Gary L. Miller:
The Revolution in Graph Theoretic Optimization Problems. 181
Session 6: Graph Algorithms
- Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal:
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation. 182-191 - Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu:
Improved Parallel Algorithms for Spanners and Hopsets. 192-201 - Kook Jin Ahn, Sudipto Guha:
Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints. 202-211 - Oded Green, Marat Dukhan, Richard W. Vuduc:
Branch-Avoiding Graph Algorithms. 212-223
Session 7: Transactional Memory and Concurrent Datastructures
- Nuno Diegues, Paolo Romano, Stoyan Garbatov:
Seer: Probabilistic Scheduling for Hardware Transactional Memory. 224-233 - Lingxiang Xiang, Michael L. Scott:
Conflict Reduction in Hardware Transactions Using Advisory Locks. 234-243 - Yujie Liu, Tingzhe Zhou, Michael F. Spear:
Transactional Acceleration of Concurrent Data Structures. 244-253 - Nachshon Cohen, Erez Petrank:
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access. 254-263
Session 8: Networks, Routing, and Communication
- Merav Parter, David Peleg:
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff. 264-273 - Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed Backup Placement in Networks. 274-283 - Guy Even, Moti Medina, Boaz Patt-Shamir:
Better Deterministic Online Packet Routing on Grids. 284-293 - Zhen Qiu, Cliff Stein, Yuan Zhong:
Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. 294-303 - Marek Klonowski, Dominik Pajak:
Electing a Leader in Wireless Networks Quickly Despite Jamming. 304-312
Session 9: Parallel and Distributed Algorithms
- Qin Zhang:
Communication-Efficient Computation on Distributed Noisy Datasets. 313-322 - Ryan Lewis, Dmitriy Morozov:
Parallel Computation of Persistent Homology using the Blowup Complex. 323-331 - Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-Stabilizing Repeated Balls-into-Bins. 332-339 - Laurent Feuilloley, Pierre Fraigniaud:
Randomized Local Network Computing. 340-349
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 2026-05-01 23:21 CEST 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:
