Abstract | ||
---|---|---|
Schedulers are always important for good system performance in Operating systems. In Operating system concepts, the better and flexible a scheduler, the more likely the system attain optimization through maximum Central Processing Unit (CPU) utilization, maximum throughput, minimum turn-around time, minimum waiting time and less Context switch. Scheduling practice has also seemed to be of essence to the Internet. Packets are schedule to cross hops systematically to enhance quality of service (QoS) and minimize excessive bandwidth utilization. This report presents some scheduling algorithms and suggests an extension of the Longest Job First (LJF) algorithm to enhance system performance in multiprogramming domain and Internet. Cache improvement is shown by tapping the advantages of the LJF in Information Centric Networking. This was achieved by introducing a new technique called Combinational Burst Time (CBT) and Combined Weighted Average (Cwa). Monte Carlo simulation using discrete Poisson for the process burst time generation was demonstrated to achieve some of the optimization criteria in CPU Scheduling. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-030-33582-3_56 | EMERGING TRENDS IN INTELLIGENT COMPUTING AND INFORMATICS: DATA SCIENCE, INTELLIGENT INFORMATION SYSTEMS AND SMART COMPUTING |
Keywords | DocType | Volume |
CPU scheduling, Optimization, Combinational Burst Time CBT, Longest Job First, Caching, Operating system, Information-Centric Networking | Conference | 1073 |
ISSN | Citations | PageRank |
2194-5357 | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ibrahim Abdullahi | 1 | 0 | 0.34 |
A. Suki M. Arif | 2 | 0 | 0.34 |
Yousef Fazea | 3 | 0 | 2.03 |