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

Alternative Vidhi to Conversion of Cyclic CNF->GNF

In automata theory Greibach Normal Form shows that A->aV n*, where ‘a’ is terminal symbol and Vn is nonterminal symbol where * shows zero or more rates of Vn [1]. Most popular questions, conversion of following c...

Study of Image steganography using LSB, DFT and DWT

In this paper we have studied and implement the color image steganography using LSB, DFT and DWT. First we have studied the various literatures of LSB, DFT and DWT and then implemented one system in which we can do stega...

Performance Evaluation for VoIP on Campus

The VoIP Campus implementation is to make the existing VoIP technology become more beneficial for campus stake holder. This VoIP on Campus (VoC) technology make use of a web server, facilitating users to carry out VoIP r...

Information Management

Information management (IM) is the collection and management of information from one or more sources and the distribution of that information to one or more audiences. Management means the organization of and control ove...

A NOVEL APPROACH OF CLUSTERING FOR ENHANCED LIFETIME IN WIRELESS SENSOR NETWORK

Wireless sensor network has revolutionized the way computing and software services are delivered to the clients on demand. Our research work proposed a new method for cluster head selection having less computational comp...

Download PDF file
  • EP ID EP649776
  • DOI 10.24297/ijct.v1i1.2601
  • Views 72
  • 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