Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

13 articles for “CPU scheduling”
Set a search alert
Research ArticleOpen accessPhrase in the titlePerformance Assessment of CPU Scheduling Algorithms: A Scenario-Based Approach with FCFS, RR, and SJFOlaa Hajjar, Escelle Mekhallalati, Nada Annwty et al.This study presents an extensive examination of CPU scheduling algorithms, focusing on the First-Come, First-Served (FCFS), Round-Robin (RR), and Shortest-Job-First (SJF) strategies through a carefully designed scenario-based approach. By deploying a Java-based simulation to dynamically generate random process arrival and burst times, this study simulates a variety of operational conditions to test these scheduling algorithms’ adaptability and performance in environments … …Journal of Computer Science, Vol. 20, Issue 9 · 16 Jun 2024 · 9,091 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleFUZZY ROUND ROBIN CPU SCHEDULING ALGORITHMBashir AlamOne problem in Round Robin CPU Scheduling is that if the time required for the running process is slightly more than time quantum even by a fraction value, then process gets preempted and context switch occurs. This causes more waiting time for that process and more overheads due to unnecessary context switch. Another problem with RR scheduling is the value … …Journal of Computer Science, Vol. 9, Issue 8 · 9 Jul 2013 · 7,909 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Genetic Algorithm for Scheduling n Jobs on a Single Machine with a Stochastic Controllable Processing, Tooling Cost and Earliness-Tardiness PenaltiesMohamed Ali Abdel-Fattah MansourProblem statement: In this research, we addressed the problem of minimizing the earliness-tardiness penalties and manufacturing costs of a single machine with a stochastic controllable processing and tooling cost. Approach: We developed a mathematical non-linear integer programming model and its linearised version to find the optimal solution. We introduced a new genome representation in single machine scheduling literature that evolved … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 3 · 18 Aug 2011 · 7,587 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSelf-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running ProcessesRami J. MatarnehProblem statement: The performance and efficiency of multitasking operating systems mainly depends on the used CPU scheduling algorithm where the CPU is one of the primary computer resources and as round robin scheduling algorithm is considered most widely used scheduling algorithms in this research a new proposed variant of this algorithm presented, discussed in detail, tested and verified. Approach: The … …American Journal of Applied Sciences, Vol. 6, Issue 10 · 31 Oct 2009 · 8,934 accessesView PDFCite
Research ArticleOpen accessIn the abstractMasterpiece Optimization Algorithm-Based Priority-Aware Load Balancing Strategy for Cloud Data CentersS Vijaykumar, Shanker ChandreCloud Computing (CC) is one of the widely used technologies due to its advanced features such as pay-per-use, scalability, and flexibility. The primary objective of CC is to allow users to access and purchase cloud services that are on demand through internet-based applications. Efficient load-balancing in the cloud faces challenges of high-dimensional state spaces and scalability with increasing tasks. To … …Journal of Computer Science, Vol. 22, Issue 7 · 30 Jul 2026 · 777 accessesView PDFCite
Research ArticleOpen accessIn the abstractFeasibility Analysis of Non-Preemptive Periodic Systems from Infeasibility PerspectiveNasro Min-AllahDue to simple implementation, non-preemptive scheduling has the advantage over preemptive counterpart when it comes to deployment of real-time systems. Accordingly, many feasibility techniques have been established to answer schedulability of the task set for non-preemptive case. The time complexity of exact condition for non-preemptive under dynamic priority assignment is of pseud-polynomial nature. Recently, efforts are made to decrease the … …Journal of Computer Science, Vol. 15, Issue 9 · 9 Sep 2019 · 7,617 accessesView PDFCite
Research ArticleOpen accessIn the abstractRESOURCE BROKER MANAGEMENT BY ADOPTING SELF-ADAPTIVE MULTI-INSTANCE BROKER SCHEDULING IN GRID COMPUTINGBakri Yahaya, Rohaya Latip, Azizol Abdullah, Mohamed OthmanA grid resource broker seeks to assign the appropriate jobs to the appropriate resources as part of resource management in the multi-grid environment. Multi instances of the broker system provides multiple instances of brokers to simultaneously process jobs between multiple resources in a hierarchical cluster grid environment. In this study, the multi-instance broker is developed using grid resource broker taxonomy … …Journal of Computer Science, Vol. 10, Issue 12 · 29 Dec 2014 · 8,873 accessesView PDFCite
Research ArticleOpen accessIn the abstractQUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULINGKrishnamoorthy Natarajan, Asokan Ramasamy, Sangeetha SubramanianThis study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time (throughput) and the resources use cost. The … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,554 accessesView PDFCite
Research ArticleOpen accessIn the abstractDynamic Allocation of CPUs in Multicore Processor for Performance Improvement in Network Security ApplicationsSudhakar Gummadi, Radhakrishnan ShanmugasundaramProblem statement: Multicore and multithreaded CPUs have become the new approach for increase in the performance of the processor based systems. Numerous applications benefit from use of multiple cores. Increasing performance of the system by increasing the number of CPUs of the multicore processor for a given application warrants detailed experimentation. In this study, the results of the experimentation done … …Journal of Computer Science, Vol. 7, Issue 6 · 14 Jun 2011 · 6,844 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark CircuitsP. Sakthivel, R. Delhi Babu, P. NarayanasamyProblem statement: This study presented the optimized test scheduling and test access for ITC-02 SOC benchmark circuits using genetic algorithm. In the scheduling procedure of SOC, scheduling problem was formulated as a sequence of two problems and solved. Approach: Test access mechanism width was partitioned into two and three partitions and the applications of test vectors and test vector assignments … …Journal of Computer Science, Vol. 5, Issue 4 · 30 Apr 2009 · 7,315 accessesView PDFCite