Table of Contents

• Speed scaling of processes with arbitrary speedup curves on a multiprocessorHo-Leung Chan, Jeff Edmonds, Kirk Pruhs. 1-10 [doi]
• The bell is ringing in speed-scaled multiprocessor schedulingGero Greiner, Tim Nonner, Alexander Souza. 11-18 [doi]
• Mapping filtering streaming applications with communication costsKunal Agrawal, Anne Benoit, Fanny Dufossé, Yves Robert. 19-28 [doi]
• Scheduling to minimize staleness and stretch in real-time data warehousesMohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff. 29-38 [doi]
• Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network designMelih Onus, Andréa W. Richa. 39-40 [doi]
• Brief announcement: selfishness in transactional memoryRaphael Eidenbenz, Roger Wattenhofer. 41-42 [doi]
• At-most-once semantics in asynchronous shared memorySotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman. 43-44 [doi]
• Memory models: a case for rethinking parallel languages and hardwareSarita V. Adve. 45 [doi]
• The life and times of a zookeeperFlavio Paiva Junqueira, Benjamin Reed. 46 [doi]
• Cassandra: a structured storage system on a P2P networkAvinash Lakshman, Prashant Malik. 47 [doi]
• Pregel: a system for large-scale graph processingGrzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski. 48 [doi]
• Towards transactional memory semantics for C++Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert Geva, Yang Ni, Adam Welc. 49-58 [doi]
• On avoiding spare aborts in transactional memoryIdit Keidar, Dmitri Perelman. 59-68 [doi]
• Inherent limitations on disjoint-access parallel implementations of transactional memoryHagit Attiya, Eshcar Hillel, Alessia Milani. 69-78 [doi]
• Reducers and other Cilk++ hyperobjectsMatteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin. 79-90 [doi]
• Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futuresDaniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper. 91-100 [doi]
• Scalable reader-writer locksYossi Lev, Victor Luchangco, Marek Olszewski. 101-110 [doi]
• The weakest failure detector for wait-free dining under eventual weak exclusionSrikanth Sastry, Scott M. Pike, Jennifer L. Welch. 111-120 [doi]
• Brief announcement: low depth cache-oblivious sortingGuy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri. 121-123 [doi]
• Brief announcement: a lower bound for depth-restricted work stealingJim Sukha. 124-126 [doi]
• Brief announcement: TeraByte TokuSampleSort sorts 1TB in 197sBradley C. Kuszmaul. 127-129 [doi]
• Emerging challenges and opportunities in parallel computing: the cretaceous redux?Bruce Hendrickson. 130 [doi]
• On randomized representations of graphs using short labelsPierre Fraigniaud, Amos Korman. 131-137 [doi]
• Weak graph colorings: distributed algorithms and applicationsFabian Kuhn. 138-144 [doi]
• Routing without orderingBernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder. 145-153 [doi]
• On the complexity of the regenerator placement problem in optical networksMichele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks. 154-162 [doi]
• Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processorGeorge C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin. 163-165 [doi]
• Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memoryJames E. Levy, Anand Ganti, Cynthia A. Phillips, Benjamin R. Hamlet, Andrew J. Landahl, Thomas M. Gurrieri, Robert D. Carr, Malcolm S. Carroll. 166-168 [doi]
• Finding similar users in social networks: extended abstractAviv Nisgav, Boaz Patt-Shamir. 169-177 [doi]
• A randomized, o(log w)-depth 2 smoothing networkMarios Mavronicolas, Thomas Sauerwald. 178-187 [doi]
• Field-split parallel architecture for high performance multi-match packet classification using FPGAsWeirong Jiang, Viktor K. Prasanna. 188-196 [doi]
• Distributed algorithms for QoS load balancingHeiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens. 197-203 [doi]
• NZTM: nonblocking zero-indirection transactional memoryFuad Tabba, Mark Moir, James R. Goodman, Andrew W. Hay, Cong Wang. 204-213 [doi]
• Optimizing transactions for captured memoryAleksandar Dragojevic, Yang Ni, Ali-Reza Adl-Tabatabai. 214-222 [doi]
• A lightweight in-place implementation for software thread-level speculationCosmin E. Oancea, Alan Mycroft, Tim Harris. 223-232 [doi]
• Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocksAydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson. 233-244 [doi]
• Communication-optimal parallel and sequential Cholesky decomposition: extended abstractGrey Ballard, James Demmel, Olga Holtz, Oded Schwartz. 245-252 [doi]
• Dynamic external hashing: the limit of bufferingZhewei Wei, Ke Yi, Qin Zhang. 253-259 [doi]
• An optimal local approximation algorithm for max-min linear programsPatrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela. 260-269 [doi]
• Gradient clock synchronization in dynamic networksFabian Kuhn, Thomas Locher, Rotem Oshman. 270-279 [doi]
• Remote storage with byzantine serversMarcos Kawazoe Aguilera, Ram Swaminathan. 280-289 [doi]
• Locally scalable randomized consensus for synchronous crash failuresBogdan S. Chlebus, Dariusz R. Kowalski. 290-299 [doi]
• A DoS-resilient information system for dynamic data managementMatthias Baumgart, Christian Scheideler, Stefan Schmid. 300-309 [doi]
• Classifying peer-to-peer network coding schemesChristian Ortolf, Christian Schindelhauer, Arne Vater. 310-318 [doi]
• Buffer management for colored packets with deadlinesYossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra. 319-327 [doi]
• Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithmsKoji Kobayashi, Shuichi Miyazaki, Yasuo Okabe. 328-336 [doi]
• Approximation algorithms for time-constrained scheduling on line networksHarald Räcke, Adi Rosén. 337-346 [doi]
• Power-aware online file allocation in mobile ad hoc networks: [extended abstract]Jan Mehler, Friedhelm Meyer auf der Heide. 347-356 [doi]