Table of Contents

• Utilizing shared data in chip multiprocessors with the nahalal architectureZvika Guz, Idit Keidar, Avinoam Kolodny, Uri C. Weiser. 1-10 [doi]
• A consistency architecture for hierarchical shared cachesEdya Ladan-Mozes, Charles E. Leiserson. 11-22 [doi]
• Combinable memory-block transactionsGuy E. Blelloch, Phillip B. Gibbons, S. Harsha Vardhan. 23-34 [doi]
• Parallelizing dynamic information flow trackingOlatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael Ryan. 35-45 [doi]
• What can be approximated locally?: case study: dominating sets in planar graphsChristoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer. 46-54 [doi]
• Distributed packing in planar graphsAndrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak. 55-61 [doi]
• Polylogarithmic network navigability using compact metrics with small stretchPierre Fraigniaud, Cyril Gavoille. 62-69 [doi]
• Online multicast with egalitarian cost sharingMoses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks. 70-76 [doi]
• Trade-offs between the size of advice and broadcasting time in treesEmanuele G. Fusco, Andrzej Pelc. 77-84 [doi]
• Cost sharing mechanisms for near-optimal traffic aggregation and network designBaruch Awerbuch, Rohit Khandekar. 85-90 [doi]
• On spreading recommendations via social gossipYaacov Fernandess, Dahlia Malkhi. 91-97 [doi]
• Against lock-based semantics for transactional memoryVictor Luchangco. 98-100 [doi]
• A transactional approach to lock scalabilityAmitabha Roy 0002, Keir Fraser, Steven Hand. 101-103 [doi]
• RaceTM: detecting data races using transactional memoryShantanu Gupta, Florin Sultan, Srihari Cadambi, Franjo Ivancic, Martin Rötteler. 104-106 [doi]
• A first insight into object-aware hardware transactional memoryBehram Khan, Matthew Horsnell, Ian Rogers, Mikel Luján, Andrew Dinn, Ian Watson. 107-109 [doi]
• Safe open-nested transactions through ownershipKunal Agrawal, I.-Ting Angelina Lee, Jim Sukha. 110-112 [doi]
• Leveraging non-blocking collective communication in high-performance applicationsTorsten Hoefler, Peter Gottschling, Andrew Lumsdaine. 113-115 [doi]
• Fractal communication in software data dependency graphsDaniel Greenfield, Simon W. Moore. 116-118 [doi]
• Many random walks are faster than oneNoga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle. 119-128 [doi]
• Improved distributed approximate matchingZvi Lotker, Boaz Patt-Shamir, Seth Pettie. 129-136 [doi]
• Graph partitioning into isolated, high conductance clusters: theory, computation and applications to preconditioningIoannis Koutis, Gary L. Miller. 137-145 [doi]
• Finding strongly connected components in parallel using ::::o::::(log:::2:::::::n::::) reachability queriesWarren J. Schudy. 146-151 [doi]
• Automatic data partitioning in software transactional memoriesTorvald Riegel, Christof Fetzer, Pascal Felber. 152-159 [doi]
• Checkpoints and continuations instead of nested transactionsEric Koskinen, Maurice Herlihy. 160-168 [doi]
• Adaptive transaction scheduling for transactional memory systemsRichard M. Yoo, Hsien-Hsin S. Lee. 169-178 [doi]
• Operational analysis of processor speed scalingKai Shen, Alex Zhang, Terence Kelly, Christopher Stewart. 179-181 [doi]
• A temperature-aware virtual submesh allocation scheme for noc-based manycore chipsXiongfei Liao, Wu Jigang, Thambipillai Srikanthan. 182-184 [doi]
• Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)Reza Dorrigiv, Alejandro López-Ortiz, Alejandro Salinger. 185-187 [doi]
• Energy-optimal distributed algorithms for minimum spanning treesYongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan. 188-190 [doi]
• Data replication in p2p environmentsAndré Brinkmann, Sascha Effert. 191-193 [doi]
• Graphical congestion games with linear latenciesVittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. 194-196 [doi]
• Fundamental parallel algorithms for private-cache chip multiprocessorsLars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava. 197-206 [doi]
• Cache-efficient dynamic programming algorithms for multicoresRezaul Alam Chowdhury, Vijaya Ramachandran. 207-216 [doi]
• Scheduling strategies for optimistic parallel execution of irregular programsMilind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew. 217-228 [doi]
• Fast distributed scheduling via primal-dualAlessandro Panconesi, Mauro Sozio. 229-235 [doi]
• A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a clusterNedialko B. Dimitrov, Indrajit Roy. 236-245 [doi]
• Improved approximations for multiprocessor scheduling under uncertaintyChristopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott. 246-255 [doi]
• Competitive non-migratory scheduling for flow time and energyTak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong. 256-264 [doi]
• Kicking the tires of software transactional memory: why the going gets toughRichard M. Yoo, Yang Ni, Adam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai, Hsien-Hsin S. Lee. 265-274 [doi]
• RingSTM: scalable transactions with a single atomic instructionMichael F. Spear, Maged M. Michael, Christoph von Praun. 275-284 [doi]
• Irrevocable transactions and their applicationsAdam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai. 285-296 [doi]
• Dreadlocks: efficient deadlock detectionEric Koskinen, Maurice Herlihy. 297-303 [doi]
• On obstruction-free transactionsRachid Guerraoui, Michal Kapalka. 304-313 [doi]
• Practical weak-atomicity semantics for java stmVijay Menon, Steven Balensiefer, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Bratin Saha, Adam Welc. 314-325 [doi]
• Commit phase in timestamp-based stmRui Zhang, Zoran Budimlic, William N. Scherer III. 326-335 [doi]
• Partial snapshot objectsHagit Attiya, Rachid Guerraoui, Eric Ruppert. 336-343 [doi]
• Communication in wireless networks with directional antennasIoannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese. 344-351 [doi]
• Tight competitive ratios for parallel disk prefetching and cachingWing-Kai Hon, Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter. 352-361 [doi]
• The adaptive transactional memory test platform: a tool for experimenting with transactional code for rock (poster)Mark Moir, Kevin Moore, Daniel Nussbaum. 362 [doi]
• Improving software concurrency with hardware-assisted memory snapshotJaeWoong Chung, Jiwon Seo, Woongki Baek, Chi Cao Minh, Austen McDonald, Christos Kozyrakis, Kunle Olukotun. 363 [doi]
• Distributed voronoi diagram computation in wireless sensor networksWaleed Alsalih, Kamrul Islam, Yurai Núñez Rodríguez, Henry Xiao. 364 [doi]
• Directed transmission method, a fully asynchronous approach to solve sparse linear systems in parallelFei Wei, Huazhong Yang. 365 [doi]
• Ased: availability, security, and debugging support usingtransactional memoryJaeWoong Chung, Woongki Baek, Nathan Grasso Bronson, Jiwon Seo, Christos Kozyrakis, Kunle Olukotun. 366 [doi]