Examining branch and bound strategy on multiprocessor task scheduling

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

Full description

Saved in:
Bibliographic Details
Published in2009 12th International Conference on Computer and Information Technology pp. 162 - 167
Main Authors Rahman, M.M., Chowdhury, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2009
Subjects
A Multiprocessor scheduling problems
Application software
Branch and Bound
Computer science
Concurrent computing
Costs
Delay
Information technology
Lower Bound
Multiprocessor interconnection networks
Parallel algorithms
Processor scheduling
Scheduling algorithm
Task Graph Scheduling
Upper Bound
Online AccessGet full text
ISBN9781424462810
1424462819
DOI10.1109/ICCIT.2009.5407146

Cover

More Information
Summary: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.
ISBN:9781424462810
1424462819
DOI:10.1109/ICCIT.2009.5407146