Sciweavers

36 search results - page 6 / 8
» spaa 2009
Sort
View
SPAA
2009
ACM
15 years 10 months 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 10 months 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 10 months 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 10 months 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 10 months ago
A lightweight in-place implementation for software thread-level speculation
Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...
Cosmin E. Oancea, Alan Mycroft, Tim Harris