Annu Priya

Annu Priya

Auto-generated profile, based on publicly available information

Annu Priya

Birla Institute of Technology

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 January 2019
Verified
Book Chapter
Closed access
PDF file
Keshav SinhaKeshav Sinha
Keshav Sinha
RKRashmi Kumari
Rashmi Kumari
APAnnu Priya
Annu Priya
PPPartha Paul
Partha Paul

31 July 2018
Verified
Book Chapter
Closed access
PDF file
APAnnu Priya
Annu Priya
Keshav SinhaKeshav Sinha
Keshav Sinha
MDManu Priya Darshani
Manu Priya Darshani
SSSudip Kumar Sahana
Sudip Kumar Sahana

9 November 2016
Verified
Book Chapter
Open access
PDF file
Keshav SinhaKeshav Sinha
Keshav Sinha
APAnnu Priya
Annu Priya
MKMoumita Khowas
Moumita Khowas
One of the most frequently encountered problems in the real world financial sector is Budget Allocation. Budget Allocation keeps in line the planning of the actual operations by managing concern problem before they arise. A given budget information supports the development operations of managing, planning and controlling aspects of any given setup. There are several conventional technique for budget allocation like OCBA, EA, MOCBA, etc. For large scale budgeting problem the performance of conventional technique degrades. We like to propose an evolutionary computing based infrastructure for Budget Allocation and Optimization and make a comparative performance analysis on Particle Swarm Optimization (PSO) based Optimal Computing Budget Allocation (OCBA) and PSO based Equal Allocation (EA).

2 August 2018
Verified
Book Chapter
Closed access
PDF file
APAnnu Priya
Annu Priya
SSSudip Kumar Sahana
Sudip Kumar Sahana

21 February 2020 in IEEE Access
Verified
Journal Article
Open access
APAnnu Priya
Annu Priya
Sudip Kumar SahanaSudip Kumar Sahana
Sudip Kumar Sahana
Multiprocessor scheduling is one of the thrust areas in the field of computational science. There are various traditional scheduling techniques exist for the allocation and processing of jobs. But the performance of these techniques reduce in terms of makespan and waiting time when a large number of jobs are allocated to multiprocessors. In this paper, a new stochastic evolutionary technique is proposed based on the Genetic Algorithm and Pareto optimality. The new technique is implemented in a high-performance computing (HPC) environment using a Message passing interface (MPI) to resolve the permutation flow shop scheduling problem. Pareto optimality technique is used for sample distribution and the basis of the decision to select the lower bound of the makespan, instead of selecting the makespan directly for the best solution. The performance and quality evaluation of proposed techniques (GA_PO_MPI, GA) are compared with traditional techniques (FCFS, FCFS_MPI, TSAB, TSGP, TSGW) on the basis of Relative Percentage Deviation (RPD), Computational Time (CT) and Average Waiting Time and found satisfactory.