Parallelizing the Critical Path
For many parallel matrix computations the execution time is determinedby the length of the critical path. The baseline approach used to reduce the execution time is to adjust the task granularity. If the tasks are made smaller, the length of the critical path will decrease and by extension reduce th...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för datavetenskap
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-128410 |