[Storage-research-list] SPAA'09 accepted papers

[Andrea Richa]

=======================================================================

      SPAA 2009 Accepted Papers

      21st ACM Symposium on Parallelism in Algorithms and Architectures

      Calgary, Canada
      August 11-13, 2009
      http://www.spaa-conference.org

      [Co-located with ACM PODC 2009]

=======================================================================

Below is the list of accepted papers to SPAA 2009. We accepted 35 long papers 
and 8 brief announcements.

Thanks!

Michael Bender, SPAA 2009 PC chair


LONG PAPERS

(1) Matteo Frigo, Pablo Halpern, Charles E. Leiserson and Stephen Lewin-Berlin. Reducers and Other Cilk++ Hyperobjects

(2) MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi and Howard Karloff. Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses

(3) Nikhil Bansal, Ho-Leung Chan, Jeff Edmonds and Kirk Pruhs. Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor

(4) Matthias Baumgart, Christian Scheideler and Stefan Schmid. A DoS-Resilient Information System for Dynamic Data Management

(5) Patrik Floreen, Joel Kaasinen, Petteri Kaski and Jukka Suomela. An optimal local approximation algorithm for max-min linear programs

(6) Gero Greiner, Tim Nonner and Alexander Souza. The Bell is Ringing in Speed-Scaled Multiprocessor Scheduling

(7) Bernadette Charron-Bost, Antoine Gaillard, Jennifer Welch and Josef Widder. Routing without Ordering

(8) Grey Ballard, James Demmel, Olga Holtz and Oded Schwartz. Communication-optimal Parallel and Sequential Cholesky decomposition

(9) Zhewei Wei, Ke Yi and Qin Zhang. Dynamic External Hashing: The Limit of Buffering

(10) Heiner Ackermann, Simon Fischer, Martin Hoefer and Marcel Schöngens. Distributed Algorithms for QoS Load Balancing

(11) Kunal Agrawal, Anne Benoit, Fanny Dufosse and Yves Robert. Mapping Filtering Streaming Applications With Communication Costs

(12) Hagit Attiya, Eshcar Hillel and Alessia Milani. Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory

(13) Jan Mehler and Friedhelm Meyer auf der Heide. Power-Aware Online File Allocation in Mobile Ad Hoc Networks

(14) Srikanth Sastry, Scott Pike and Jennifer Welch. The Weakest Failure Detector for Wait-free Dining Under Eventual Weak  Exclusion

(15) Harald Raecke and Adi Rosen. Approximation Algorithms for Time-Constrained Scheduling on Line Networks

(16) Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda and Prasad Raghavendra. Buffer Management for Colored Packets with Deadlines

(17) Marios Mavronicolas and Thomas Sauerwald. A Randomized, O(log w)-Depth 2-Smoothing Network

(18) Aydın Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert and Charles E. Leiserson. Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks

(19) Michele Flammini, Alberto Marchetti Spaccamela, Gianpiero Monaco, Luca Moscardelli and Shmuel Zaks. On the complexity of the Regenerator Placement Problem in Optical Networks

(20) Pierre Fraigniaud and Amos Korman. On Randomized Representations of Graphs Using Short Labels

(21) Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni and Adam Welc. Towards Transactional Memory Semantics for C++

(22) Aviv Nisgav and Boaz Patt-Shamir. Finding Similar Users in Social Networks

(23) Cosmin E. Oancea, Alan Mycroft and Tim Harris. A Lightweight In-Place Implementation for Software Thread-Level Speculation

(24) Bogdan Chlebus and Dariusz R. Kowalski. Locally scalable randomized consensus for synchronous crash failures

(25) Arne Vater, Christian Schindelhauer and Christian Ortolf. Classifying Peer-to-Peer Networking Coding Schemes

(26) Yossi Lev, Victor Luchangco and Marek Olszewski. Scalable Reader-Writer Locks

(27) Fuad Tabba, Mark Moir, James Goodman, Andrew Hay and Cong Wang. NZTM: Nonblocking Zero-indirection Transactional Memory

(28) Dmitri Perelman and Idit Keidar. On Avoiding Spare Aborts in Transactional Memory

(29) Aleksandar Dragojevic, Yang Ni and Ali-Reza Adl-Tabatabai. Optimizing Transactions for Captured Memory

(30) Fabian Kuhn. Local Weak Coloring Algorithms and Implications on Deterministic Symmetry Breaking

(31) Weirong Jiang and Viktor Prasanna. Field-Split Parallel Architecture for High Performance Multi-Match Packet Classification Using FPGAs

(32) Marcos Aguilera and Ram Swaminathan. Remote storage with byzantine servers

(33) Fabian Kuhn, Thomas Locher and Rotem Oshman. Gradient Clock Synchronization in Dynamic Networks

(34) Daniel Spoonhower, Guy E. Blelloch, Robert Harper and Phillip B. Gibbons. Beyond Nested Parallelism: Tight Bounds on Work-Stealing Overheads for Parallel Futures

(35) Koji Kobayashi, Shuichi Miyazaki and Yasuo Okabe. Competitive Buffer Management for Multi-Queue Switches in QoS Networks using Packet Buffering Algorithms

BRIEF ANNOUNCEMENTS

(1) Melih Onus and Andrea W. Richa. Brief Announcement: Parameterized Maximum and Average Degrees in Topic-based Publish-Subscribe Overlay Network Design

(2) Bradley Kuszmaul. Brief Announcement: TeraByte TokuSampleSort Sorts 1TB in 197s

(3) Raphael Eidenbenz and Roger Wattenhofer. Brief Announcement: Good Programming in Transactional Memory: Game Theory Meets Multicore Architecture

(4) Guy Blelloch, Phillip Gibbons and Harsha Vardhan Simhadri. Brief Announcement: Low-Depth Cache-Oblivious Algorithms

(5) James Levy, Anand Ganti, Cynthia Phillips, Benjamin Hamlet, Malcolm Carroll, Andrew Landahl, Thomas Gurrieri and Robert Carr. Brief Announcement: The impact of classical electronics constraints on a solid-state logical qubit memory

(6) Jim Sukha. Brief Announcement: A Lower Bound on the Parallelism of Depth-Restricted Work Stealing

(7) Sotirios Kentros, Aggelos Kiayias, Nicolas Nicolaou and Alexander Shvartsman. Brief Announcement: At-Most-Once Semantics in Asynchronous Shared Memory

(8) George Caragea, A. Beliz Saybasili, Xingzhi Wen and Uzi Vishkin. Brief Announcement: Performance Potential of an Easy-to-Program PRAM-On-Chip Prototype Versus State-of-the-Art Processor