Examining branch and bound strategy on multiprocessor task scheduling

Author

Rahman, Md Mamunur ; Chowdhury, Muhammad Foizul Islam

Author_Institution

Dept. of Comput. Sci. & Eng., Leading Univ., Bangladesh

fYear

2009

fDate

21-23 Dec. 2009

Firstpage

162

Lastpage

167

Abstract

The multiprocessor task graph scheduling problem has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. The problem is already being known as one of the NP-hard problems. There are many good approaches made with many optimizing algorithm to find out the optimum solution for this problem with less computational time. One of them is branch and bound algorithm. In this paper, we studied the branch and bound algorithm for the multiprocessor scheduling problem.

Keywords

optimisation; parallel algorithms; processor scheduling; tree searching; NP-hard problems; academic optimization problem; branch and bound algorithm; execution time optimization; multiprocessor task graph scheduling; optimizing algorithm; parallel algorithm; parallel computer; Application software; Computer science; Concurrent computing; Costs; Delay; Information technology; Multiprocessor interconnection networks; Parallel algorithms; Processor scheduling; Scheduling algorithm; A Multiprocessor scheduling problems; Branch and Bound; Lower Bound; Task Graph Scheduling; Upper Bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Information Technology, 2009. ICCIT '09. 12th International Conference on

Conference_Location

Dhaka

Print_ISBN

978-1-4244-6281-0

Type

conf

DOI

10.1109/ICCIT.2009.5407146

Filename

5407146