Robust scheduling for heterogeneous architectures

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...

Full description

Bibliographic Details
Main Author: Wong, Yi Wen.
Other Authors: Low Yoke Hean, Malcolm
Format: Final Year Project (FYP)
Language:English
Published: 2010
Subjects:
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Processor architectures
Online Access:http://hdl.handle.net/10356/39719

Internet

http://hdl.handle.net/10356/39719

Similar Items