• Publications
  • Influence
A Comparative Analysis of Quantum Time based on Arithmetic, Geometric, and Harmonic Mean for Dynamic Round Robin Scheduling
TLDR
We compare and analyze different means of computing for the quantum time in each cycle of the dynamic RRS based on Arithmetic Mean, Geometric Mean and Harmonic Mean. Expand
Integrating User-Defined Priority Tasks in a Shortest Job First Round Robin (SJFRR) Scheduling Algorithm
TLDR
The Shortest Job First (SJF) algorithm reduces the average waiting time of processes in a CPU environment; however, it may lead to the starvation of long processes. Expand
Refining the Round Robin Algorithm using a Recomputed Time Quantum: a comparison
TLDR
In this paper, the proponents have come up and designed a new formula derived from common formulas used in different researches using different computations of the time quantum for the Refined Round Robin scheduling algorithm. Expand
End to End Dynamic Round Robin (E-EDRR) Scheduling Algorithm Utilizing Shortest Job First Analysis
TLDR
The End to End Dynamic Round Robin (E-EDRR) Scheduling Algorithm Utilizing Shortest Job First Analysis functions as a method of queuing and allocating time to tasks that the CPU will process. Expand
Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm
TLDR
Scheduling refers to a set of policies and mechanisms to control the order of work to be performed by a Computer system. Expand
Artificial Neural Network (ANN) in a Small Dataset to determine Neutrality in the Pronunciation of English as a Foreign Language in Filipino Call Center Agents
TLDR
This paper contributes to the knowledge space by proposing a model that can accurately classify whether call center agents' utterances are pronounced neutral or not based on their employer’s standards. Expand
An Experimental Study on the Shortest Fittest Job First (SFJF) Scheduling Algorithm using Dynamic Queues
TLDR
The Shortest Fittest Job First (SFJF) is a propositional algorithm that implements the usage of a dynamic queue wherein the shortest and more suitable process is prioritized. Expand