26 skills found
CMU-SAFARI / MQSimMQSim is a fast & accurate simulator for modern multi-queue (MQ) and SATA SSDs. MQSim faithfully models new high-bandwidth protocol implementations, steady-state SSD conditions, and full end-to-end latency of requests in modern SSDs. Described in detail in the FAST 2018 paper: http://usenix.org/system/files/conference/fast18/fast18-tavakkol.pdf
A-Herzog / WarteschlangensimulatorWarteschlangensimulator is a free, platform independent, discrete-event, stochastic simulator which allows to model queueing systems in form of flowcharts.
djordon / Queueing ToolSimulator for queueing networks written in Python
danslimmon / QsimQueueing system simulator
AbdeltwabMF / Queueing ModelsimQueueing Models Simulator.
HongyuHe / Noserver凵 Full-system, queuing simulator for serverless workflows.
gunnihinn / QueuesimA simple bounded queue simulator
kargaranamir / M M 1 Queue SimulatorAn M/M/1/K queue Python3 simulator that compares the simulation results against the analytics results. The queue have limited capacity K and processes may be blocked (if queue is full) or leave queue before get service (there is a deadline for each process) or get service from server.
basomingera / MM1 Queue SimulatorAn M/M/1 queue Python3 simulator that compares the simulation results against the steady state results
Aayushman-Gupta / Multithreaded Stock Price Simulator📈 Multithreaded Stock Price Simulator built in C++ with Producer–Consumer concurrency, thread-safe queues, and a React frontend for real-time stock visualization.The frontend consumes this data over WebSockets and displays it with interactive charts.
wanjads / SkyLinkSimulatorA fast simulator for a LEO satellite network with ISLs/GSLs, buffer/queueing model, and routing strategies
revenol / AgeQueueingA queueing simulator implemented on Python
Shopify / GoqueuesimUser queueing simulator supporting diverse client config behaviours via Go coroutines
animedaisuki / Air Traffic Control SimulatorA Java-based ATC (Air Traffic Control) simulator featuring real-time queuing, terminal management, and emergency handling. Built with JavaFX and tested with JUnit.
ashiqurrahmananik / Queue SimulatorA Single Server Queue Simulator Using C++
Abdallah-Abdelazim / Disk Scheduler SimulatorA scheduling simulator that implements different disk scheduling algorithms and applies it on a disk queue with requests for I/O blocks on cylinders.
sharvita / CPU Scheduling The primary goal of this lab assignment is to understand various CPU scheduling algorithms, gain some experience building a simulator for CPU scheduling algorithm and to evaluate their performances. Requirements Programming language: You must use either C or C++ to develop your program. Running Environment: Your program should be compiled at CSEGRID and be able to be tested without errors. The implementation details Write a program to simulate a CPU scheduler which selects a process from a ready queue and executes the process by using the given scheduling algorithm, display its actives and evaluate its performance based on measurements such as average turn-around time, average waiting time, and total number of context switching. When a process is scheduled, the simulator will simply print what the process is running at what time, collecting data and producing Gantt Chart-like outputs. Specifications You have to implement FCFS (First Come First Serve), SRTF (Shortest Remaining Task First – preemptive), and RR (Round Robin) scheduling algorithms. Assumptions Use the following assumptions when you design and implement your CPU simulator. There is only one CPU All processes perform only CPU operations. All processes have the same priority. The newly arrived process is directly added to the back of the ready queue. We use only ready queue for this simulation. Context switching is done in 0 ms. Context switch is performed only when a current process is moved to the back of ready queue. All time are given milliseconds. Use FCFS policy for breaking the tie. Measurements and Evolution You program should collect the following information about each process: Time of completion Waiting time Turn around time No. of Context Switching You program should calculate the following information using the collected data: Average CPU burst time Average waiting time Average turn around time Average response time Total number of Context Switching performed Simulator Input Process information (assume a maximum of 100 processes) will be read from a text file. The information for each process will include the following fields: pid: a unique numeric process ID. arrival time: arrival time for a process in ms. CPU burst time: the CPU time requested by a processes
mcialini / MM1A simple M/M/1 Queue Simulator
omo / Disquea discrete queue model simulator
Ahrorus / Search Engine SimulatorSearch engine simulator made using Java Swing GUI, implementing Heapsort and Priority Queue data structure.
