default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st SPAA 2009: Calgary, Alberta, Canada
- Friedhelm Meyer auf der Heide, Michael A. Bender:
SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ACM 2009, ISBN 978-1-60558-606-9
Multiprocessor scheduling
- Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. 1-10 - Gero Greiner, Tim Nonner, Alexander Souza:
The bell is ringing in speed-scaled multiprocessor scheduling. 11-18 - Kunal Agrawal, Anne Benoit
, Fanny Dufossé, Yves Robert:
Mapping filtering streaming applications with communication costs. 19-28 - MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Scheduling to minimize staleness and stretch in real-time data warehouses. 29-38
Brief Announcements I
- Melih Onus, Andréa W. Richa:
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. 39-40 - Raphael Eidenbenz, Roger Wattenhofer:
Brief announcement: selfishness in transactional memory. 41-42 - Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman:
At-most-once semantics in asynchronous shared memory. 43-44
Keynote talk
- Sarita V. Adve:
Memory models: a case for rethinking parallel languages and hardware. 45
Invited session on industrial applications of algorithms
- Flavio Paiva Junqueira, Benjamin C. Reed:
The life and times of a zookeeper. 46 - Avinash Lakshman, Prashant Malik:
Cassandra: a structured storage system on a P2P network. 47 - Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski:
Pregel: a system for large-scale graph processing. 48
Transactional memory I
- Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni, Adam Welc:
Towards transactional memory semantics for C++. 49-58 - Idit Keidar, Dmitri Perelman:
On avoiding spare aborts in transactional memory. 59-68 - Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent limitations on disjoint-access parallel implementations of transactional memory. 69-78
Concurrency mechanisms
- Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin:
Reducers and other Cilk++ hyperobjects. 79-90 - Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper:
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. 91-100 - Yossi Lev, Victor Luchangco, Marek Olszewski:
Scalable reader-writer locks. 101-110 - Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
The weakest failure detector for wait-free dining under eventual weak exclusion. 111-120
Brief announcements: performance of parallel algorithm
- Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Brief announcement: low depth cache-oblivious sorting. 121-123 - Jim Sukha:
Brief announcement: a lower bound for depth-restricted work stealing. 124-126 - Bradley C. Kuszmaul:
Brief announcement: TeraByte TokuSampleSort sorts 1TB in 197s. 127-129
Keynote talk
- Bruce Hendrickson:
Emerging challenges and opportunities in parallel computing: the cretaceous redux? 130
Graph labeling/coloring
- Pierre Fraigniaud, Amos Korman:
On randomized representations of graphs using short labels. 131-137 - Fabian Kuhn:
Weak graph colorings: distributed algorithms and applications. 138-144 - Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder:
Routing without ordering. 145-153 - Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. 154-162
Brief announcements: algorithms meets hardware
- George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin:
Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. 163-165 - James E. Levy, Anand Ganti, Cynthia A. Phillips, Benjamin R. Hamlet, Andrew J. Landahl, Thomas M. Gurrieri, Robert D. Carr, Malcolm S. Carroll:
Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory. 166-168
Network organization and design
- Aviv Nisgav, Boaz Patt-Shamir:
Finding similar users in social networks: extended abstract. 169-177 - Marios Mavronicolas, Thomas Sauerwald:
A randomized, o(log w)-depth 2 smoothing network. 178-187 - Weirong Jiang, Viktor K. Prasanna:
Field-split parallel architecture for high performance multi-match packet classification using FPGAs. 188-196 - Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens:
Distributed algorithms for QoS load balancing. 197-203
Transactional memory II
- Fuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang:
NZTM: nonblocking zero-indirection transactional memory. 204-213 - Aleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabatabai:
Optimizing transactions for captured memory. 214-222 - Cosmin E. Oancea, Alan Mycroft, Tim Harris:
A lightweight in-place implementation for software thread-level speculation. 223-232
High-performance parallel computation
- Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson:
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. 233-244 - Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz:
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. 245-252 - Zhewei Wei, Ke Yi, Qin Zhang:
Dynamic external hashing: the limit of buffering. 253-259
Local distributed computation
- Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. 260-269 - Fabian Kuhn, Thomas Locher, Rotem Oshman:
Gradient clock synchronization in dynamic networks. 270-279
Fault tolerance and reliability
- Marcos Kawazoe Aguilera, Ram Swaminathan:
Remote storage with byzantine servers. 280-289 - Bogdan S. Chlebus, Dariusz R. Kowalski:
Locally scalable randomized consensus for synchronous crash failures. 290-299 - Matthias Baumgart, Christian Scheideler, Stefan Schmid:
A DoS-resilient information system for dynamic data management. 300-309 - Christian Ortolf, Christian Schindelhauer, Arne Vater:
Classifying peer-to-peer network coding schemes. 310-318
Scheduling and resource management
- Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer management for colored packets with deadlines. 319-327 - Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe:
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. 328-336 - Harald Räcke, Adi Rosén:
Approximation algorithms for time-constrained scheduling on line networks. 337-346 - Jan Mehler, Friedhelm Meyer auf der Heide:
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]. 347-356
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-11-06 00:09 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:
