Approximate parallel scheduling. The basic technique with applications to optimal parallel list ranking in logarithmic time.
Saved in:
| Title: | Approximate parallel scheduling. The basic technique with applications to optimal parallel list ranking in logarithmic time. |
|---|---|
| Authors: | Cole, Richard, Vishkin, Uzi |
| Source: | SIAM Journal on Computing; February 1988, Vol. 17, p128-142, 15p |
| Database: | Applied Science & Technology Source |
Be the first to leave a comment!