Antonio Olmedo :: personal website

This was an assignment for "Operative Systems Fundamentals " course. It's a tasks scheduler implemented in C under Linux. The goal of this project is to simulate, in a controlled environment, different CPU scheduling algorithms and obtain measurements to evaluate their effect. It incorporates a memory management module that controls the access of processes to the system, depending on the available memory. The three scheduling algorithms are: static allocation , dynamic allocation and pagination. The figure shows the implementation model (in Spanish).

This project was developed side by side with Javier Díaz-Romeral Torralbo. Appart from the main program, we built over 10 scripts to test the different scheduling algorithms, and document everything afterwards.

You can download the wide documentation (also in Spanish) which have lots of graphics and statistics that can be used to compare the algorithms, along with the source code, licensed under GNU General Public License (GPL)