Provably efficient scheduling for relaxed multithreaded computations
In this thesis, we study the problem of efficient scheduling of the dynamic parallel multi-threaded computation in terms of their execution time, space requirements and communication cost.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/2639 |