MRM. Bala Satya Sreekara Reddy

M. Bala Satya Sreekara Reddy

*This is an algorithmically generated author record based on publicly available information.

M. Bala Satya Sreekara Reddy has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Task scheduling in cloud computing environment

    by A. V. R. Surya Prasad, N. R. Medikondu, M. B. S. Sreekara Reddy, Rakesh K., K. S. Raghuram, Tribhuwan Kishor Mishra

    Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.

  • Open Access

    Mathematical model for vehicle scheduling

    by A. V. R. Surya Prasad, N. R. Medikondu, M. B. S. Sreekara Reddy, K. Rakesh, A. Shanthi Swaroopini, Preetam Kumar Sahu

    In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move. Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.


  • Open Access

    Soft computing technique for jobs scheduling

    by G. Deepika Reddy, N. R. Medikondu, T. Vijaya Kumar, M. B. S. Sreekara Reddy, P. Harisha, M. Murali Krishna

    In the MUA the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of mean flow time with process time


  • Open Access

    Machine utilization algorithm through numerical model

    by G. Deepika Reddy, T. Vijaya Kumar, M. Nageswara Rao, M. Bala Satya Sreekara Reddy, K. Harish Kumar, G. Vivek

    The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of Machine Utilization Algorithm (MUA) compared with oth