-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge remote-tracking branch 'origin/master'
- Loading branch information
Showing
1 changed file
with
17 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
Algoritmos de planificacion de procesos: FCFS, HRN, SJF, RR, SRTF, priority, FMQ. | ||
|
||
NOTA: Este repositorio fue hecho para el proyecto final de la materia de Infraestructura Computacional de la universidad del Quindio, | ||
|
||
Autores son: Juan Esteban Quintero Rodriguez - David Santiago Martinez Lopez - Ismenia Marcela Guevara Ortiz | ||
|
||
Documento: https://www.overleaf.com/read/nqtwpsgvwjsc | ||
|
||
Este trabajo se pudo realizar gracias a: | ||
|
||
Diaz, J. (s/f). https://gist.github.com/FuriosoJack/d8d1d0466c101d22532e2f2f8c4e2119 | ||
|
||
Highest response ratio next (HRRN) CPU scheduling.(2017, octubre 5). GeeksforGeeks. | ||
https://www.geeksforgeeks.org/highest-response-ratio-next-hrrn-cpu-scheduling/?ref=gcse | ||
|
||
Shortest remaining time first (preemptive SJF) scheduling algorithm. (2017, julio 8). | ||
GeeksforGeeks. https://www.geeksforgeeks.org/shortest-remaining-time-first-preemptive-sjf-scheduling-algorithm/ |