Abstract is missing.
- Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architecturesJongSoo Park, William J. Dally. 1-10 [doi]
- Scheduling jobs with varying parallelizability to reduce varianceAnupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs. 11-20 [doi]
- Scheduling to minimize power consumption using submodular functionsErik D. Demaine, Morteza Zadimoghaddam. 21-29 [doi]
- Assigning tasks for efficiency in Hadoop: extended abstractMichael J. Fischer, Xueyuan Su, Yitong Yin. 30-39 [doi]
- Database systems in the multicore eraAnastasia Ailamaki. 40 [doi]
- Collaborative scoring with dishonest participantsSeth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam. 41-49 [doi]
- Securing every bit: authenticated broadcast in radio networksDan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic, Calvin C. Newport. 50-59 [doi]
- Multi-sided shared coins and randomized set-agreementKeren Censor Hillel. 60-68 [doi]
- Brief announcement: on speculative replication of transactional systemsPaolo Romano, Roberto Palmieri, Francesco Quaglia, Nuno Carvalho, Luís Rodrigues. 69-71 [doi]
- Brief announcement: combine -- an improved directory-based consistency protocolHagit Attiya, Vincent Gramoli, Alessia Milani. 72-73 [doi]
- Brief announcement: byzantine agreement with homonymsCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec. 74-75 [doi]
- Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive gamesIoannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis. 76-78 [doi]
- Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problemLaura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet. 79-81 [doi]
- Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memoryMichela Becchi, Surendra Byna, Srihari Cadambi, Srimat T. Chakradhar. 82-91 [doi]
- Online capacity maximization in wireless networksAlexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking. 92-99 [doi]
- Balls into bins with related random choicesPetra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel. 100-105 [doi]
- Basic network creation gamesNoga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton. 106-113 [doi]
- Tree network coding for peer-to-peer networksArne Vater, Christian Schindelhauer, Christian Ortolf. 114-123 [doi]
- Optimal gossip-based aggregate computationJen-Yeu Chen, Gopal Pandurangan. 124-133 [doi]
- On the bit communication complexity of randomized rumor spreadingPierre Fraigniaud, George Giakkoupis. 134-143 [doi]
- Algorithms and application for grids and cloudsGeoffrey Charles Fox. 144 [doi]
- The Cilkview scalability analyzerYuxiong He, Charles E. Leiserson, William M. Leiserson. 145-156 [doi]
- Towards optimizing energy costs of algorithms for shared memory architecturesVijay Anand Korthikanti, Gul Agha. 157-165 [doi]
- Computing the throughput of probabilistic and replicated streaming applicationsAnne Benoit, Fanny Dufossé, Matthieu Gallet, Yves Robert, Bruno Gaujal. 166-175 [doi]
- Brief announcement: flashcrowding in tiled multiprocessors under thermal constraintsEnoch Peserico. 176-177 [doi]
- Brief announcement: on regenerator placement problems in optical networksArunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Ngo. 178-180 [doi]
- Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulationSina Meraji, Wei Zhang, Carl Tropper. 181-182 [doi]
- Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applicationsYoungjoon Jo, Milind Kulkarni. 183-185 [doi]
- Brief announcement: serial-parallel reciprocity in dynamic multithreaded languagesKunal Agrawal, I.-Ting Angelina Lee, Jim Sukha. 186-188 [doi]
- Low depth cache-oblivious algorithmsGuy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri. 189-199 [doi]
- Managing the complexity of lookahead for LU factorization with pivotingErnie Chan, Robert A. van de Geijn, Andrew Chapman. 200-208 [doi]
- New algorithms for efficient parallel string comparisonPeter Krusche, Alexander Tiskin. 209-216 [doi]
- A local O(n:::2:::) gathering algorithmBastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide. 217-223 [doi]
- Delays induce an exponential memory gap for rendezvous in treesPierre Fraigniaud, Andrzej Pelc. 224-232 [doi]
- Best-effort group service in dynamic networksBertrand Ducourthial, Sofiane Khalfallah, Franck Petit. 233-242 [doi]
- Deadlock avoidance for streaming computations with filteringPeng Li, Kunal Agrawal, Jeremy Buhler, Roger D. Chamberlain. 243-252 [doi]
- Implementing and evaluating nested parallel transactions in software transactional memoryWoongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun. 253-262 [doi]
- Transactions in the jungleRachid Guerraoui, Thomas A. Henzinger, Michal Kapalka, Vasu Singh. 263-272 [doi]
- Lightweight, robust adaptivity for software transactional memoryMichael F. Spear. 273-283 [doi]
- TLRW: return of the read-write lockDavid Dice, Nir Shavit. 284-293 [doi]
- Fast distributed approximation algorithms for vertex cover and set cover in anonymous networksMatti Åstrand, Jukka Suomela. 294-302 [doi]
- A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)Charles E. Leiserson, Tao B. Schardl. 303-314 [doi]
- Parallel approximation algorithms for facility-location problemsGuy E. Blelloch, Kanat Tangwongsan. 315-324 [doi]
- Simplifying concurrent algorithms by exploiting hardware transactional memoryDavid Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski. 325-334 [doi]
- A universal construction for wait-free transaction friendly data structuresPhong Chuong, Faith Ellen, Vijaya Ramachandran. 335-344 [doi]
- Low-contention data structuresJames Aspnes, David Eisenstat, Yitong Yin. 345-354 [doi]
- Flat combining and the synchronization-parallelism tradeoffDanny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir. 355-364 [doi]
- Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusionSrikanth Sastry, Scott M. Pike, Jennifer L. Welch. 365 [doi]