STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.1, No. 1)Publication Date: 2012-12-01
Authors : Manik Sharma; Smriti Smriti;
Page : 10-15
Keywords : BNP; HLFET; DLS; 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.
Other Latest Articles
- An Alternate Algorithm for (3x3) Median Filtering of Digital Images
- A METRICS BASED APPROACH TO ANALYSE WEB USAGE PATTERN
- Cloud Requirement and Cloud Analysis
- PERFORMANCE EVALUATION OF IMAGE QUALITY BASED ON FRACTAL IMAGE COMPRESSION
- COMPARATIVE STUDY OF STATIC METRICS OF PROCEDURAL AND OBJECT ORIENTED PROGRAMMING LANGUAGES
Last modified: 2016-06-30 14:29:04