Search results for "SPAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Victoria Caparrós Cabezas, Phillip Stanley-Marbell	Parallelism and data movement characterization of contemporary application classes.	SPAA	2011	DBLP DOI BibTeX RDF
1	Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy	Sharing-aware algorithms for virtual machine colocation.	SPAA	2011	DBLP DOI BibTeX RDF
1	Susanne Albers, Antonios Antoniadis 0001, Gero Greiner	On multi-processor speed scaling with migration: extended abstract.	SPAA	2011	DBLP DOI BibTeX RDF
1	Hrishikesh B. Acharya, Mohamed G. Gouda	Brief announcement: RedRem: a parallel redundancy remover.	SPAA	2011	DBLP DOI BibTeX RDF
1	David Dice, Oleksandr Otenko	Brief announcement: multilane - a concurrent blocking multiset.	SPAA	2011	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Michael Mitzenmacher	Brief announcement: large-scale multimaps.	SPAA	2011	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler	Stabilizing consensus with the power of two choices.	SPAA	2011	DBLP DOI BibTeX RDF
1	Peter Kling, Friedhelm Meyer auf der Heide	Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed.	SPAA	2011	DBLP DOI BibTeX RDF
1	Panagiota Fatourou, Nikolaos D. Kallimanis	A highly-efficient wait-free universal construction.	SPAA	2011	DBLP DOI BibTeX RDF
1	Guy E. Blelloch, Anupam Gupta 0001, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan	Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.	SPAA	2011	DBLP DOI BibTeX RDF
1	David Dice, Virendra J. Marathe, Nir Shavit	Flat-combining NUMA locks.	SPAA	2011	DBLP DOI BibTeX RDF
1	Thomas Erlebach, Tom Grant, Frank Kammer	Maximising lifetime for fault-tolerant target coverage in sensor networks.	SPAA	2011	DBLP DOI BibTeX RDF
1	Lei Li, Tianshi Chen 0002, Yunji Chen, Ling Li 0001, Cheng Qian, Weiwu Hu	Brief announcement: program regularization in verifying memory consistency.	SPAA	2011	DBLP DOI BibTeX RDF
1	David Dice	Brief announcement: a partitioned ticket lock.	SPAA	2011	DBLP DOI BibTeX RDF
1	James Aspnes, Faith Ellen	Tight bounds for anonymous adopt-commit objects.	SPAA	2011	DBLP DOI BibTeX RDF
1	Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk 0001, Roger Wattenhofer	A tight runtime bound for synchronous gathering of autonomous robots with limited visibility.	SPAA	2011	DBLP DOI BibTeX RDF
1	Torvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer	Optimizing hybrid transactional memory: the importance of nonspeculative operations.	SPAA	2011	DBLP DOI BibTeX RDF
1	Francesco Versaci, Keshav Pingali	Brief announcement: processor allocation for optimistic parallelization of irregular programs.	SPAA	2011	DBLP DOI BibTeX RDF
1	Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee	On a bounded budget network creation game.	SPAA	2011	DBLP DOI BibTeX RDF
1	Youngjoon Jo, Milind Kulkarni 0001	Brief announcement: locality-enhancing loop transformations for tree traversal algorithms.	SPAA	2011	DBLP DOI BibTeX RDF
1	Mieszko Lis, Keun Sup Shim, Myong Hyon Cho, Christopher W. Fletcher, Michel A. Kinsy, Ilia A. Lebedev, Omer Khan, Srinivas Devadas	Brief announcement: distributed shared memory based on computation migration.	SPAA	2011	DBLP DOI BibTeX RDF
1	Patrick Briest, Christoph Raupach	The car sharing problem.	SPAA	2011	DBLP DOI BibTeX RDF
1	MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat	On a local protocol for concurrent file transfers.	SPAA	2011	DBLP DOI BibTeX RDF
1	Thomas Locher	Finding heavy distinct hitters in data streams.	SPAA	2011	DBLP DOI BibTeX RDF
1	Victor Pankratius, Ali-Reza Adl-Tabatabai	A study of transactional memory vs. locks in practice.	SPAA	2011	DBLP DOI BibTeX RDF
1	Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert	Brief announcement: reclaiming the energy of a schedule, models and algorithms.	SPAA	2011	DBLP DOI BibTeX RDF
1	Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder	Brief announcement: full reversal routing as a linear dynamical system.	SPAA	2011	DBLP DOI BibTeX RDF
1	Martin Hoefer 0001, Thomas Kesselheim, Berthold Vöcking	Approximation algorithms for secondary spectrum auctions.	SPAA	2011	DBLP DOI BibTeX RDF
1	Cyril Gavoille, Christian Sommer 0001	Sparse spanners vs. compact routing.	SPAA	2011	DBLP DOI BibTeX RDF
1	Mark C. Jeffrey, J. Gregory Steffan	Understanding bloom filter intersection for lazy address-set disambiguation.	SPAA	2011	DBLP DOI BibTeX RDF
1	Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii	Filtering: a method for solving graph problems in MapReduce.	SPAA	2011	DBLP DOI BibTeX RDF
1	Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz	Graph expansion and communication costs of fast matrix multiplication: regular submission.	SPAA	2011	DBLP DOI BibTeX RDF
1	Michael T. Goodrich	Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data.	SPAA	2011	DBLP DOI BibTeX RDF
1	Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler	Re-Chord: a self-stabilizing chord overlay network.	SPAA	2011	DBLP DOI BibTeX RDF
1	Edya Ladan-Mozes, I-Ting Angelina Lee, Dmitry Vyukov	Location-based memory fences.	SPAA	2011	DBLP DOI BibTeX RDF
1	George Constantin Caragea, Uzi Vishkin	Brief announcement: better speedups for parallel max-flow.	SPAA	2011	DBLP DOI BibTeX RDF
1	Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas	A lock-free algorithm for concurrent bags.	SPAA	2011	DBLP DOI BibTeX RDF
1	Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri	Scheduling irregular parallel computations on hierarchical caches.	SPAA	2011	DBLP DOI BibTeX RDF
1	Vincent Gramoli, Rachid Guerraoui	Brief announcement: transaction polymorphism.	SPAA	2011	DBLP DOI BibTeX RDF
1	Benjamin Moseley, Anirban Dasgupta 0001, Ravi Kumar 0001, Tamás Sarlós	On scheduling in map-reduce and flow-shops.	SPAA	2011	DBLP DOI BibTeX RDF
1	Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano	Convergence to equilibrium of logit dynamics for strategic games.	SPAA	2011	DBLP DOI BibTeX RDF
1	Arunabha Sen, Sujogya Banerjee, Pavel Ghosh, Sudheendra Murthy, Hung Q. Ngo 0001	Brief announcement: on regenerator placement problems in optical networks.	SPAA	2010	DBLP DOI BibTeX RDF	regenerator placement, optical networks, lightpath, reachability graph
1	Geoffrey Charles Fox	Algorithms and application for grids and clouds.	SPAA	2010	DBLP DOI BibTeX RDF	data deluge, clustering, grids, clouds, mapreduce, dimension reduction, blast, mpi, life sciences
1	Alexander Fanghänel, Sascha Geulen, Martin Hoefer 0001, Berthold Vöcking	Online capacity maximization in wireless networks.	SPAA	2010	DBLP DOI BibTeX RDF	online algorithms, competitive analysis, physical model, sinr
1	Guy E. Blelloch, Kanat Tangwongsan	Parallel approximation algorithms for facility-location problems.	SPAA	2010	DBLP DOI BibTeX RDF	parallel algorithms, approximation algorithms, facility location problems
1	JongSoo Park, William J. Dally	Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures.	SPAA	2010	DBLP DOI BibTeX RDF	compiler and tools for concurrent programming, green computing and power-efficient architectures, multi-core architectures, stream programming
1	Yuxiong He, Charles E. Leiserson, William M. Leiserson	The Cilkview scalability analyzer.	SPAA	2010	DBLP DOI BibTeX RDF	burdened parallelism, cilk++, cilkview, dag model, performance, scalability, parallel programming, parallelism, software tools, multithreading, speedup, work, span, multicore programming
1	Kunal Agrawal, I-Ting Angelina Lee, Jim Sukha	Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages.	SPAA	2010	DBLP DOI BibTeX RDF	dynamic multithreading, intel threading building blocks, serial-parallel reciprocity, scheduling, work stealing, cilk
1	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec	Brief announcement: byzantine agreement with homonyms.	SPAA	2010	DBLP DOI BibTeX RDF	authentication, message-passing, consensus, byzantine agreement
1	Anne Benoit, Fanny Dufossé, Matthieu Gallet, Yves Robert, Bruno Gaujal	Computing the throughput of probabilistic and replicated streaming applications.	SPAA	2010	DBLP DOI BibTeX RDF	probabilistic streaming applications, scheduling, Markov chains, replication, throughput, timed Petri nets
1	Ioannis Chatzigiannakis, Georgios Mylonas, Orestis Akribopoulos, Marios Logaras, Panagiotis C. Kokkinos, Paul G. Spirakis	Brief announcement: fun in numbers - a platform for sensor-based multiplayer pervasive games.	SPAA	2010	DBLP DOI BibTeX RDF	wireless sensor networks, protocols, pervasive games
1	James Aspnes, David Eisenstat, Yitong Yin	Low-contention data structures.	SPAA	2010	DBLP DOI BibTeX RDF	data structure, memory contention, cell-probe model
1	David Dice, Yossi Lev, Virendra J. Marathe, Mark Moir, Daniel Nussbaum, Marek Olszewski	Simplifying concurrent algorithms by exploiting hardware transactional memory.	SPAA	2010	DBLP DOI BibTeX RDF	synchronization, transactional memory, hardware
1	Vijay Anand Korthikanti, Gul Agha	Towards optimizing energy costs of algorithms for shared memory architectures.	SPAA	2010	DBLP DOI BibTeX RDF	performance, parallel algorithms, energy, shared memory architectures
1	Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel 0001	Balls into bins with related random choices.	SPAA	2010	DBLP DOI BibTeX RDF	balls into bins, peer-to-peer
1	Arne Vater, Christian Schindelhauer, Christian Ortolf	Tree network coding for peer-to-peer networks.	SPAA	2010	DBLP DOI BibTeX RDF	peer-to-peer networks, network coding, bittorrent
1	Phong Chuong, Faith Ellen, Vijaya Ramachandran	A universal construction for wait-free transaction friendly data structures.	SPAA	2010	DBLP DOI BibTeX RDF	abortable data structure, transaction friendly, universal construction, wait-free, cache-efficiency
1	Michael J. Fischer, Xueyuan Su, Yitong Yin	Assigning tasks for efficiency in Hadoop: extended abstract.	SPAA	2010	DBLP DOI BibTeX RDF	approximation algorithm, load balancing, np-completeness, mapreduce, hadoop, task assignment
1	Sina Meraji, Wei Zhang 0034, Carl Tropper	Brief announcement: a reinforcement learning approach for dynamic load-balancing of parallel digital logic simulation.	SPAA	2010	DBLP DOI BibTeX RDF	digital logic simulation, reinforcement learning, dynamic load-balancing, time warp, verilog
1	Erik D. Demaine, Morteza Zadimoghaddam	Scheduling to minimize power consumption using submodular functions.	SPAA	2010	DBLP DOI BibTeX RDF	pre-emptive scheduling, sleep state, approximation algorithms, multiprocessor scheduling
1	Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafrir	Flat combining and the synchronization-parallelism tradeoff.	SPAA	2010	DBLP DOI BibTeX RDF	synchronization, multiprocessors, concurrent data-structures
1	Anastasia Ailamaki	Database systems in the multicore era.	SPAA	2010	DBLP DOI BibTeX RDF	deep memory hierarchies, multithreaded storage management, multicore systems
1	Pierre Fraigniaud, Andrzej Pelc	Delays induce an exponential memory gap for rendezvous in trees.	SPAA	2010	DBLP DOI BibTeX RDF	mobile entities, robots, exploration, abstract state machine, rendezvous
1	Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton	Basic network creation games.	SPAA	2010	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
1	Paolo Romano 0002, Roberto Palmieri, Francesco Quaglia, Nuno Carvalho, Luís E. T. Rodrigues	Brief announcement: on speculative replication of transactional systems.	SPAA	2010	DBLP DOI BibTeX RDF	serialization theory, replication, atomic broadcast
1	Enoch Peserico	Brief announcement: flashcrowding in tiled multiprocessors under thermal constraints.	SPAA	2010	DBLP DOI BibTeX RDF	energy, multicore, tiled, hot spot, thermal
1	Woongki Baek, Nathan Grasso Bronson, Christos Kozyrakis, Kunle Olukotun	Implementing and evaluating nested parallel transactions in software transactional memory.	SPAA	2010	DBLP DOI BibTeX RDF	parallel programming, transactional memory, nested parallelism
1	Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet	Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem.	SPAA	2010	DBLP DOI BibTeX RDF	communication bounds, sparse Cholesky
1	Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri	Low depth cache-oblivious algorithms.	SPAA	2010	DBLP DOI BibTeX RDF	sparse-matrix vector multiply, schedulers, parallel algorithms, multiprocessors, sorting, graph algorithms, cache-oblivious algorithms
1	Ernie Chan, Robert A. van de Geijn, Andrew Chapman	Managing the complexity of lookahead for LU factorization with pivoting.	SPAA	2010	DBLP DOI BibTeX RDF	LU factorization with partial pivoting, algorithm-by-blocks, directed acyclic graph, lookahead
1	Peng Li, Kunal Agrawal, Jeremy Buhler, Roger D. Chamberlain	Deadlock avoidance for streaming computations with filtering.	SPAA	2010	DBLP DOI BibTeX RDF	architecturally diverse platforms, dataflow, data filtering
1	Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide	A local O(n2) gathering algorithm.	SPAA	2010	DBLP DOI BibTeX RDF	distributed algorithms, local algorithms, swarm robotics, gathering, geometric networks
1	Michela Becchi, Surendra Byna, Srihari Cadambi, Srimat T. Chakradhar	Data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory.	SPAA	2010	DBLP DOI BibTeX RDF	accelerators, distributed memory, multi-core processors, runtime, heterogeneous platforms
1	Bertrand Ducourthial, Sofiane Khalfallah, Franck Petit	Best-effort group service in dynamic networks.	SPAA	2010	DBLP DOI BibTeX RDF	group maintenance, stabilization, vehicular network, dynamic network, best effort
1	David Dice, Nir Shavit	TLRW: return of the read-write lock.	SPAA	2010	DBLP DOI BibTeX RDF	multicore processors, concurrent data structures
1	Peter Krusche, Alexander Tiskin	New algorithms for efficient parallel string comparison.	SPAA	2010	DBLP DOI BibTeX RDF	BSP algorithms, longest increasing subsequences, longest common subsequences
1	Jen-Yeu Chen, Gopal Pandurangan	Optimal gossip-based aggregate computation.	SPAA	2010	DBLP DOI BibTeX RDF	distributed randomized protocols, lower bounds, probabilistic analysis, gossip-based protocols, aggregate computation
1	Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam	Collaborative scoring with dishonest participants.	SPAA	2010	DBLP DOI BibTeX RDF	fault tolerance, recommendation systems, collaborative filtering, randomized algorithms
1	Charles E. Leiserson, Tao B. Schardl	A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).	SPAA	2010	DBLP DOI BibTeX RDF	hyperobjects, parallel algorithms, multithreading, graph algorithms, reducers, nondeterminism, work-stealing, breadth-first search, cilk
1	Youngjoon Jo, Milind Kulkarni 0001	Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications.	SPAA	2010	DBLP DOI BibTeX RDF	load balancing, data partitioning, speculative parallelization, irregular programs
1	Michael F. Spear	Lightweight, robust adaptivity for software transactional memory.	SPAA	2010	DBLP DOI BibTeX RDF	adaptivity, synchronization, atomicity, serializability
1	Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zarko Milosevic 0001, Calvin C. Newport	Securing every bit: authenticated broadcast in radio networks.	SPAA	2010	DBLP DOI BibTeX RDF	wireless networks, broadcast, byzantine faults
1	Anupam Gupta 0001, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs	Scheduling jobs with varying parallelizability to reduce variance.	SPAA	2010	DBLP DOI BibTeX RDF	online algorithms, scheduling algorithms
1	Matti Åstrand, Jukka Suomela	Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks.	SPAA	2010	DBLP DOI BibTeX RDF	edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network
1	Keren Censor-Hillel	Multi-sided shared coins and randomized set-agreement.	SPAA	2010	DBLP DOI BibTeX RDF	multi-valued shared coins, distributed computing, randomized algorithms, shared memory, set-agreement
1	Hagit Attiya, Vincent Gramoli, Alessia Milani	Brief announcement: combine -- an improved directory-based consistency protocol.	SPAA	2010	DBLP DOI BibTeX RDF	overlay tree, combining, stretch
1	Pierre Fraigniaud, George Giakkoupis	On the bit communication complexity of randomized rumor spreading.	SPAA	2010	DBLP DOI BibTeX RDF	bit communication complexity, random phone call, rumor spreading
1	Friedhelm Meyer auf der Heide, Cynthia A. Phillips (eds.)	SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010	SPAA	2010	DBLP DOI BibTeX RDF
1	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2010	DBLP DOI BibTeX RDF	contention managers, wait-freedom, obstruction-freedom
1	Rachid Guerraoui, Thomas A. Henzinger, Michal Kapalka, Vasu Singh	Transactions in the jungle.	SPAA	2010	DBLP DOI BibTeX RDF	transactional memory, correctness, memory models
1	MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff	Scheduling to minimize staleness and stretch in real-time data warehouses.	SPAA	2009	DBLP DOI BibTeX RDF	data warehouse maintenance, competitive analysis, on-line scheduling
1	Fabian Kuhn	Weak graph colorings: distributed algorithms and applications.	SPAA	2009	DBLP DOI BibTeX RDF	deterministic symmetry breaking, distributed algorithms, locality, graph coloring
1	Idit Keidar, Dmitri Perelman	On avoiding spare aborts in transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	transactional memory
1	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	The weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2009	DBLP DOI BibTeX RDF	mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
1	Christian Ortolf, Christian Schindelhauer, Arne Vater	Classifying peer-to-peer network coding schemes.	SPAA	2009	DBLP DOI BibTeX RDF	peer-to-peer networks, network coding, bittorrent
1	Hagit Attiya, Eshcar Hillel, Alessia Milani	Inherent limitations on disjoint-access parallel implementations of transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	disjoint-access parallelism, partial snapshots, lower bound, transactional memory, impossibility result
1	Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder	Routing without ordering.	SPAA	2009	DBLP DOI BibTeX RDF	link reversal, routing, work complexity
1	George C. Caragea, A. Beliz Saybasili, Xingzhi Wen, Uzi Vishkin	Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor.	SPAA	2009	DBLP DOI BibTeX RDF	ease of programming, explicit multi-treading, on-chip parallel processor, paraleap, parallel algorithms, PRAM, xmt
1	Matteo Frigo, Pablo Halpern, Charles E. Leiserson, Stephen Lewin-Berlin	Reducers and other Cilk++ hyperobjects.	SPAA	2009	DBLP DOI BibTeX RDF	cilk++, hyperobject, reducer, cilk
1	Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela	An optimal local approximation algorithm for max-min linear programs.	SPAA	2009	DBLP DOI BibTeX RDF	approximation algorithms, linear programs, local algorithms

Publications at "SPAA"( http://dblp.L3S.de/Venues/SPAA )