Suspendidos

Description:

Suspension is a feature that allows the simulation of suspending and resuming blocked processes to secondary storage (disk) in a memory management system. This way, the memory space is freed up for other processes and the blocked processes can be resumed later. This implementation offers an intuitive graphical interface to simulate and visualize the operation of supension in an interactive environment.

Featured Features:

• Visual Simulation: Watch in real time how the program suspends and resumes the blocked processes to and from the disk in an easy-to-understand interface.
• Efficient Management: Visualize how the program optimizes the memory usage and reduces the blocking time of the processes.
• Direct Interaction: Add, pause, interrupt, terminate, resume and display information of all processes manually or automatically to experience different scenarios.
• Performance Metrics: Calculate and display key metrics, such as return time, wait time, and response time.
• Memory Status: Displays the available frames, the memory in use and the available memory in real time.
• Next Process: Displays the next process to enter memory from ready queue, its information and the count of new and finished processes.
• Next Suspended: Displays the next process to be resumed from the disk, its information and the count of new, ready, blocked, suspended and finished processes.
• Process Table: Displays the state of the process table and the memory states of each process.

Instructions for use:

• Download the application.
• Run the application.
• Enter the number of initial processes.
• Enter the quantum or leave it as default.
• Press start to start the simulator.
• Press the keys “i”, “e”, “p”, “c”, “n”, “b”, “t”, "s" or "r" to interact with the simulator, interrupting, pausing, terminating by error, continuing execution, creating a new process, showing the information of all processes, suspending and recovering some blocked processes, changing the memory parameters or showing the state of the process table.

Analyze performance and behaviour of the program by using multiple settings to better understand how the suspension technique works along with pagination and Round Robin.

1.0.5

Description:

Pagination is a memory management technique that divides the physical memory space into fixed units called frames. Each process is divided into equal-sized units called pages, which are loaded into the frames on demand. This way, the memory space is better utilized and external fragmentation is avoided. This implementation offers an intuitive graphical interface to simulate and visualize the operation of pagination in an interactive environment.

Featured Features:

• Visual Simulation: Watch in real time how pagination assigns the frames to the pages of the processes in an easy-to-understand interface.
• Efficient Management: Visualize how pagination optimizes memory usage and reduces process loading time.
• Direct Interaction: Add, pause, interrupt, terminate, resume and display information of all processes manually or automatically to experience different scenarios.
• Performance Metrics: Calculate and display key metrics, such as return time, wait time, and response time.
• Customizable Parameters: Choose the number of frames, the size of the frames and the size of the pages from the interface to adjust the available memory space.
• Memory Status: Displays the available frames, the memory in use and the available memory in real time.
• Next Process: Displays the next process to enter memory, its information and the count of new and finished processes.
• Process Table: Displays the state of the process table and the memory states of each process.

Instructions for use:

• Download the application.
• Run the application.
• Enter the number of initial processes.
• Enter the quantum or leave it as default.
• Press start to start the simulator.
• Press the keys “i”, “e”, “p”, “c”, “n”, “b”, or “t” to interact with the simulator, interrupting, pausing, terminating by error, continuing execution, creating a new process, showing the information of all processes and memory state or changing the quantum on the interface.

Analyze performance and memory metrics by using multiple settings to better understand how the Pagination works along with Round Robin.

Round Robin scheduling algorithm

Description:

The Round Robin scheduling algorithm is a variant of the FCFS (First-Come, First-Served) algorithm that assigns a fixed time or quantum to each process in the queue. This prevents starvation and improves equity and response time. This implementation offers an intuitive graphical interface to simulate and visualize the behavior of the Round Robin algorithm in an interactive environment.

Featured Features:

• Visual simulation: Observe in real time how the Round Robin algorithm plans and executes processes in an easy-to-understand interface.
• Efficient Scheduling: Visualizes how Round Robin alternates processes based on their quantum, which can significantly affect system performance.
• Direct interaction: Add, pause, interrupt, terminate, resume and display information from all processes manually or automatically to experience different scenarios.
• Performance Metrics: Calculates and displays key metrics such as return time, wait time, and response time.
• Customizable Quantum: Choose the quantum you want from the interface to adjust the processor time assigned to each process.

Instructions for use:

• Download the application.
• Run the application.
• Enter the number of initial processes or create your own process.
• Enter the quantum number before press start.
• Press start to start the simulator.
• Press the “i”, “e”, “p”, “c”, “n”, “b” keys to interact with the simulator, interrupting, pausing, ending by mistake, continuing execution, creating a new process, showing the information of all processes or changing the quantum on the interface.

Analyze performance metrics by using multiple quantum´s to better understand how the Round Robin algorithm works.

FCFS scheduling algorithm

Description:

The FCFS (First-Come, First-Served) scheduling algorithm is an essential approach in operating system process planning and resource management. This implementation provides an intuitive graphical interface to simulate and visualize the behavior of the FCFS algorithm in an interactive environment.

Featured Features:

• Visual Simulation: Watch in real time how the FCFS algorithm schedules and executes processes in an easy-to-understand user interface.
• Efficient Scheduling: Visualizes how FCFS orders processes based on their arrival, which can significantly affect system performance.
• Direct Interaction: Add, pause, interrupt, terminate, resume and display information on all processes manually or automatically to experience different scenarios.
• Performance Metrics: Calculates and displays key metrics, such as return time, wait time, and response time.

Instructions for use:

• Download the application.
• Run the application.
• Enter the number of initial processes or create your own process.
• Press start to start the simulator.
• Press the "i", "e", "p", "c", "n", "b" keys to interact with the simulator, interrupting, pausing, ending by error, continuing execution, creating a new process or showing the information of all the processes.

Analyze performance metrics to better understand how the FCFS algorithm works.