Sciweavers

SPAA
1994
ACM
15 years 27 days ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
65
Voted
SPAA
1994
ACM
15 years 27 days ago
An Optical Simulation of Shared Memory
We present a work-optimal randomized algorithm for simulating a shared memory machine (pram) on an optical communication parallel computer (ocpc). The ocpc model is motivated by t...
Leslie Ann Goldberg, Yossi Matias, Satish Rao
SPAA
1994
ACM
15 years 27 days ago
Job Scheduling in Rings
Perry Fizzano, David R. Karger, Clifford Stein, Jo...