Algoritmo de Planificación Round RobinDescripción completa
genetic algorithm is used to schedule university time table
Schedulling tutorial for minexFull description
This paper presents a Fuzzy Logic based approach to manage VM status and VM configuration within the cloud environment. The aim of the approach is to serve task requests efficiently with minimal use of resource and power. The proposed technique uses
aaa
okFull description
erwerFull description
Full description
Round MidnightFull description
MELJUN CORTES ALGORITHM Analysis of Algorithm Efficiency
COAFull description
sdsdsdsdDeskripsi lengkap
Research and development on ID3 algorithm rules based anti spam email filteringFull description
COA
Algorithm Design
Robin HoodDeskripsi lengkap
Deskripsi lengkap
Robin Hood case study
Jim Heffernan Assignment Assignment 4 Problem of the Week # 2
03/02/98 10:24:10 AM
Algorithm (pseudocode): (Round Robin (RR) Scheduling) let (time) quantum be 2 (sec.) ---time slice if countQueue(CPUQ countQueue(CPUQUEUE) UEUE) equals 1 THEN --- is a process proc ess (tran (t ran)) running runn ing ? if headqueue[CPUQUEUE headqueue[CPUQUEUE]] PCB_run equals 0 THEN --- process proc ess has completed compl eted take process off CPU if countQueue(READYQUEUE) greater than 0 THEN issue_process onto CPU decrement time quantum counter el se --- process has not completed completed if headqueue[CPUQUEUE] time quantum equals 0 THEN --- time's time 's up! if countQueue(READYQUEUE) greater than 0 THEN remove process from CPUQ and insert into READYQUEUE reset time quantum counter issue next available process onto CPUQ decrement time quantum counter els e ----no ----no processes (trans) in ready ready queue queue reset time quantum counter run for a tick decrement time quantum counter else el se ---quantu ---quantum m has not expired expir ed run for a tick decrement time quantum counter els e ---CPU ---CPU is idle if (countQueue(READYQUEUE) greater than 0 THEN issue process onto CPU decrement time quantum counter end_if end_if end_if end_if end_if end Assumptions: -----------------1. Round Robin (RR) Scheduling Algorithm. 2. Time Slice (or time quantum) is set at 2 seconds for each user process before the next user process get control of the CPU. 3. Preemption (when process switches state) is added between processes. If a user process exceeds the time-slice it is preempted and put back on the Ready Queue. 4. Time-slic Time-slicee setting may affect performance: performanc e: If tim time-slice e-slice too large - degenerates to FCFS (first-co (first-come-first-serve) me-first-serve) and can result in the convoy effect where one process keeps the CPU until it releases; less context switching. If time-slice time-slice too small - more context context switching switching for/to new pr ocesses. oces ses.
The given’s: 1.
2.
It’s a FIFO Round Robin (RR) Scheduling Algorithm with a 2 second time quantum for each user process before the next user process get control of the CPU. It’s It’s preemp preemptiv tivee - if a user process exceeds exceeds the time-slice it is preempted and put back on the Ready Queue.
The Algorithm again (in my English): I come in with the list processes and loop through the scheduler function: I check to see is a process proces s is already running ru nning (if the th e CPUQ = 1)? If not, I assume the CPU CPU is idle and issue a process on the CPUQ and decrement the time quantum counter. Next, I check to see if a process has completed? If so, I take the process off the CPUQ and issue a new process and decrement the time quantum counter. Else If the process has NOT completed, I check to see if it’s time is up? If it is and the READYQ is greater than zero, I (1) remove the process from the CPUQ CPUQ and insert itback on the READYQ, READYQ, (2) reset the time quantum counter, (3) issue the next available process onto the CPUQ and (4) decrement the time quantum counter. Else If the process has NOT completed and there are no processes on the READYQ, I (1) reset the time quantum, (2) run for a tick and (3) decrement decrement the time quantum counter. Else Finally, if the time quantum has NOT NOT expired, I (1) run for a tick and (2) decrement the time quantum counter. I return back and execute until there are no more processes.
