default search action
22nd SPAA 2010: Thira, Santorini, Greece
- Friedhelm Meyer auf der Heide, Cynthia A. Phillips:
SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010. ACM 2010, ISBN 978-1-4503-0079-7
Scheduling
- JongSoo Park, William J. Dally:
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures. 1-10 - Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. 11-20 - Erik D. Demaine, Morteza Zadimoghaddam:
Scheduling to minimize power consumption using submodular functions. 21-29 - Michael J. Fischer, Xueyuan Su, Yitong Yin:
Assigning tasks for efficiency in Hadoop: extended abstract. 30-39
Keynote talk
- Anastasia Ailamaki:
Database systems in the multicore era. 40
Computing despite an adversary
- Seth Gilbert
, Rachid Guerraoui
Collaborative scoring with dishonest participants. 41-49 - Dan Alistarh, Seth Gilbert
Securing every bit: authenticated broadcast in radio networks. 50-59 - Keren Censor-Hillel:
Multi-sided shared coins and randomized set-agreement. 60-68
Brief announcements I
- Paolo Romano
Brief announcement: on speculative replication of transactional systems. 69-71 - Hagit Attiya
Brief announcement: combine -- an improved directory-based consistency protocol. 72-73 - Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
Brief announcement: byzantine agreement with homonyms. 74-75 - Ioannis Chatzigiannakis
Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games. 76-78 - Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet:
Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. 79-81
Resource management
- Michela Becchi, Surendra Byna
Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory. 82-91 - Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking:
Online capacity maximization in wireless networks. 92-99 - Petra Berenbrink, André Brinkmann
Balls into bins with related random choices. 100-105
Network algorithms
- Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton:
Basic network creation games. 106-113 - Arne Vater, Christian Schindelhauer
Tree network coding for peer-to-peer networks. 114-123 - Jen-Yeu Chen
Optimal gossip-based aggregate computation. 124-133 - Pierre Fraigniaud, George Giakkoupis:
On the bit communication complexity of randomized rumor spreading. 134-143
Keynote talk
- Geoffrey Charles Fox:
Algorithms and application for grids and clouds. 144
Tools and methods for performance analysis
- Yuxiong He, Charles E. Leiserson, William M. Leiserson:
The Cilkview scalability analyzer. 145-156 - Vijay Anand Korthikanti, Gul Agha:
Towards optimizing energy costs of algorithms for shared memory architectures. 157-165 - Anne Benoit
Computing the throughput of probabilistic and replicated streaming applications. 166-175
Brief announcement II
- Enoch Peserico:
Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints. 176-177 - Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo:
Brief announcement: on regenerator placement problems in optical networks. 178-180 - Sina Meraji, Wei Zhang, Carl Tropper:
Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulation. 181-182 - Youngjoon Jo, Milind Kulkarni:
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications. 183-185 - Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha:
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages. 186-188
Matrix algorithms
- Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Low depth cache-oblivious algorithms. 189-199 - Ernie Chan, Robert A. van de Geijn, Andrew Chapman:
Managing the complexity of lookahead for LU factorization with pivoting. 200-208 - Peter Krusche, Alexander Tiskin
New algorithms for efficient parallel string comparison. 209-216
Local and distributed algorithms
- Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A local O(n2) gathering algorithm. 217-223 - Pierre Fraigniaud, Andrzej Pelc:
Delays induce an exponential memory gap for rendezvous in trees. 224-232 - Bertrand Ducourthial, Sofiane Khalfallah
Best-effort group service in dynamic networks. 233-242 - Peng Li, Kunal Agrawal, Jeremy Buhler
Deadlock avoidance for streaming computations with filtering. 243-252
Transactional memory
- Woongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun:
Implementing and evaluating nested parallel transactions in software transactional memory. 253-262 - Rachid Guerraoui
Transactions in the jungle. 263-272 - Michael F. Spear
Lightweight, robust adaptivity for software transactional memory. 273-283 - David Dice, Nir Shavit:
TLRW: return of the read-write lock. 284-293
Graph algorithms
- Matti Åstrand, Jukka Suomela
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. 294-302 - Charles E. Leiserson, Tao B. Schardl:
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). 303-314 - Guy E. Blelloch, Kanat Tangwongsan:
Parallel approximation algorithms for facility-location problems. 315-324
Concurrent data structures
- David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski:
Simplifying concurrent algorithms by exploiting hardware transactional memory. 325-334 - Phong Chuong, Faith Ellen, Vijaya Ramachandran:
A universal construction for wait-free transaction friendly data structures. 335-344 - James Aspnes, David Eisenstat, Yitong Yin:
Low-contention data structures. 345-354 - Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir:
Flat combining and the synchronization-parallelism tradeoff. 355-364
Corrigendum to SPAA 2009
- Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. 365
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 2025-01-24 17:02 CET 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: