ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015


The information below was collected semi-automatically. The authors have not yet been given the opportunity to verify the data.
[?] We ask all authors to verify the information we have about their papers, in particular the location of any supporting artifacts. We send out emails to authors asking them to update or verify this information incrementally, one conference at a time. For conferences where these emails have yet to be sent out we present the information in gray text.
Title/Authors Title Research Artifacts
[?] A research artifact is any by-product of a research project that is not directly included in the published research paper. In Computer Science research this is often source code and data sets, but it could also be media, documentation, inputs to proof assistants, shell-scripts to run experiments, etc.
Details

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths

Longkun Guo, Kewen Liao, Hong Shen, Peng Li

Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths

Details
Discussion Comments: 0
Verification: Authors have not verified information

The Cilkprof Scalability Profiler

Tao B. Schardl, Bradley C. Kuszmaul, I-Ting Angelina Lee, William M. Leiserson, Charles E. Leiserson

The Cilkprof Scalability Profiler

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While Loops

Jim Sukha

Brief Announcement: A Compiler-Runtime Application Binary Interface for Pipe-While Loops

Details
Discussion Comments: 0
Verification: Author has not verified information

Conflict Reduction in Hardware Transactions Using Advisory Locks

Lingxiang Xiang, Michael L. Scott

Conflict Reduction in Hardware Transactions Using Advisory Locks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects

I-Ting Angelina Lee, Tao B. Schardl

Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects

Details
Discussion Comments: 0
Verification: Authors have not verified information

Practical Massively Parallel Sorting

Michael Axtmann, Timo Bingmann, Peter Sanders, Christian Schulz

Practical Massively Parallel Sorting

Details
Discussion Comments: 0
Verification: Authors have not verified information

Speed Scaling in the Non-clairvoyant Model

Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, Debmalya Panigrahi

Speed Scaling in the Non-clairvoyant Model

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Managing Resource Limitation of Best-Effort HTM

Mohamed Mohamedin, Roberto Palmieri, Ahmed Hassan, Binoy Ravindran

Brief Announcement: Managing Resource Limitation of Best-Effort HTM

Details
Discussion Comments: 0
Verification: Authors have not verified information

Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff

Merav Parter, David Peleg

Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff

Details
Discussion Comments: 0
Verification: Authors have not verified information

Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints

Kook Jin Ahn, Sudipto Guha

Access to Data and Number of Iterations: Dual Primal Algorithms for Maximum Matching under Resource Constraints

Details
Discussion Comments: 0
Verification: Authors have not verified information

Distributed Backup Placement in Networks

Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz

Distributed Backup Placement in Networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Matrix Multiplication I/O-Complexity by Path Routing

Jacob Scott, Olga Holtz, Oded Schwartz

Matrix Multiplication I/O-Complexity by Path Routing

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering

Sungjin Im, Benjamin Moseley

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering

Details
Discussion Comments: 0
Verification: Authors have not verified information

Branch-Avoiding Graph Algorithms

Oded Green, Marat Dukhan, Richard W. Vuduc

Branch-Avoiding Graph Algorithms

Details
Discussion Comments: 0
Verification: Authors have not verified information

Seer: Probabilistic Scheduling for Hardware Transactional Memory

Nuno Diegues, Paolo Romano, Stoyan Garbatov

Seer: Probabilistic Scheduling for Hardware Transactional Memory

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees

Details
Discussion Comments: 0
Verification: Authors have not verified information

Race Detection in Two Dimensions

Dimitar Dimitrov, Martin T. Vechev, Vivek Sarkar

Race Detection in Two Dimensions

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Top-Down Parallel Semisort

Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch

A Top-Down Parallel Semisort

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: On Scheduling Best-Effort HTM Transactions

Mohamed Mohamedin, Roberto Palmieri, Binoy Ravindran

Brief Announcement: On Scheduling Best-Effort HTM Transactions

Details
Discussion Comments: 0
Verification: Authors have not verified information

Myths and Misconceptions about Threads

Hans-Juergen Boehm

Myths and Misconceptions about Threads

Details
Discussion Comments: 0
Verification: Author has not verified information

Cost-Oblivious Reallocation for Scheduling and Planning

Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert

Cost-Oblivious Reallocation for Scheduling and Planning

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication

Grey Ballard, Alex Druinsky, Nicholas Knight, Oded Schwartz

Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication

Details
Discussion Comments: 0
Verification: Authors have not verified information

Communication-Efficient Computation on Distributed Noisy Datasets

Qin Zhang

Communication-Efficient Computation on Distributed Noisy Datasets

Details
Discussion Comments: 0
Verification: Author has not verified information

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Details
Discussion Comments: 0
Verification: Authors have not verified information

Electing a Leader in Wireless Networks Quickly Despite Jamming

Marek Klonowski, Dominik Pajak

Electing a Leader in Wireless Networks Quickly Despite Jamming

Details
Discussion Comments: 0
Verification: Authors have not verified information

Randomized Local Network Computing

Laurent Feuilloley, Pierre Fraigniaud

Randomized Local Network Computing

Details
Discussion Comments: 0
Verification: Authors have not verified information

The Revolution in Graph Theoretic Optimization Problems

Gary L. Miller

The Revolution in Graph Theoretic Optimization Problems

Details
Discussion Comments: 0
Verification: Author has not verified information

Scheduling Non-Unit Jobs to Minimize Calibrations

Jeremy T. Fineman, Brendan Sheridan

Scheduling Non-Unit Jobs to Minimize Calibrations

Details
Discussion Comments: 0
Verification: Authors have not verified information

Parallel Computation of Persistent Homology using the Blowup Complex

Ryan Lewis, Dmitriy Morozov

Parallel Computation of Persistent Homology using the Blowup Complex

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond

Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond

Details
Discussion Comments: 0
Verification: Authors have not verified information

Self-Stabilizing Repeated Balls-into-Bins

Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta

Self-Stabilizing Repeated Balls-into-Bins

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory Applications

Amin Mohtasham, João Pedro Barreto

Brief Announcement: Fair Adaptive Parallelism for Concurrent Transactional Memory Applications

Details
Discussion Comments: 0
Verification: Authors have not verified information

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time

Sungjin Im, Janardhan Kulkarni, Benjamin Moseley

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time

Details
Discussion Comments: 0
Verification: Authors have not verified information

Transactional Acceleration of Concurrent Data Structures

Yujie Liu, Tingzhe Zhou, Michael F. Spear

Transactional Acceleration of Concurrent Data Structures

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Andreas Koutsopoulos, Christian Scheideler, Thim Strothmann

Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access

Nachshon Cohen, Erez Petrank

Efficient Memory Management for Lock-Free Data Structures with Optimistic Access

Details
Discussion Comments: 0
Verification: Authors have not verified information

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks

Zhen Qiu, Cliff Stein, Yuan Zhong

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Better Deterministic Online Packet Routing on Grids

Guy Even, Moti Medina, Boaz Patt-Shamir

Better Deterministic Online Packet Routing on Grids

Details
Discussion Comments: 0
Verification: Authors have not verified information

Sorting with Asymmetric Read and Write Costs

Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun

Sorting with Asymmetric Read and Write Costs

Details
Discussion Comments: 0
Verification: Authors have not verified information

Improved Parallel Algorithms for Spanners and Hopsets

Gary L. Miller, Richard Peng, Adrian Vladu, Shen Chen Xu

Improved Parallel Algorithms for Spanners and Hopsets

Details
Discussion Comments: 0
Verification: Authors have not verified information

Scheduling in Bandwidth Constrained Tree Networks

Sungjin Im, Benjamin Moseley

Scheduling in Bandwidth Constrained Tree Networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Online Caching with Convex Costs: Extended Abstract

Ishai Menache, Mohit Singh

Online Caching with Convex Costs: Extended Abstract

Details
Discussion Comments: 0
Verification: Authors have not verified information

ThreadScan: Automatic and Scalable Memory Reclamation

Dan Alistarh, William M. Leiserson, Alexander Matveev, Nir Shavit

ThreadScan: Automatic and Scalable Memory Reclamation

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues

Hamza Rihani, Peter Sanders, Roman Dementiev

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues

Details
Discussion Comments: 0
Verification: Authors have not verified information