Priority and dynamic quantum time algorithms for central processing unit scheduling
Central Processing Unit scheduling is a key concept in computer multitasking, multiprocessing operating system and real‐ time operating system designs. Scheduling refers to the way processes are assigned to run on the Central Processing Unit. Central Processing Unit is scheduled using different type...
Saved in:
Main Author: | Mohammed, Maysoon A. |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/23477/1/Priority%20and%20dynamic%20quantum%20time%20algorithms%20for%20central%20processing%20unit%20scheduling.pdf http://umpir.ump.edu.my/id/eprint/23477/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
by: Mohammed, Maysoon A., et al.
Published: (2015) -
A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
by: Mohammed, Maysoon A., et al.
Published: (2016) -
Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
by: Mohammed, Maysoon A., et al.
Published: (2016) -
Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms
by: Maysoon, A. Mohammed, et al.
Published: (2015) -
CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
by: Mohammed, Maysoon A., et al.
Published: (2016)