STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE

Abstract

Parallel processing is a technique of executing the multiple tasksconcurrently on different processors. Parallel processing is usedto solve the complex problems that require vast amount ofprocessing time. Task scheduling is one of the major problemsof parallel processing. The objective of this study is to analyzethe performance of static (HLFET) and dynamic (DLS) BNPparallel scheduling algorithm for allocating the tasks ofdistributed database over number of processors. In the wholestudy the focus will be given on measuring the impact ofnumber of processors on different metrics of performance likemakespan, speed up and processor utilization by using HLFETand DLS BNP task scheduling algorithms.