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:
主要作者: | |
---|---|
其他作者: | |
格式: | Final Year Project |
語言: | English |
出版: |
2010
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/39719 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!