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.
Saved in:
Main Author: | Gordienko, Maksim. |
---|---|
Other Authors: | Hsu, Wen Jing |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/2639 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Similar Items
-
Provably-efficient adaptive scheduling of multiprocessors for performance and energy
by: Sun, Hongyang
Published: (2011) -
Provably efficient adaptive scheduling of parallel jobs on multiprocessors
by: He, Yuxiong
Published: (2014) -
Study of spring-relaxation technique for cooperative localization in wireless sensor networks
by: Zhang, Qing
Published: (2013) -
Scheduling algorithms for multi-core and GPU
by: Song, Lee Yong.
Published: (2011) -
Scheduling of dynamically evolving parallel programs using the genetic approach
by: Ooi, Boon Pin.
Published: (2011)