Sciweavers

SPAA
2004
ACM
15 years 2 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
49
Voted
SPAA
2004
ACM
15 years 2 months ago
Bi-criteria algorithm for scheduling jobs on cluster platforms
Pierre-François Dutot, Lionel Eyraud, Gr&ea...
73
Voted
SPAA
2004
ACM
15 years 2 months ago
DCAS is not a silver bullet for nonblocking algorithm design
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only s...
Simon Doherty, David Detlefs, Lindsay Groves, Chri...
84
Voted
SPAA
2004
ACM
15 years 2 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
43
Voted
SPAA
2004
ACM
15 years 2 months ago
Parallelism versus memory allocation in pipelined router forwarding engines
Fan R. K. Chung, Ronald L. Graham, George Varghese
SPAA
2004
ACM
15 years 2 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
62
Voted
SPAA
2004
ACM
15 years 2 months ago
Improved combination of online algorithms for acceptance and rejection
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
David P. Bunde, Yishay Mansour
SPAA
2004
ACM
15 years 2 months ago
Effectively sharing a cache among threads
We compare the number of cache misses M1 for running a computation on a single processor with cache size C1 to the total number of misses Mp for the same computation when using p ...
Guy E. Blelloch, Phillip B. Gibbons
50
Voted
SPAA
2004
ACM
15 years 2 months ago
Sharing the cost of multicast transmissions in wireless networks
Vittorio Bilò, Chiara Di Francescomarino, M...
SPAA
2004
ACM
15 years 2 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...