SPAA 2016: 28TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES

This page contains an index consisting of author-provided keywords.

A
Accelerator	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
advice	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
All Pairs Shortest Paths	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
approximation algorithm	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
approximation algorithms	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling Robust and Probabilistic Failure-Aware Placement Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks Improved Approximation Algorithms for Scheduling Co-Flows
Asymmetric Read-Write Costs	Parallel Algorithms for Asymmetric Read-Write Costs
async	Dynamic Determinacy Race Detection for Task Parallelism with Futures
autonomous robots	Asymptotically Optimal Gathering on a Grid
AVL	Just Join for Parallel Ordered Sets and Maps
B
Balanced Binary Search Tree	Just Join for Parallel Ordered Sets and Maps
bandwidth allocation	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Benchmarking	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
big data	Parallel Algorithms for Summing Floating-Point Numbers
blocking	Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
Breadth-first Search	Parallel Algorithms for Asymmetric Read-Write Costs
Breadth-First-Search	Parallel Shortest-Paths Using Radius Stepping
buffer management	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
buffered crossbar switches	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Byzantine consensus	Brief Announcement: Relaxed Byzantine Vector Consensus
C
Cache-Adaptive Algorithms	Cache-Adaptive Analysis
Cache-Oblivious Parallel Algorithms	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Cache-Oblivious Wavefront	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
cactus stack	A Practical Solution to the Cactus Stack problem
cell-probe model	Randomized approximate nearest neighbor search with limited adaptivity
Churn	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
Cilk	A Practical Solution to the Cactus Stack problem
CIOQ switches	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Closest Pair	Parallelism in Randomized Incremental Algorithms
cloud computing	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Clustering Coefficient	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Co-flow Scheduling	Improved Approximation Algorithms for Scheduling Co-Flows
communication complexity	Randomized approximate nearest neighbor search with limited adaptivity The Cost of Unknown Diameter in Dynamic Networks
Comparison Sorting	Parallelism in Randomized Incremental Algorithms
competitive analysis	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
complexity	Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
Computational Geometry	Parallelism in Randomized Incremental Algorithms
Concurrency	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free Brief Announcement: Transactional Data Structure Libraries
Concurrent algorithms	Fast and Robust Memory Reclamation for Concurrent Data Structures
concurrent data structures	Investigating the performance of hardware transactions on a multi-socket machine
Concurrent Open Shop Scheduling	Improved Approximation Algorithms for Scheduling Co-Flows
CONGEST Model	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Congruence Relation on Semimodules	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
consistency models	Brief Announcement: Preserving Happens-before in Persistent Memory
Convex Hull	Parallel Algorithms for Asymmetric Read-Write Costs Parallelism in Randomized Incremental Algorithms
Convex Programming	Energy optimization of memory intensive parallel workloads
Cover Time	Better bounds for coalescing-branching random walks on graphs
Cuckoo hashing	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
D
data structures	Randomized approximate nearest neighbor search with limited adaptivity Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free Brief Announcement: Transactional Data Structure Libraries
Data-Flow Model	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
datacenters	Robust and Probabilistic Failure-Aware Placement
deadline	A QPTAS for Non-preemptive Speed-scaling
Delaunay Triangulation	Parallelism in Randomized Incremental Algorithms
Delta-Stepping	Parallel Shortest-Paths Using Radius Stepping
Densest Subgraph	Applications of Uniform Sampling: Densest Subgraph and Beyond
Dependence Graphs	Parallelism in Randomized Incremental Algorithms
Determinacy race	Dynamic Determinacy Race Detection for Task Parallelism with Futures Provably good and practically efficient parallel race detection for fork-join programs
Determinism	Dynamic Determinacy Race Detection for Task Parallelism with Futures
deterministic distributed algorithm	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Diameter	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
difference	Just Join for Parallel Ordered Sets and Maps
Distributed Algorithm	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Distributed Algorithms	Universal Shape Formation for Programmable Matter Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures Asymptotically Optimal Gathering on a Grid Better bounds for coalescing-branching random walks on graphs The Cost of Unknown Diameter in Dynamic Networks
Distributed Graph Algorithms	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
DoS-Attack	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
dynamic bin packing	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
dynamic networks	The Cost of Unknown Diameter in Dynamic Networks
Dynamic Programming	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
E
election	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Energy	Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines A QPTAS for Non-preemptive Speed-scaling
Energy Optimization	Energy optimization of memory intensive parallel workloads
Epidemic Processes	Better bounds for coalescing-branching random walks on graphs
equivalence classes	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Expander	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
external-memory algorithms	Parallel Algorithms for Summing Floating-Point Numbers Cache-Adaptive Analysis
F
Failure-aware placement	Robust and Probabilistic Failure-Aware Placement
Fairness	Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
fault diagnosis	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Fault-Tolerant Graph Structures	Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Fibril	A Practical Solution to the Cactus Stack problem
finish	Dynamic Determinacy Race Detection for Task Parallelism with Futures
first in first out	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
flexgrid all-optical networks	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
flexible storage allocation	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
floating-point numbers	Parallel Algorithms for Summing Floating-Point Numbers
Flow time	Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
Fork-Join Model	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
FPGA	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
FT-BFS	Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
FT-MST	Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Future	Dynamic Determinacy Race Detection for Task Parallelism with Futures
G
gathering problem	Asymptotically Optimal Gathering on a Grid
GCC	Extending TM Primitives using Low Level Semantics
General profit	General Profit Scheduling and the Power of Migration on Heterogeneous Machines
Girth	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Global DVFS	Energy optimization of memory intensive parallel workloads
GPU	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
GPU programming	Parallel Approaches to the String Matching Problem on the GPU
Graph Algorithms	Parallelism in Randomized Incremental Algorithms
Graph Connectivity	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Graph Sketching	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
H
hardware transactional memory	Investigating the performance of hardware transactions on a multi-socket machine
Heterogeneous machines	General Profit Scheduling and the Power of Migration on Heterogeneous Machines
hierarchical max-min fairness	Robust and Probabilistic Failure-Aware Placement
Hypercube	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
I
I/O complexity	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Information Spreading	Better bounds for coalescing-branching random walks on graphs
interoperability	A Practical Solution to the Cactus Stack problem
intersection	Just Join for Parallel Ordered Sets and Maps
Irregular Parallel Algorithms	Cache-Adaptive Analysis
J
job scheduling	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
join	Just Join for Parallel Ordered Sets and Maps
K
kick-out victim	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
L
latency	Latency-Hiding Work Stealing
latency hiding	Latency-Hiding Work Stealing
Linear Programming	Parallelism in Randomized Incremental Algorithms
List and Tree Contraction	Parallel Algorithms for Asymmetric Read-Write Costs
Lock-free Programming	Lock-free Transactions without Aborts for Linked Data Structures
locks	Investigating the performance of hardware transactions on a multi-socket machine
Low Level Semantics	Extending TM Primitives using Low Level Semantics
lower bounds	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) The Cost of Unknown Diameter in Dynamic Networks
M
machine minimization	The Power of Migration in Online Machine Minimization
MapReduce	Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
MapReduce algorithms	Parallel Algorithms for Summing Floating-Point Numbers
Massive Graphs	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
maximum finding	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
maximum flow time	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
memory hierarchy	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Memory Intensive	Energy optimization of memory intensive parallel workloads
memory mapping	A Practical Solution to the Cactus Stack problem
Memory reclamation	Fast and Robust Memory Reclamation for Concurrent Data Structures
MIC	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
migration	The Power of Migration in Online Machine Minimization General Profit Scheduling and the Power of Migration on Heterogeneous Machines
Minimum Spanning Tree	Parallel Algorithms for Asymmetric Read-Write Costs
Minimum Spanning Trees	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Multi-core Programming	Lock-free Transactions without Aborts for Linked Data Structures
Multicore	Energy optimization of memory intensive parallel workloads
multiple DAGs	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
N
nearest neighbor search	Randomized approximate nearest neighbor search with limited adaptivity Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Nested-Parallel Model	Parallel Algorithms for Asymmetric Read-Write Costs
Networks	Better bounds for coalescing-branching random walks on graphs
Non-blocking Data Structure	Lock-free Transactions without Aborts for Linked Data Structures
Non-migration	General Profit Scheduling and the Power of Migration on Heterogeneous Machines
non-preemptive scheduling	A QPTAS for Non-preemptive Speed-scaling
non-uniform memory access	Investigating the performance of hardware transactions on a multi-socket machine
Non-Volatile Memory	Parallel Algorithms for Asymmetric Read-Write Costs
nonvolatile memory	Brief Announcement: Preserving Happens-before in Persistent Memory
Numerical Algorithms	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
O
online algorithm	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
Online algorithms	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
online scheduling	The Power of Migration in Online Machine Minimization Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
optimistic concurrency	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
order-maintenance data structures	Provably good and practically efficient parallel race detection for fork-join programs
Overlay Network	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
P
Packet Classification	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
paging problem	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Parallel Algorithm	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford Just Join for Parallel Ordered Sets and Maps
Parallel algorithms	Parallel Approaches to the String Matching Problem on the GPU
Parallel Applications	Energy optimization of memory intensive parallel workloads
parallel computing	Latency-Hiding Work Stealing
parallel machines	A QPTAS for Non-preemptive Speed-scaling
Parallel Primitives	Parallel Algorithms for Asymmetric Read-Write Costs
Parallel Programming Model	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Parallelism Tuning	RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications
Performance	Fast and Robust Memory Reclamation for Concurrent Data Structures
Periodic Scheduling	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
persistency models	Brief Announcement: Preserving Happens-before in Persistent Memory
PRAM algorithms	Parallel Algorithms for Summing Floating-Point Numbers
Prefix free encoding	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Priority Queues	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Programmable Matter	Universal Shape Formation for Programmable Matter
progress guarantees	Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
R
race detection	Provably good and practically efficient parallel race detection for fork-join programs
Random Walks	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration Better bounds for coalescing-branching random walks on graphs
Randomized Algorithm	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
Randomized Incremental Algorithms	Parallelism in Randomized Incremental Algorithms
Red-black tree	Just Join for Parallel Ordered Sets and Maps
red-blue pebble game	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Relaxation	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
relaxed validity conditions	Brief Announcement: Relaxed Byzantine Vector Consensus
Resource Allocation	RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications
robot formation problems	Asymptotically Optimal Gathering on a Grid
Robustness	Fast and Robust Memory Reclamation for Concurrent Data Structures
runtime bound	Asymptotically Optimal Gathering on a Grid
S
scheduler	Provably good and practically efficient parallel race detection for fork-join programs
scheduling	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Scheduling independent sets	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
secret handshakes	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
selection	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Self-Organizing Systems	Universal Shape Formation for Programmable Matter
Selfish jobs	Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
serializability	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
series-parallel maintenance	Provably good and practically efficient parallel race detection for fork-join programs
Set Functions	Just Join for Parallel Ordered Sets and Maps
Shared-memory multicore processors	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Single-Source Shortest-Paths	Parallel Shortest-Paths Using Radius Stepping
Smallest Enclosing Disk	Parallelism in Randomized Incremental Algorithms
sorting	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Space-Bounded Scheduler	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Spectral Graph Theory	Better bounds for coalescing-branching random walks on graphs
split	Just Join for Parallel Ordered Sets and Maps
stochastic optimization	Robust and Probabilistic Failure-Aware Placement
Streaming Algorithm	Applications of Uniform Sampling: Densest Subgraph and Beyond
String matching	Parallel Approaches to the String Matching Problem on the GPU
Strongly Connected Components	Parallelism in Randomized Incremental Algorithms
Sublinear Time	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
T
TCAM	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Throughput maximization	General Profit Scheduling and the Power of Migration on Heterogeneous Machines
time	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
transaction abort	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
Transactional Boosting	Lock-free Transactions without Aborts for Linked Data Structures
transactional correctness	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
Transactional Data Structure	Lock-free Transactions without Aborts for Linked Data Structures
transactional lock elision	Investigating the performance of hardware transactions on a multi-socket machine
Transactional Memory	Lock-free Transactions without Aborts for Linked Data Structures RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications Extending TM Primitives using Low Level Semantics
Transactions	Brief Announcement: Transactional Data Structure Libraries
Trapezoidal Maps	Parallelism in Randomized Incremental Algorithms
treap	Just Join for Parallel Ordered Sets and Maps
Tree Embedding	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
U
Uniform Sampling	Applications of Uniform Sampling: Densest Subgraph and Beyond
union	Just Join for Parallel Ordered Sets and Maps
unknown network diameter	The Cost of Unknown Diameter in Dynamic Networks
V
vector inputs	Brief Announcement: Relaxed Byzantine Vector Consensus
W
weight-balanced tree	Just Join for Parallel Ordered Sets and Maps
work stealing	Latency-Hiding Work Stealing Provably good and practically efficient parallel race detection for fork-join programs
work-stealing	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time A Practical Solution to the Cactus Stack problem

Disclaimer | Powered by EasyChair Smart Program