|Title:||Job scheduling in multiprocessor systems|
Operating systems (Computers)
Hong Kong Polytechnic University -- Dissertations
Department of Electronic and Information Engineering
|Pages:||ix, 93 leaves : ill. ; 31 cm|
|Abstract:||In this dissertation, the problem of static job scheduling in multiprocessor systems will be considered. For example, for a given job list, in what order the independent jobs should be processed and how to assign these jobs to the processors so that the completion time of the last completed job is minimized. This scheduling problem is known as NP-hard, and methods based on heuristic search have been proposed by researchers to obtain sub-optimal solutions. This dissertation is organized as follows. Two efficient methods for solving static job scheduling problem in multiprocessor systems called "Bottom-Left" and "Branch and Bound Strategy" will be studied and evaluated. Then, a method based on genetic algorithm (GA) will be developed in such a way that it can achieve a better solution. This can be used as a yardstick for the non-optimal static job scheduling methods for measuring their closeness to the optimality. Finally, simulation results (e.g. completion time and execution time) comparing the proposed genetic algorithm, the Bottom-Left algorithm and the Branch and Bound Strategy will be presented.|
Files in This Item:
|b15176885.pdf||For PolyU Staff & Students||3.01 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: