STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE

Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2011, Vol 1, Issue 1

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.

Authors and Affiliations

Manik Sharma, Smriti Smriti

Keywords

Related Articles

Are We Really Preparing Preservice Teachers to Teach with Technology in the Classroom?

Are Quebec’s future teachers well prepared to integrate information and communication technologies (ICT) into the classroom? To answer this question, 2,065 teachers-in-training from nine universities offering teacher o...

Spline Computation for Solving Magnetohidrodynamics Free Convection Flow

In this paper, we construct numerical algorithms for solving Magnetohidrodynamics(MHD) free convection flow rate whichhas been discussed in detail. It is observed that, for a nonlinear system of differential equation, th...

Virtual Machine Selection Algorithm Based on User Requirements in Mobile Cloud Computing Environment

The article analyzes the advantages of mobile cloud technologies and problems emerging during the use of those. The network infrastructure created based on cloudlets at the second level of mobile cloud computing with hie...

Study and Comparison of four Agent-Based Simulation Tools: Repast, SeSAm, Netlogo and GAMA

Several simulation tools have been proposed in the literature and many surveys have been realized on this. The objective of this paper is not to give a survey but to compare four principal tools which are Repast, SeSAm,...

Advance Neighbor Embedding for Image Super Resolution

This paper presents the Advance Neighbor embedding (ANE) method for image super resolution. The assumption of the neighbor-embedding (NE) algorithm for single-image super-resolution Reconstruction is that the feature spa...

Download PDF file
  • EP ID EP649776
  • DOI 10.24297/ijct.v1i1.2601
  • Views 92
  • Downloads 0

How To Cite

Manik Sharma, Smriti Smriti (2011). STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE. INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 1(1), 10-15. https://europub.co.uk/articles/-A-649776