SPAA B

49 papers

YearTitle / Authors
2010A local O(n
Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide
2010A universal construction for wait-free transaction friendly data structures.
Phong Chuong, Faith Ellen, Vijaya Ramachandran
2010A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).
Charles E. Leiserson, Tao B. Schardl
2010Algorithms and application for grids and clouds.
Geoffrey Charles Fox
2010Assigning tasks for efficiency in Hadoop: extended abstract.
Michael J. Fischer, Xueyuan Su, Yitong Yin
2010Balls into bins with related random choices.
Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel
2010Basic network creation games.
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton
2010Best-effort group service in dynamic networks.
Bertrand Ducourthial, Sofiane Khalfallah, Franck Petit
2010Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem.
Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet
2010Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulation.
Sina Meraji, Wei Zhang, Carl Tropper
2010Brief announcement: byzantine agreement with homonyms.
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec
2010Brief announcement: combine -- an improved directory-based consistency protocol.
Hagit Attiya, Vincent Gramoli, Alessia Milani
2010Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints.
Enoch Peserico
2010Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games.
Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis
2010Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications.
Youngjoon Jo, Milind Kulkarni
2010Brief announcement: on regenerator placement problems in optical networks.
Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo
2010Brief announcement: on speculative replication of transactional systems.
Paolo Romano, Roberto Palmieri, Francesco Quaglia, Nuno Carvalho, Luís E. T. Rodrigues
2010Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages.
Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha
2010Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures.
Jongsoo Park, William J. Dally
2010Collaborative scoring with dishonest participants.
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam
2010Computing the throughput of probabilistic and replicated streaming applications.
Anne Benoit, Fanny Dufossé, Matthieu Gallet, Yves Robert, Bruno Gaujal
2010Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion.
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
2010Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory.
Michela Becchi, Surendra Byna, Srihari Cadambi, Srimat T. Chakradhar
2010Database systems in the multicore era.
Anastasia Ailamaki
2010Deadlock avoidance for streaming computations with filtering.
Peng Li, Kunal Agrawal, Jeremy Buhler, Roger D. Chamberlain
2010Delays induce an exponential memory gap for rendezvous in trees.
Pierre Fraigniaud, Andrzej Pelc
2010Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks.
Matti Åstrand, Jukka Suomela
2010Flat combining and the synchronization-parallelism tradeoff.
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir
2010Implementing and evaluating nested parallel transactions in software transactional memory.
Woongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun
2010Lightweight, robust adaptivity for software transactional memory.
Michael F. Spear
2010Low depth cache-oblivious algorithms.
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri
2010Low-contention data structures.
James Aspnes, David Eisenstat, Yitong Yin
2010Managing the complexity of lookahead for LU factorization with pivoting.
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
2010Multi-sided shared coins and randomized set-agreement.
Keren Censor-Hillel
2010New algorithms for efficient parallel string comparison.
Peter Krusche, Alexander Tiskin
2010On the bit communication complexity of randomized rumor spreading.
Pierre Fraigniaud, George Giakkoupis
2010Online capacity maximization in wireless networks.
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking
2010Optimal gossip-based aggregate computation.
Jen-Yeu Chen, Gopal Pandurangan
2010Parallel approximation algorithms for facility-location problems.
Guy E. Blelloch, Kanat Tangwongsan
2010SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010
Friedhelm Meyer auf der Heide, Cynthia A. Phillips
2010Scheduling jobs with varying parallelizability to reduce variance.
Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs
2010Scheduling to minimize power consumption using submodular functions.
Erik D. Demaine, Morteza Zadimoghaddam
2010Securing every bit: authenticated broadcast in radio networks.
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, Calvin C. Newport
2010Simplifying concurrent algorithms by exploiting hardware transactional memory.
David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski
2010TLRW: return of the read-write lock.
David Dice, Nir Shavit
2010The Cilkview scalability analyzer.
Yuxiong He, Charles E. Leiserson, William M. Leiserson
2010Towards optimizing energy costs of algorithms for shared memory architectures.
Vijay Anand Korthikanti, Gul Agha
2010Transactions in the jungle.
Rachid Guerraoui, Thomas A. Henzinger, Michal Kapalka, Vasu Singh
2010Tree network coding for peer-to-peer networks.
Arne Vater, Christian Schindelhauer, Christian Ortolf