Robust scheduling for heterogeneous architectures
In this report, the robust scheduling problem for heterogeneous architectures is de ned and discussed. This problem is compared to the classic makespan minimization prob- lem. Two di erent methods, a static heuristic and a dynamic rescheduling algorithm are proposed to solve this problem...
Saved in:
Main Author: | Wong, Yi Wen. |
---|---|
Other Authors: | Low Yoke Hean, Malcolm |
Format: | Final Year Project |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/39719 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Power-balanced instruction scheduling for pipelined VLIW architectures
by: Xiao, Shu
Published: (2008) -
Scheduling jobs on multi-processors
by: Neetika, Bansal
Published: (2012) -
Fuzzy associative memory architecture
by: Ting, Chan Wai
Published: (2011) -
Parallel architectures and algorithms for motion analysis
by: Gunawan, Teddy Surya.
Published: (2008) -
A parallel program development system for multi-core architectures
by: Fu, Yong.
Published: (2010)