141
click to vote
SPAA
15 years 4 months ago
1994 ACM
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...
87
Voted
SPAA
15 years 4 months ago
1994 ACM 85
Voted
SPAA
15 years 4 months ago
1994 ACM
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...
|