SPAA B

43 papers

YearTitle / Authors
201224th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012
Guy E. Blelloch, Maurice Herlihy
2012A
Klaus Jansen
2012A lock-free B+tree.
Anastasia Braginsky, Erez Petrank
2012A non-blocking internal binary search tree.
Shane V. Howley, Jeremy Jones
2012A parallel buffer tree.
Nodari Sitchinava, Norbert Zeh
2012A scalable framework for heterogeneous GPU-based clusters.
Fengguang Song, Jack J. Dongarra
2012Abstraction failures in concurrent programming.
Doug Lea
2012Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
2012Brief announcement: a GPU accelerated iterated local search TSP solver.
Kamil Rocki, Reiji Suda
2012Brief announcement: application-sensitive QoS scheduling in storage servers.
Ahmed Elnably, Peter J. Varman
2012Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model.
Neeraj Sharma, Sandeep Sen
2012Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane.
Henry Lin, Frans Schalekamp
2012Brief announcement: speedups for parallel graph triconnectivity.
James Alexander Edwards, Uzi Vishkin
2012Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds.
Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz
2012Brief announcement: subgraph isomorphism on a multithreaded shared memory architecture.
Claire C. Ralph, Vitus J. Leung, Will McLendon III
2012Brief announcement: the problem based benchmark suite.
Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan
2012Brief announcement: towards a communication optimal fast multipole method and its implications at exascale.
Aparna Chandramowlishwaran, Jeewhan Choi, Kamesh Madduri, Richard W. Vuduc
2012Cache-conscious scheduling of streaming applications.
Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo
2012Communication-optimal parallel algorithm for strassen's matrix multiplication.
Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz
2012Delegation and nesting in best-effort hardware transactional memory.
Yujie Liu, Stephan Diestelhorst, Michael F. Spear
2012Design, verification and applications of a new read-write lock algorithm.
Jun Shirako, Nick Vrvilo, Eric G. Mercer, Vivek Sarkar
2012Deterministic multi-channel information exchange.
Stephan Holzer, Thomas Locher, Yvonne-Anne Pignolet, Roger Wattenhofer
2012Discovery through gossip.
Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun
2012Efficient computation of distance sketches in distributed networks.
Atish Das Sarma, Michael Dinitz, Gopal Pandurangan
2012Enforcing efficient equilibria in network design games via subsidies.
John Augustine, Ioannis Caragiannis, Angelo Fanelli, Christos Kalaitzis
2012Faster and simpler width-independent parallel algorithms for positive semidefinite programming.
Richard Peng, Kanat Tangwongsan
2012Greedy sequential maximal independent set and matching are parallel on average.
Guy E. Blelloch, Jeremy T. Fineman, Julian Shun
2012Hedonic clustering games.
Moran Feldman, Liane Lewin-Eytan, Joseph Naor
2012High-performance RMA-based broadcast on the intel SCC.
Darko Petrovic, Omid Shahmirzadi, Thomas Ropars, André Schiper
2012In search of parallel dimensions.
Ravi Rajwar
2012Lower bounds for restricted-use objects: extended abstract.
James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler
2012Memory-mapping support for reducer hyperobjects.
I-Ting Angelina Lee, Aamir Shafi, Charles E. Leiserson
2012Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters.
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2012Non-clairvoyant weighted flow time scheduling with rejection penalty.
Ho-Leung Chan, Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Jianqiao Zhu
2012On the cost of composing shared-memory algorithms.
Dan Alistarh, Rachid Guerraoui, Petr Kuznetsov, Giuliano Losa
2012Online multi-robot exploration of grid graphs with rectangular obstacles.
Christian Ortolf, Christian Schindelhauer
2012Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.
Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide
2012Parallel and I/O efficient set covering algorithms.
Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan
2012Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.
Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan
2012SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools.
Elad Gidron, Idit Keidar, Dmitri Perelman, Yonathan Perez
2012Scheduling in wireless networks with rayleigh-fading interference.
Johannes Dams, Martin Hoefer, Thomas Kesselheim
2012The impact of the power law exponent on the behavior of a dynamic epidemic type process.
Adrian Ogierman, Robert Elsässer
2012Time vs. space trade-offs for rendezvous in trees.
Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc