Parallel computing is a promising approach to meet the computational requirement of large number of current and emerging applications. It is a technique of executing multiple tasks simultaneously on multiple processors. The main goal of parallel computing is to increase the computation speed. Efficient task scheduling and mapping are the big issues in homogeneous parallel computing environment. In this paper, several classes of algorithm are examine and then compare the performance of a class of scheduling algorithms known as the Bounded Number of Processors (BNP) scheduling algorithms. Therefore, four scheduling algorithms namely, HLFET, MCP, ETF and DLS are selected for evaluation. Evaluation is based on various scheduling parameters such as makespan, speedup etc. The focus of algorithms is to minimizing the total schedule length and increasing the efficiency of the system to improve the performance of system