Search results for "SPAA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Chris Harrelson, Kirsten Hildrum, Satish Rao	A polynomial-time tree decomposition to minimize congestion.	SPAA	2003	DBLP DOI BibTeX RDF	congestion, preconditioning, oblivious routing, tree decomposition
1	Arnold L. Rosenberg, Friedhelm Meyer auf der Heide (eds.)	SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003)	SPAA	2003	DBLP DOI BibTeX RDF
1	Christian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert	Worst case mobility in ad hoc networks.	SPAA	2003	DBLP DOI BibTeX RDF	mobility, wireless networks, network topologies
1	Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka	Compact routing with name independence.	SPAA	2003	DBLP DOI BibTeX RDF	distributed lookup tables, compact routing, stretch
1	Géraud Krawezik	Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors.	SPAA	2003	DBLP DOI BibTeX RDF	performance evaluation, MPI, multiprocessors, shared memory, openMP
1	Lars Arge, Laura Toma, Norbert Zeh	I/O-efficient topological sorting of planar DAGs.	SPAA	2003	DBLP DOI BibTeX RDF	I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition
1	Nir Avrahami, Yossi Azar	Minimizing total flow time and total completion time with immediate dispatching.	SPAA	2003	DBLP DOI BibTeX RDF	competitive, on-line, flow time, completion time
1	Brian Towles, William J. Dally, Stephen P. Boyd	Throughput-centric routing algorithm design.	SPAA	2003	DBLP DOI BibTeX RDF	interconnection networks, multicommodity flows, oblivious routing
1	Jeff Edmonds, Suprakash Datta, Patrick W. Dymond	TCP is competitive against a limited adversary.	SPAA	2003	DBLP DOI BibTeX RDF	scheduling, performance evaluation, congestion control, TCP/IP, competitive analysis
1	Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke	A practical algorithm for constructing oblivious routing schemes.	SPAA	2003	DBLP DOI BibTeX RDF
1	Gagan Aggarwal, Rajeev Motwani 0001, An Zhu	The load rebalancing problem.	SPAA	2003	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, load balancing
1	Peter Sanders 0001, Sebastian Egner, Ludo M. G. M. Tolhuizen	Polynomial time algorithms for network information flow.	SPAA	2003	DBLP DOI BibTeX RDF	communication, multicasting, randomized algorithm, finite field, coding, linear algebra, derandomization, network information theory
1	Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson	A proportionate fair scheduling rule with good worst-case performance.	SPAA	2003	DBLP DOI BibTeX RDF
1	Victor Luchangco, Mark Moir, Nir Shavit	Nonblocking k-compare-single-swap.	SPAA	2003	DBLP DOI BibTeX RDF	multiprocessors, concurrent data structures, linked lists, nonblocking synchronization, obstruction-freedom
1	Micah Adler, Ying Gong, Arnold L. Rosenberg	Optimal sharing of bags of tasks in heterogeneous clusters.	SPAA	2003	DBLP DOI BibTeX RDF	bags of tasks workloads, heterogeneous NOW, worksharing, cluster computing, network of workstations (NOW)
1	Esther M. Arkin, Michael A. Bender, Dongdong Ge	Improved approximation algorithms for the freeze-tag problem.	SPAA	2003	DBLP DOI BibTeX RDF	freeze-tag problem, minimum broadcast-time problem, minimum gossip time problem, multicast problem, scheduling, approximation algorithms, NP-hardness, TSP, data dissemination, swarm robotics, network optimization
1	Jesse D. Bingham, Anne Condon, Alan J. Hu	Toward a decidable notion of sequential consistency.	SPAA	2003	DBLP DOI BibTeX RDF	shared memory systems, memory model, sequential consistency
1	Yossi Azar, Avrim Blum, Yishay Mansour	Combining online algorithms for rejection and acceptance.	SPAA	2003	DBLP DOI BibTeX RDF	QoS, admission control, competitive, on-line
1	Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman	Designing overlay multicast networks for streaming.	SPAA	2003	DBLP DOI BibTeX RDF	approximation algorithms, network design, streaming media, network reliability
1	Jens Gustedt	Randomized permutations in a coarse grained parallel environment.	SPAA	2003	DBLP DOI BibTeX RDF	uniformly generated communication matrix, coarse grained parallelism, randomized permutations
1	Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro	Capture of an intruder by mobile agents.	SPAA	2002	DBLP DOI BibTeX RDF	network intruder, mobile agent, graph-searching
1	Brian Towles, William J. Dally	Worst-case traffic for oblivious routing functions.	SPAA	2002	DBLP DOI BibTeX RDF	worst-case throughput, interconnection networks, oblivious routing
1	Matthias Westermann	Distributed caching independent of the network size.	SPAA	2002	DBLP DOI BibTeX RDF	caching, computer networks, data management
1	Zvi Lotker, Boaz Patt-Shamir, Adi Rosén	New stability results for adversarial queuing.	SPAA	2002	DBLP DOI BibTeX RDF	adversarial queuing theory
1	Gautam Gupta, Sanjay V. Rajopadhye, Patrice Quinton	Scheduling reductions on realistic machines.	SPAA	2002	DBLP DOI BibTeX RDF	parametric integer programming, dependence analysis, automatic parallelization, scheduling theory, polyhedral model, affine recurrence equations
1	Kirsten Hildrum, John Kubiatowicz, Satish Rao, Ben Y. Zhao	Distributed object location in a dynamic network.	SPAA	2002	DBLP DOI BibTeX RDF	DOLR, distributed object location, tapestry, peer-to-peer, networking, locality, DHT, distributed hash table, nearest neighbor, overlay
1	Maged M. Michael	High performance dynamic lock-free hash tables and list-based sets.	SPAA	2002	DBLP DOI BibTeX RDF
1	Carme Àlvarez, Maria J. Blesa, Maria J. Serna	Universal stability of undirected graphs in the adversarial queueing model.	SPAA	2002	DBLP DOI BibTeX RDF	adversarial queueing, greedy protocols, packet switched networks, network stability
1	Enoch Peserico	The lazy adversary conjecture fails.	SPAA	2002	DBLP DOI BibTeX RDF	k-server, lazy adversary, memoryless, competitive analysis
1	Phillip B. Gibbons, Srikanta Tirthapura	Distributed streams algorithms for sliding windows.	SPAA	2002	DBLP DOI BibTeX RDF	distributed, data streams, sliding windows, waves
1	Michel Raynal	Sequential consistency as lazy linearizability.	SPAA	2002	DBLP DOI BibTeX RDF	sequential consistency, linearizability
1	Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, S. Muthukrishnan 0001, Thyagarajan Nandagopal, Andrea Vitaletti	Parallel scheduling problems in next generation wireless networks.	SPAA	2002	DBLP DOI BibTeX RDF
1	Francisco Almeida, Rumen Andonov, Daniel González, Luz Marina Moreno, Vincent Poirriez, Casiano Rodríguez	Optimal tiling for the RNA base pairing problem.	SPAA	2002	DBLP DOI BibTeX RDF	granularity on distributed memory machines, dynamic programming, MPI, SPMD, BSP model, RNA secondary structure prediction, loop partitioning
1	Emmanuelle Anceaume, Jean-Michel Hélary, Michel Raynal	Tracking immediate predecessors in distributed computations.	SPAA	2002	DBLP DOI BibTeX RDF	Hasse diagram, causality tracking, immediate predecessor, message-passing, timestamp, vector clock, asynchronous distributed computations
1	Uzi Vishkin	Two techniques for reconciling algorithm parallelism with memory constraints.	SPAA	2002	DBLP DOI BibTeX RDF	memory systems constraints, parallel algorithms, prefetching
1	Jean-François Nezan, Olivier Déforges, Mickaël Raulet	Rapid prototyping methodology for multi-DSP TI C6X platforms applied to an Mpeg-2 coding application.	SPAA	2002	DBLP DOI BibTeX RDF	multi-TMS320C6x, real-time, Mpeg-2
1	Bogdan S. Chlebus, Dariusz R. Kowalski	Gossiping to reach consensus.	SPAA	2002	DBLP DOI BibTeX RDF	distributed algorithm, lower bound, consensus, gossiping, processor failures, adaptive adversary
1	Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald	Energy, congestion and dilation in radio networks.	SPAA	2002	DBLP DOI BibTeX RDF	routing, wireless communication, radio networks
1	Harold W. Cain, Mikko H. Lipasti	Verifying sequential consistency using vector clocks.	SPAA	2002	DBLP DOI BibTeX RDF
1	André Brinkmann, Kay Salzwedel, Christian Scheideler	Compact, adaptive placement schemes for non-uniform requirements.	SPAA	2002	DBLP DOI BibTeX RDF	adaptive hashing, balls into bins, non-uniform disks, random graphs, web caching, RAID, distributed data storage
1	Hui Wu 0001, Joxan Jaffar	Two processor scheduling with real release times and deadlines.	SPAA	2002	DBLP DOI BibTeX RDF	release time and deadline, successor-tree-consistency, task scheduling, feasible schedule
1	Jeremy Brown, J. P. Grossman, Tom Knight	A lightweight idempotent messaging protocol for faulty networks.	SPAA	2002	DBLP DOI BibTeX RDF	block-structured traces, source-reliable messaging, idempotence
1	Frank Hannig, Jürgen Teich	Energy estimation of nested loop programs.	SPAA	2002	DBLP DOI BibTeX RDF	hardware mapping, low power, processor arrays
1	Anasua Bhowmik, Manoj Franklin	A general compiler framework for speculative multithreading.	SPAA	2002	DBLP DOI BibTeX RDF	TLP compiler, thread formation, parallelization, data dependence, thread-level parallelism (TLP), control dependence, speculative multithreading (SpMT)
1	Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman	Algorithms for fault-tolerant routing in circuit switched networks.	SPAA	2002	DBLP DOI BibTeX RDF	flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths
1	Danny Hendler, Nir Shavit	Work dealing.	SPAA	2002	DBLP DOI BibTeX RDF	load-balancing, distributed, wait-free
1	Arnold L. Rosenberg, Bruce M. Maggs (eds.)	Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002	SPAA	2002	DBLP DOI BibTeX RDF
1	Carlos E. R. Alves, Edson Cáceres, Frank K. H. A. Dehne	Parallel dynamic programming for solving the string editing problem on a CGM/BSP.	SPAA	2002	DBLP DOI BibTeX RDF	parallel algorithms, dynamic programming, BSP, CGM, string editing
1	Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To	Extra processors versus future information in optimal deadline scheduling.	SPAA	2002	DBLP DOI BibTeX RDF	online algorithms, competitive analysis, resource augmentation, deadline scheduling
1	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	Optimal organizations for pipelined hierarchical memories.	SPAA	2002	DBLP DOI BibTeX RDF	hierarchical memory processor, scalable pipeline
1	Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta	Locality-preserving randomized oblivious routing on torus networks.	SPAA	2002	DBLP DOI BibTeX RDF	locality-preserving, oblivious packet routing, interconnection networks, randomized, k-ary n cubes
1	Jop F. Sibeyn, James Abello, Ulrich Meyer 0001	Heuristics for semi-external depth first search on directed graphs.	SPAA	2002	DBLP DOI BibTeX RDF	strong components, graph algorithms, depth first search, external memory
1	Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe	Nearest common ancestors: a survey and a new distributed algorithm.	SPAA	2002	DBLP DOI BibTeX RDF	ancestor, distributed, labeling
1	Ali Pinar, Bruce Hendrickson	Exploiting flexibly assignable work to improve load balance.	SPAA	2002	DBLP DOI BibTeX RDF	algorithms, load balancing, parallel computing, least squares, maximum-flow
1	Chi-Hsiang Yeh	AT2L2 appr. equal N2/2 for fast fourier transform in multilayer VLSI.	SPAA	2002	DBLP DOI BibTeX RDF	fast Fourier transform (FFT), VLSI layout, butterfly networks
1	Michela Taufer, Thomas Stricker, Roger Weber	Scalability and resource usage of an OLAP benchmark on clusters of PCs.	SPAA	2002	DBLP DOI BibTeX RDF	cluster of PCs, distributed OLAP processing, performance analysis, workload characterization, parallel databases
1	Costas Busch	Õ(congestion + dilation) hot-potato routing on leveled networks.	SPAA	2002	DBLP DOI BibTeX RDF	leveled networks, congestion, dilation, hot-potato routing
1	Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin	Towards a first vertical prototyping of an extremely fine-grained parallel programming approach.	SPAA	2001	DBLP DOI BibTeX RDF	parallel programming, compilers, processor architecture
1	Ulf Lorenz	Parallel controlled conspiracy number search.	SPAA	2001	DBLP DOI BibTeX RDF
1	Costas Busch, Maurice Herlihy, Roger Wattenhofer	Routing without flow control.	SPAA	2001	DBLP DOI BibTeX RDF
1	Thierry Garcia, Jean Frédéric Myoupo, David Semé	A work-optimal CGM algorithm for the LIS problem.	SPAA	2001	DBLP DOI BibTeX RDF
1	Martin Griebl	On tiling space-time mapped loop nests.	SPAA	2001	DBLP DOI BibTeX RDF
1	Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis	Attack propagation in networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons	Room synchronizations.	SPAA	2001	DBLP DOI BibTeX RDF
1	Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic	Latency effects on reachability in large-scale peer-to-peer networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Stefan D. Bruda, Selim G. Akl	Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems.	SPAA	2001	DBLP DOI BibTeX RDF
1	Panagiota Fatourou	Low-contention depth-first scheduling of parallel computations with write-once synchronization variables.	SPAA	2001	DBLP DOI BibTeX RDF
1	Victor Luchangco	Modeling weakly consistent memories with locks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Petr Kolman, Christian Scheideler	Simple on-line algorithms for the maximum disjoint paths problem.	SPAA	2001	DBLP DOI BibTeX RDF
1	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	Computational power of pipelined memory hierarchies.	SPAA	2001	DBLP DOI BibTeX RDF
1	Anne Condon, Alan J. Hu	Automatable verification of sequential consistency.	SPAA	2001	DBLP DOI BibTeX RDF	model checking, memory model, sequential consistency
1	Gábor Ivanyos, Frédéric Magniez, Miklos Santha	Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.	SPAA	2001	DBLP DOI BibTeX RDF
1	Phillip B. Gibbons, Srikanta Tirthapura	Estimating simple functions on the union of data streams.	SPAA	2001	DBLP DOI BibTeX RDF
1	Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos	Stability and non-stability of the FIFO protocol.	SPAA	2001	DBLP DOI BibTeX RDF
1	Christof Krick, Harald Räcke, Matthias Westermann	Approximation algorithms for data management in networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Arnold L. Rosenberg (eds.)	Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001	SPAA	2001	DBLP DOI BibTeX RDF
1	Marek Piotrów	Periodic, random-fault-tolerant correction networks.	SPAA	2001	DBLP DOI BibTeX RDF	correction networks, fault-tolerant sorting, comparators, sorting networks
1	Will McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger	Finding strongly connected components in parallel in particle transport sweeps.	SPAA	2001	DBLP DOI BibTeX RDF
1	Yanyong Zhang, Anand Sivasubramaniam	Scheduling best-effort and real-time pipelined applications on time-shared clusters.	SPAA	2001	DBLP DOI BibTeX RDF	simulation, clusters, parallel scheduling, coscheduling
1	Anders Dessmark, Andrzej Pelc	Tradeoffs between knowledge and time of communication in geometric radio networks.	SPAA	2001	DBLP DOI BibTeX RDF	broadcasting, distributed, knowledge, radio network, deterministic
1	Ellen L. Hahne, Alexander Kesselman, Yishay Mansour	Competitve buffer management for shared-memory switches.	SPAA	2001	DBLP DOI BibTeX RDF
1	Mahesh Kallahalla, Peter J. Varman	Optimal prefetching and caching for parallel I/O systems.	SPAA	2001	DBLP DOI BibTeX RDF
1	Frédéric Havet, Marc Wennink	The push tree problem.	SPAA	2001	DBLP DOI BibTeX RDF	Dynamic data replication, network optimisation, worst case analysis
1	Jean-Guillaume Dumas, Jean-Louis Roch	A parallel block algorithm for exact triangularization of rectangular matrices.	SPAA	2001	DBLP DOI BibTeX RDF
1	Hadas Shachnai, Aravind Srinivasan	Finding large independent sets of hypergraphs in parallel.	SPAA	2001	DBLP DOI BibTeX RDF	parallel algorithms, randomized algorithms, hypergraphs, independent sets
1	David A. Hutchinson, Peter Sanders 0001, Jeffrey Scott Vitter	The power of duality for prefetching and sorting with parallel disks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot	A note on cycle covering.	SPAA	2001	DBLP DOI BibTeX RDF	graph, survivability, WDM, cycle covering
1	Mikkel Thorup, Uri Zwick	Compact routing schemes.	SPAA	2001	DBLP DOI BibTeX RDF
1	Yongbing Zhang, Xiaohua Jia, Sajal K. Das 0001	D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri	A data tracking scheme for general networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov	Scheduling tasks with small communication delays for clusters of processors.	SPAA	2001	DBLP DOI BibTeX RDF
1	Philippas Tsigas, Yi Zhang 0004	A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems.	SPAA	2001	DBLP DOI BibTeX RDF
1	Shay Kutten, David Peleg, Uzi Vishkin	Deterministic resource discovery in distributed networks.	SPAA	2001	DBLP DOI BibTeX RDF
1	Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski	Columnsort lives! an efficient out-of-core sorting program.	SPAA	2001	DBLP DOI BibTeX RDF
1	Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci	One-to-Many routing on the mesh.	SPAA	2001	DBLP DOI BibTeX RDF
1	Myra B. Cohen, Charles J. Colbourn	Ordering disks for double erasure codes.	SPAA	2001	DBLP DOI BibTeX RDF
1	Ami Litman, Shiri Moran-Schein	Fast, minimal and oblivious routing algorithms on the mesh with bounded queues.	SPAA	2001	DBLP DOI BibTeX RDF
1	Achour Mostéfaoui, Michel Raynal	Randomized k-set agreement.	SPAA	2001	DBLP DOI BibTeX RDF	fault-tolerance, consensus, asynchronous system, randomized protocol, k-set Agreement
1	Thomas Rauber, Robert Reilein, Gudula Rünger	Library support for orthogonal processor groups.	SPAA	2001	DBLP DOI BibTeX RDF
1	Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto	Towards practical deteministic write-all algorithms.	SPAA	2001	DBLP DOI BibTeX RDF	Write-All, contention of permutations, scheduling, parallel algorithms, work

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