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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
by: Saydul Akbar, Murad
Published: (2023) -
Optimization grid scheduling with priority base and bees algorithm
by: Ahmed, Mohammed Shihab
Published: (2014) -
Multi-round divisible real-time scheduling algorithm on multiprocessor platforms
by: Razmara, Pegah
Published: (2015) -
Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
by: Mohammed Hasan, Ammar Abdo
Published: (2006) -
Optimizing accuracy in deriving priorities in analytic hierarchy process using evolutionary computing
by: Zakaria , Nur Farha
Published: (2010)