default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th SPAA 2014: Prague, Czech Republic
- Guy E. Blelloch, Peter Sanders:
26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014. ACM 2014, ISBN 978-1-4503-2821-0
Keynote address I
- Fabian Kuhn:
A distributed perspective on graph connectivity and cuts. 1
Load balancing
- Yusen Li, Xueyan Tang, Wentong Cai
:
On dynamic bin packing for resource allocation in the cloud. 2-11 - Khuzaima Daudjee, Shahin Kamali, Alejandro López-Ortiz:
On the online fault-tolerant server consolidation problem. 12-21 - Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. 22-29 - Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental analysis of space-bounded schedulers. 30-41
Graph algorithms I
- Ioana Oriana Bercea, Navin Goyal, David G. Harris, Aravind Srinivasan:
On computing maximal independent sets of hypergraphs in parallel. 42-50 - Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha:
Hierarchical graph partitioning. 51-60 - Ioannis Koutis:
Simple parallel and distributed algorithms for spectral graph sparsification. 61-66
Brief announcements 1
- Bradley C. Kuszmaul, William Kuszmaul:
Brief announcement: few buffers, many hot spots, and no tree saturation (with high probability). 67-69 - David Klaftenegger, Konstantinos Sagonas, Kjell Winblad:
Brief announcement: queue delegation locking. 70-72 - Joseph Izraelevitz, Michael L. Scott:
Brief announcement: fast dual ring queues. 73-75 - Daniel Cederman, Vincenzo Gulisano, Yiannis Nikolakopoulos, Marina Papatriantafilou, Philippas Tsigas:
Brief announcement: concurrent data structures for efficient streaming aggregation. 76-78 - Kunal Agrawal, Jeremy T. Fineman:
Brief announcement: cache-oblivious scheduling of streaming pipelines. 79-81 - Dave Dice, Virendra J. Marathe, Nir Shavit:
Brief announcement: persistent unfairness arising from cache residency imbalance. 82-83
Data structures
- Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback:
Provably good scheduling for parallel programs that use data structures through implicit batching. 84-95 - Julian Shun, Guy E. Blelloch:
Phase-concurrent hash tables for determinism. 96-107
Scheduling
- Leah Epstein, Elena Kleiman:
Scheduling selfish jobs on multidimensional parallel machines. 108-117 - Jessica Chang, Samir Khuller, Koyel Mukherjee:
LP rounding and combinatorial algorithms for minimizing active and busy time. 118-127 - André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß:
Scheduling shared continuous resources on many-cores. 128-137 - Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
A note on multiprocessor speed scaling with precedence constraints. 138-142
Graph algorithms II
- Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
A simple and practical linear-work parallel algorithm for connectivity. 143-153 - Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson:
Executing dynamic data-graph computations deterministically using chromatic scheduling. 154-165 - William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson:
Ordering heuristics for parallel graph coloring. 166-177
Transactional memory
- Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui:
The PCL theorem: transactions cannot be parallel, consistent and live. 178-187 - Dave Dice, Alex Kogan, Yossi Lev, Timothy Merrifield, Mark Moir:
Adaptive integration of hardware and software lock elision techniques. 188-197 - Chao Wang, Yujie Liu, Michael F. Spear:
Transaction-friendly condition variables. 198-207
Brief announcements 2
- Peter J. Varman, Hui Wang:
Brief announcement: fairness-efficiency tradeoffs in tiered storage allocation. 208-210 - Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Brief announcement: deadline-aware scheduling of big-data processing jobs. 211-213 - Muhammad Amber Hassaan, Donald Nguyen, Keshav Pingali:
Brief announcement: parallelization of asynchronous variational integrators forshared memory architectures. 214-216 - Hsin-Hao Su:
Brief annoucement: a distributed minimum cut approximation scheme. 217-219 - Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann:
Brief announcement: amoebot - a new model for programmable matter. 220-222 - Marek Piotrów:
Brief announcement: faster 3-periodic merging networks. 223-225
Automatic complexity analysis and streaming
- Torsten Hoefler, Grzegorz Kwasniewski:
Automatic complexity analysis of explicitly parallel programs. 226-235 - Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu:
Parallel streaming frequency-based aggregates. 236-245
Keynote address II
- Bruce M. Maggs:
A universal approach to data center network design. 246
Distributed systems
- Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. 247-256 - Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young:
(Near) optimal resource-competitive broadcast with jamming. 257-266 - Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: diameter and connectivity. 267-276 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Locality-based network creation games. 277-286
Lower bounds
- Xiaocheng Hu, Yufei Tao, Yi Yang, Shuigeng Zhou:
Finding approximate partitions and splitters in external memory. 287-295 - Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan:
On characterizing the data movement complexity of computational DAGs for parallel execution. 296-306 - Edgar Solomonik, Erin C. Carson, Nicholas Knight, James Demmel:
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. 307-318
Randomness
- Jiayang Jiang, Michael Mitzenmacher, Justin Thaler:
Parallel peeling algorithms. 319-330 - Michael Mitzenmacher:
Balanced allocations and double hashing. 331-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
