A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE
2002
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
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
doi:10.24297/ijct.v1i1.2601
fatcat:d2ubgnmc5jdl3ofyxrr3xo7t3e