This page has only limited features, please log in for full access.
With the rapid evolution of the industrial Internet, cloud service has emerged as a next-generation industrial standard that has the potential to revolutionize and transform the enterprise industry. In recent years, numerous enterprises have acknowledged the benefits of cloud-based service models. However, the security issues are a major concern, such as stealthy malware attacks against virtual domains. In this paper, we propose an introspection based security approach, called VMShield for securing virtual domains in cloud based service platform, which is designed to detect malware in cloud infrastructure. VMShield performs virtual memory introspection from the hypervisor (trusteddomain) to collect the run-time behavior of processes, making it impossible for the malware to evade the security tool. The use of introspection makes the proposed approach better choice over traditional static and dynamic state-of-the-art techniques which fail to detect stealthy attacks. The VMShield extracts the system call features using Bag of n-gram approach and selects important features using the meta-heuristic algorithm, binary particle swarm optimization (BPSO). Random Forest (RF) classifier is used to classify the monitored programs into benign and malign processes, making it capable of detecting the variants of malware thus, an advantage over typical signature-matching approach. The University of New Mexico (UNM) Dataset and Bare cloud Dataset (University of California) have been used for the demonstration and validation of VMShield. The results prove that VMShield achieves higher attack detection rate and reduced storage compared to previously proposed techniques.
Preeti Mishra; Palak Aggarwal; Ankit Vidyarthi; Pawan Singh; Baseem Khan; Hassan Haes Alhelou; Pierluigi Siano. VMShield: Memory Introspection-based Malware Detection to Secure Cloud-based Services against Stealthy Attacks. IEEE Transactions on Industrial Informatics 2021, PP, 1 -1.
AMA StylePreeti Mishra, Palak Aggarwal, Ankit Vidyarthi, Pawan Singh, Baseem Khan, Hassan Haes Alhelou, Pierluigi Siano. VMShield: Memory Introspection-based Malware Detection to Secure Cloud-based Services against Stealthy Attacks. IEEE Transactions on Industrial Informatics. 2021; PP (99):1-1.
Chicago/Turabian StylePreeti Mishra; Palak Aggarwal; Ankit Vidyarthi; Pawan Singh; Baseem Khan; Hassan Haes Alhelou; Pierluigi Siano. 2021. "VMShield: Memory Introspection-based Malware Detection to Secure Cloud-based Services against Stealthy Attacks." IEEE Transactions on Industrial Informatics PP, no. 99: 1-1.
An efficient scheduling reduces the time required to process the jobs, and energy management decreases the service cost as well as increases the lifetime of a battery. A balanced trade-off between the energy consumed and processing time gives an ideal objective for scheduling jobs in data centers and battery based devices. An online multiprocessor scheduling multiprocessor with bounded speed (MBS) is proposed in this paper. The objective of MBS is to minimize the importance-based flow time plus energy (IbFt+E), wherein the jobs arrive over time and the job’s sizes are known only at completion time. Every processor can execute at a different speed, to reduce the energy consumption. MBS is using the tradition power function and bounded speed model. The functioning of MBS is evaluated by utilizing potential function analysis against an offline adversary. For processors m ≥ 2, MBS is O(1)-competitive. The working of a set of jobs is simulated to compare MBS with the best known non-clairvoyant scheduling. The comparative analysis shows that the MBS outperforms other algorithms. The competitiveness of MBS is the least to date.
Pawan Singh; Baseem Khan; Om Prakash Mahela; Hassan Haes Alhelou; Ghassan Hayek. Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling. Applied Sciences 2020, 10, 2459 .
AMA StylePawan Singh, Baseem Khan, Om Prakash Mahela, Hassan Haes Alhelou, Ghassan Hayek. Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling. Applied Sciences. 2020; 10 (7):2459.
Chicago/Turabian StylePawan Singh; Baseem Khan; Om Prakash Mahela; Hassan Haes Alhelou; Ghassan Hayek. 2020. "Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling." Applied Sciences 10, no. 7: 2459.
Efficient job scheduling reduces energy consumption and enhances the performance of machines in data centers and battery-based computing devices. Practically important online non-clairvoyant job scheduling is studied less extensively than other algorithms. In this paper, an online non-clairvoyant scheduling algorithm Highest Scaled Importance First (HSIF) is proposed, where HSIF selects an active job with the highest scaled importance. The objective considered is to minimize the scaled importance based flow time plus energy. The processor’s speed is proportional to the total scaled importance of all active jobs. The performance of HSIF is evaluated by using the potential analysis against an optimal offline adversary and simulating the execution of a set of jobs by using traditional power function. HSIF is 2-competitive under the arbitrary power function and dynamic speed scaling. The competitive ratio obtained by HSIF is the least to date among non-clairvoyant scheduling. The simulation analysis reflects that the performance of HSIF is best among the online non-clairvoyant job scheduling algorithms.
Pawan Singh; Baseem Khan; Ankit Vidyarthi; Hassan Haes Alhelou; Pierluigi Siano. Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function. Applied Sciences 2019, 9, 1467 .
AMA StylePawan Singh, Baseem Khan, Ankit Vidyarthi, Hassan Haes Alhelou, Pierluigi Siano. Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function. Applied Sciences. 2019; 9 (7):1467.
Chicago/Turabian StylePawan Singh; Baseem Khan; Ankit Vidyarthi; Hassan Haes Alhelou; Pierluigi Siano. 2019. "Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function." Applied Sciences 9, no. 7: 1467.
With the increasing consumption of energy in data centers, the demand for energy efficient multiprocessor job scheduling is growing dramatically. Besides flow time, energy conservation has become a significant issue and drawn enormous interest. In this paper, an online non-clairvoyant scheduling algorithm Significance-based Multiprocessor Round Robin (SbMRR) is proposed. SbMRR utilizes the unbounded speed model, where the range of the speed of any processor is from zero to infinity. To validate the effectiveness of the algorithm, mathematical and simulation-based analysis are conducted which demonstrates that SbMRR provides the minimum sum of significance-based flow time and energy consumed. SbMRR is O(α)-competitive, more precisely ((α + 1)⁄((1–1⁄αβ)))-competitive, where β ≥ 4 a constant. The competitive ratio of SbMRR is least to date. SbMRR provides the minimum sum of energy consumed and significance-based flow-time.
Pawan Singh. Energy efficient non-clairvoyant scheduling for unbounded-speed multi-core machines. Computers & Electrical Engineering 2018, 67, 441 -453.
AMA StylePawan Singh. Energy efficient non-clairvoyant scheduling for unbounded-speed multi-core machines. Computers & Electrical Engineering. 2018; 67 ():441-453.
Chicago/Turabian StylePawan Singh. 2018. "Energy efficient non-clairvoyant scheduling for unbounded-speed multi-core machines." Computers & Electrical Engineering 67, no. : 441-453.
Smart city deals with the problems of rapid urbanization and population growth by optimal utilization of all available resources. There are other driving factors such as clean energy programmes, a low carbon economy and distributed energy resources that are included in a smart city concept. Therefore, in this article, the authors proposed a clean energy generating model by utilizing the kinetic energy of vehicles over a speed breaker. The article focused on the design, modelling, and simulation of an electromechanical system for generating electrical power from the kinetic energy of vehicles passing over speed breakers. To facilitate simulation, a model of the electromechanical system is developed in MATLAB/Simulink. Further, MULTISIM 14 software is utilized for power electronic device modelling and simulation. Simulation results for power generation are obtained considering four units of rotational induction generators and two units of translational induction generators.
Mesfin Fanuel Kebede; Baseem Khan; N Singh; Pawan Singh. Energy Production in Smart Cities by Utilization of Kinetic Energy of Vehicles Over Speed Breaker. International Journal of Civic Engagement and Social Change 2018, 5, 1 -35.
AMA StyleMesfin Fanuel Kebede, Baseem Khan, N Singh, Pawan Singh. Energy Production in Smart Cities by Utilization of Kinetic Energy of Vehicles Over Speed Breaker. International Journal of Civic Engagement and Social Change. 2018; 5 (2):1-35.
Chicago/Turabian StyleMesfin Fanuel Kebede; Baseem Khan; N Singh; Pawan Singh. 2018. "Energy Production in Smart Cities by Utilization of Kinetic Energy of Vehicles Over Speed Breaker." International Journal of Civic Engagement and Social Change 5, no. 2: 1-35.
Yishak Kifle; Baseem Khan; Pawan Singh. Assessment and Enhancementof Distribution System Reliabilityby Renewable Energy Sourcesand Energy Storage. Journal of Green Engineering 2018, 8, 219 -262.
AMA StyleYishak Kifle, Baseem Khan, Pawan Singh. Assessment and Enhancementof Distribution System Reliabilityby Renewable Energy Sourcesand Energy Storage. Journal of Green Engineering. 2018; 8 (3):219-262.
Chicago/Turabian StyleYishak Kifle; Baseem Khan; Pawan Singh. 2018. "Assessment and Enhancementof Distribution System Reliabilityby Renewable Energy Sourcesand Energy Storage." Journal of Green Engineering 8, no. 3: 219-262.
A huge consumption of energy in the data centres has become a motivation for improvement in computing capability and energy conservation. The dynamic speed scaling and job scheduling are efficient methods to improve the energy efficiency of processors. In this study, an online non-clairvoyant scheduling algorithm arrival time-algorithm (At-ALG) is proposed with an objective to scale the speed of processors and schedule the jobs in a multiprocessor system to minimise the total magnitude-based/weighted flow time plus energy consumed. The traditional power function is adopted, where is a constant. At-ALG is analysed, against an offline adversary, using the potential function analysis. The magnitude/weight/priority of jobs in At-ALG are generated using their processed time (waiting time plus executed time) and speed of any processor depends on the number of active jobs plus sum of processed time of active jobs. At-ALG is -competitive with no resource augmentation.
Pawan Singh. Power‐aware speed scaling in multiprocessor systems. IET Science, Measurement & Technology 2018, 12, 25 -32.
AMA StylePawan Singh. Power‐aware speed scaling in multiprocessor systems. IET Science, Measurement & Technology. 2018; 12 (1):25-32.
Chicago/Turabian StylePawan Singh. 2018. "Power‐aware speed scaling in multiprocessor systems." IET Science, Measurement & Technology 12, no. 1: 25-32.
The exhaustive knowledge of optimal power flow (OPF) methods is critical for proper system operation and planning, since OPF methods are utilized for finding the optimal state of any system under system constraint conditions, such as loss minimization, reactive power limits, thermal limits of transmission lines, and reactive power optimization. Incorporating renewable energy sources optimized the power flow of system under different constraints. This work presents a comprehensive study of optimal power flows methods with conventional and renewable energy constraints. Additionally, this work presents a progress of optimal power flow solution from its beginning to its present form. Authors classify the optimal power flow methods under different constraints condition of conventional and renewable energy sources. The current and future applications of optimal power flow programs in smart system planning, operations, sensitivity calculation, and control are presented. This study will help the engineers and researchers to optimize power flow with conventional and renewable energy sources.
Baseem Khan; Pawan Singh. Optimal Power Flow Techniques under Characterization of Conventional and Renewable Energy Sources: A Comprehensive Analysis. Journal of Engineering 2017, 2017, 1 -16.
AMA StyleBaseem Khan, Pawan Singh. Optimal Power Flow Techniques under Characterization of Conventional and Renewable Energy Sources: A Comprehensive Analysis. Journal of Engineering. 2017; 2017 ():1-16.
Chicago/Turabian StyleBaseem Khan; Pawan Singh. 2017. "Optimal Power Flow Techniques under Characterization of Conventional and Renewable Energy Sources: A Comprehensive Analysis." Journal of Engineering 2017, no. : 1-16.
Sub-Saharan nations are facing a lot of challenges for the planning of their future energy sector. Particularly, the rural areas of Sub-Saharan nations bear scarcity of energy access as there is a lack of grid facilities, less financial and technical support, pressure from foreign institutions, excess of energy export etc. Although Ethiopia is growing as a leader of energy sector in Sub-Saharan region, it is also facing numerous problems similar to other African nations. In this paper, authors have conducted a detailed study of Ethiopian power sector. This study includes the complete background and overview of current energy sector in Ethiopia. The key factors which affect the development of energy sector such as international energy export, policy framework, role of government and regulatory framework are also discussed. It is observed that there is a huge renewable energy potential in Ethiopia which is under utilized, and can be used as a major resource for rural energy access. The authors recommend that a new policy framework and subsidies for renewable energy generation, motivational awareness, technical training, improvement in organizational efficiency and managerial skills, arrangement of financial instruments for new projects and easy ICTs based mobile banking programme should be initiated as well as improved to achieve sustainable growth, and 100% energy access by increasing renewable energy production.
Baseem Khan; Pawan Singh. The Current and Future States of Ethiopia’s Energy Sector and Potential for Green Energy: A Comprehensive Study. International Journal of Engineering Research in Africa 2017, 33, 115 -139.
AMA StyleBaseem Khan, Pawan Singh. The Current and Future States of Ethiopia’s Energy Sector and Potential for Green Energy: A Comprehensive Study. International Journal of Engineering Research in Africa. 2017; 33 ():115-139.
Chicago/Turabian StyleBaseem Khan; Pawan Singh. 2017. "The Current and Future States of Ethiopia’s Energy Sector and Potential for Green Energy: A Comprehensive Study." International Journal of Engineering Research in Africa 33, no. : 115-139.
At present, renewable energy sources (RESs) integration using microgrid (MG) technology is of great importance for demand side management. Optimization of MG provides enhanced generation from RES at minimum operation cost. The microgrid optimization problem involves a large number of variables and constraints; therefore, it is complex in nature and various existing algorithms are unable to handle them efficiently. This paper proposed an artificial shark optimization (ASO) method to remove the limitation of existing algorithms for solving the economical operation problem of MG. The ASO algorithm is motivated by the sound sensing capability of sharks, which they use for hunting. Further, the intermittent nature of renewable energy sources is managed by utilizing battery energy storage (BES). BES has several benefits. However, all these benefits are limited to a certain fixed area due to the stationary nature of the BES system. The latest technologies, such as electric vehicle technologies (EVTs), provide all benefits of BES along with mobility to support the variable system demands. Therefore, in this work, EVTs incorporated grid connected smart microgrid (SMG) system is introduced. Additionally, a comparative study is provided, which shows that the ASO performs relatively better than the existing techniques.
Pawan Singh; Baseem Khan. Smart Microgrid Energy Management Using a Novel Artificial Shark Optimization. Complexity 2017, 2017, 1 -22.
AMA StylePawan Singh, Baseem Khan. Smart Microgrid Energy Management Using a Novel Artificial Shark Optimization. Complexity. 2017; 2017 ():1-22.
Chicago/Turabian StylePawan Singh; Baseem Khan. 2017. "Smart Microgrid Energy Management Using a Novel Artificial Shark Optimization." Complexity 2017, no. : 1-22.
In current epoch, the economic operation of micro-grid under soaring renewable energy integration has become a major concern in the smart grid environment. There are several meta-heuristic optimization techniques available under different categories in literature. One of the most difficult tasks in cost minimization of micro-grid is to select the best suitable optimization technique. To resolve the problem of selecting a suitable optimization technique, a rigorous review of six meta-heuristic algorithms (Whale Optimization, Fire Fly, Particle Swarm Optimization, Differential Evaluation, Genetic Algorithm, and Teaching Learning-based Optimization) selected from three categories (Swarm Intelligence, Evolutionary Algorithms, and Teaching Learning) is conducted. It presents, a comparative analysis using different performance indicators for standard benchmark functions and proposed a smart micro-grid (SMG) operation cost minimization problem. A proposed SMG is modeled which incorporates utility connected power resources, e.g., wind turbine, photovoltaic, fuel cell, micro-turbine, battery storage, electric vehicle technology, and diesel power generator. The proposed work will help researchers and engineers to select an appropriate optimization method to solve micro-grid optimization problems with constraints. This paper concludes with a detailed review of micro-grid operation cost minimization techniques based on an exhaustive survey and implementation.
Baseem Khan; Pawan Singh. Selecting a Meta-Heuristic Technique for Smart Micro-Grid Optimization Problem: A Comprehensive Analysis. IEEE Access 2017, 5, 13951 -13977.
AMA StyleBaseem Khan, Pawan Singh. Selecting a Meta-Heuristic Technique for Smart Micro-Grid Optimization Problem: A Comprehensive Analysis. IEEE Access. 2017; 5 ():13951-13977.
Chicago/Turabian StyleBaseem Khan; Pawan Singh. 2017. "Selecting a Meta-Heuristic Technique for Smart Micro-Grid Optimization Problem: A Comprehensive Analysis." IEEE Access 5, no. : 13951-13977.
Energy conservation has become a prime objective due to excess use and huge demand of energy in data centers. One solution is to use efficient job scheduling algorithms. The scheduler has to maintain the machine’s state balance to obtain efficient job scheduling and avoid unnecessary energy consumption. Although the practical importance of non-clairvoyant scheduling problem is higher than clairvoyant scheduling, in the past few years the non-clairvoyant scheduling problem has been studied lesser than clairvoyant scheduling. In this paper, an online non-clairvoyant scheduling problem is studied to minimize total weighted flow time plus energy and a scheduling algorithm Executed-time Round Robin (EtRR) is proposed. Generally, weights of jobs are system generated and they are assigned to jobs at release/arrival time. In EtRR, the weights are not generated by the system, rather by the scheduler using the executed time of jobs. EtRR is a coupling of weighted generalization of Power Management and Weighted Round Robin (WRR). We adopt the conventional power function P = sα, where s and α > 1 are speed of a processor and a constant, respectively. EtRR is O(1)-competitive, it is using a processor with the maximum speed (1 + τ/3)T, where the maximum speed of optimal offline adversary is T and 0<τ⩽(3α)-10<τ⩽(3α)-1.
Pawan Singh; Berhane Wolde-Gabriel. Executed-time Round Robin: EtRR an online non-clairvoyant scheduling on speed bounded processor with energy management. Journal of King Saud University - Computer and Information Sciences 2017, 29, 74 -84.
AMA StylePawan Singh, Berhane Wolde-Gabriel. Executed-time Round Robin: EtRR an online non-clairvoyant scheduling on speed bounded processor with energy management. Journal of King Saud University - Computer and Information Sciences. 2017; 29 (1):74-84.
Chicago/Turabian StylePawan Singh; Berhane Wolde-Gabriel. 2017. "Executed-time Round Robin: EtRR an online non-clairvoyant scheduling on speed bounded processor with energy management." Journal of King Saud University - Computer and Information Sciences 29, no. 1: 74-84.
In the current epoch, the energy consumption is a great concern in the online non-clairvoyant job scheduling. The online non-clairvoyant scheduling is studied less extensively than the online clairvoyant scheduling. The authors study non-clairvoyant scheduling problem of minimising the total prioritised flow time plus energy, where the jobs with arbitrary sizes and priorities arrive online. The authors consider unbounded speed model in multiprocessor settings, where the speed of m individual processors can vary from zero to infinity, i.e. [0, ∞), to save the energy and to optimise the prioritised flow time plus energy. The authors consider the traditional power function , where s is the speed of a processor and α > 1, a constant. In this study, the authors introduce an online non-clairvoyant scheduling multiprocessor priority round robin (MPRR), which is -competitive; more precisely -competitive, i.e. the competitive ratio is 5.33 for α = 2 and 7.3 for α = 3. In this study, the algorithm is studied using the potential analysis against an optimal offline adversary.
Pawan Singh; Nirayo Hailu. Energy‐aware online non‐clairvoyant multiprocessor scheduling: multiprocessor priority round robin. IET Computers & Digital Techniques 2016, 11, 16 -23.
AMA StylePawan Singh, Nirayo Hailu. Energy‐aware online non‐clairvoyant multiprocessor scheduling: multiprocessor priority round robin. IET Computers & Digital Techniques. 2016; 11 (1):16-23.
Chicago/Turabian StylePawan Singh; Nirayo Hailu. 2016. "Energy‐aware online non‐clairvoyant multiprocessor scheduling: multiprocessor priority round robin." IET Computers & Digital Techniques 11, no. 1: 16-23.
This paper proposes a novel chronically evaluated highest instantaneous priority next processor scheduling algorithm. The currently existing algorithms like first come first serve, shortest job first, round-robin, shortest remaining time first, highest response ratio next and varying response ratio priority algorithm have some problems associated with them. Some of them can lead to endless waiting or starvation and some of them like round-robin has problem of too many context switches and high waiting time associated with them. In the proposed algorithm, we have taken care of all such problems. As the novel algorithm is capable of achieving as good results as shortest remaining time first algorithm and also it will never lead to starvation.
Amit Pandey; Pawan Singh; Nirayo H. Gebreegziabher; Abdella Kemal. Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling. Journal of Computer and Communications 2016, 04, 146 -159.
AMA StyleAmit Pandey, Pawan Singh, Nirayo H. Gebreegziabher, Abdella Kemal. Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling. Journal of Computer and Communications. 2016; 04 (04):146-159.
Chicago/Turabian StyleAmit Pandey; Pawan Singh; Nirayo H. Gebreegziabher; Abdella Kemal. 2016. "Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling." Journal of Computer and Communications 04, no. 04: 146-159.
In the past few years the online scheduling problem has been studied extensively under clairvoyant settings and a relatively less amount of evolution is observed under non-clairvoyant setting. A non-clairvoyant scheduling problem has its practical significance. We study online non-clairvoyant scheduling problem of minimizing total weighted flow plus energy. Usually weights in weighted flow study are assumed to be system generated and they are allocated to the jobs at their release time. In this paper, weights are not provided by the system, rather they are generated using the release time by the scheduler. The scheduler maintains a balance of the machine's state to obtain an efficient schedule of jobs and avoid energy wastage. This paper provides potential analysis of a weighted generalization of the power management algorithm which is coupled with Weighted Round Robin. We adopt the traditional model of power function P = sα, where s, P and α > 1 are speed of processor, power and a constant, respectively. We introduced Release Round Robin (R3) scheduling algorithm with competitive ratio O (3α/τ) when using a processor with the maximum speed (3 + τ) times higher than the maximum speed of the Optimal offline adversary, where 0 < τ ≤ (3α−1).
Pawan Singh; Prashast. Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors. Karbala International Journal of Modern Science 2015, 1, 225 -236.
AMA StylePawan Singh, Prashast. Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors. Karbala International Journal of Modern Science. 2015; 1 (4):225-236.
Chicago/Turabian StylePawan Singh; Prashast. 2015. "Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors." Karbala International Journal of Modern Science 1, no. 4: 225-236.
An automated testing tool helps the testers to quantify the quality of software by testing the software automatically. To quantify the quality of software there is always a requirement of good testing tools, which satisfy the testing requirement of the project. Although there is a wide range of testing tools available in the market and they vary in approach, quality, usability and other characteristics. Selecting the appropriate testing tool for software there is a requirement of a methodology to prioritize them on the basis of some characteristics. We propose a set of metrics for measuring the characteristics of the automated testing tools for examination and selection of automated testing tools. A new extended model which is proposed provides the metrics to calculate the effectiveness of functional testing tools on the basis of operability. The industry will be benefited as they can use these metrics to evaluate functional tools and they can further make selection of tool for their software required to be tested and hence reduce the testing effort, saving time and gaining maximum monetary benefit.
Pawan Singh. Metrics for Quantification of the Software Testing Tools Effectiveness. American Journal of Software Engineering and Applications 2015, 4, 15 .
AMA StylePawan Singh. Metrics for Quantification of the Software Testing Tools Effectiveness. American Journal of Software Engineering and Applications. 2015; 4 (1):15.
Chicago/Turabian StylePawan Singh. 2015. "Metrics for Quantification of the Software Testing Tools Effectiveness." American Journal of Software Engineering and Applications 4, no. 1: 15.
In present era, one of the most important resources of computer machine is CPU. With the increasing number of application, there exist a large number of processes in the computer system at the same time. Many processes in system simultaneously raise a challenging circumstance of managing the CPU in such a manner that the CPU utilization and processes execution gets optimal performance. The world is still waiting for most efficient algorithm which remains a challenging issue. In this manuscript, we have proposed a new algorithm Progressively Varying Response Ratio Priority a preemptive CPU scheduling algorithm based on the Priority Algorithm and Shortest Remaining Time First. In this scheduling algorithm, the priority is been calculated and the processes with high priority get CPU first or next. For new process, the priority of it becomes equal to inverse of burst time and for the old processes the priority calculation takes place as a ratio of waiting time and remaining burst time. The objective is to get all the processes executed with minimum average waiting time and no starvation. Experiment and comparison show that the VRRP outperforms other CPU scheduling algorithms. It gives better evaluation results in the form of scheduling criteria. We have used the deterministic model to compare the different algorithms.
Pawan Singh; Amit Pandey; Andargachew Mekonnen. Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP). Journal of Computer and Communications 2015, 03, 40 -51.
AMA StylePawan Singh, Amit Pandey, Andargachew Mekonnen. Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP). Journal of Computer and Communications. 2015; 03 (04):40-51.
Chicago/Turabian StylePawan Singh; Amit Pandey; Andargachew Mekonnen. 2015. "Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP)." Journal of Computer and Communications 03, no. 04: 40-51.