This repository serves as a comprehensive collection of all the projects, homework assignments, and resources related to the Performance Evaluation course I completed in my fifth semester of my Master's degree at Sharif University of Technology. The course was instructed by Prof. Ali Movaghar from the Department of Computer Engineering.
Description:
This homework involves the analysis of an M/M/1/K queue system, focusing on its performance evaluation. The main task is to compute various performance metrics and analyze their implications.
Parameters:
- Service Rate (μ): The rate at which the service is provided.
- Arrival Rate (λ): The rate at which arrivals occur.
- Queue Capacity (K): Set to 14.
Key Aspects Covered:
- Performance Metrics: Calculation of the probability of having
ncustomers in the system (P_n), average number of customers in the system (N_c), and probabilities of blocking (P_b) and dropping (P_d). - Simulation Results: Results showing the impact of varying parameters on system performance.
- Formulas Used:
P_n(λ, μ)for the probability ofncustomers.N_cfor the average number of customers.- Calculation of
P_bandP_dusing the provided formulas.
- Analysis: Discussion on the impact of different parameters on system performance.
Description:
This homework involves the analysis of the Round Robin scheduling algorithm within a queue system. It focuses on understanding how the Round Robin mechanism affects performance.
Key Aspects Covered:
- Round Robin Scheduling: Examination of the algorithm's performance in managing queues.
- Performance Metrics: Analysis of average wait time and throughput under different configurations.
- Theoretical Evaluation:
- Calculation of performance metrics with given parameters (μ and θ).
- Breakdown of theoretical results and their implications.
- Evaluation of the impact of different time slices and system configurations.
Description:
This is a theoretical assignment that involves detailed questions and answers related to queue systems. It aims to test understanding of queueing theory concepts and their applications.
Key Aspects Covered:
- Theoretical Questions: A set of questions designed to explore various aspects of queueing theory.
- Solutions: Detailed answers and explanations for each question, providing insights into the theoretical aspects of queue systems.
For further details on each homework, please refer to the corresponding files in this repository. Feel free to reach out if you have any questions or need additional information.