Sciweavers

SPAA
2009
ACM
15 years 2 days ago
Approximation algorithms for time-constrained scheduling on line networks
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
Harald Räcke, Adi Rosén
SPAA
2009
ACM
15 years 2 days ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
SPAA
2009
ACM
15 years 2 days ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
SPAA
2009
ACM
15 years 2 days ago
Towards transactional memory semantics for C++
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert ...
SPAA
2009
ACM
15 years 2 days ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
SPAA
2009
ACM
15 years 2 days ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
SPAA
2009
ACM
15 years 2 days ago
Mapping filtering streaming applications with communication costs
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
Kunal Agrawal, Anne Benoit, Fanny Dufossé, ...
SPAA
2009
ACM
15 years 2 days ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
SPAA
2009
ACM
15 years 2 days ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
SPAA
2009
ACM
15 years 2 days ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa