Analysis of a DSS Queries in a Distributed Database System

Parallel processing is a technique of executing the multiple tasks concurrently on different processors. Parallel processing helps in solving all the intricate problems that require immense processing time in an optimized way. In case of parallel processing one of the major issues is the scheduling of different tasks on different processors that can be performed in either static list scheduling manner or in dynamic list scheduling manner. The aspiration of this study is to carry out an analysis of one of the static list scheduling algorithm in parallel paradigm known as HLFET BNP scheduling algorithm for executing Decision Support System (DSS) query in distributed database system. Performance is one of the important factors used to find the success rate of parallel system. In this study the focus will be given on measuring the impact of number of processors on different metrics of performance like makespan, speed up and processor utilization while executing subtasks of a DSS query.