SPAA B

49 papers

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