6 skills found
learn-to-race / L2rOpen-source reinforcement learning environment for autonomous racing — featured as a conference paper at ICCV 2021 and as the official challenge tracks at both SL4AD@ICML2022 and AI4AD@IJCAI2022. These are the L2R core libraries.
kautilyadevaraj / SchedulingAlgorithmSimulatorThis project is a web-based simulator for CPU scheduling algorithms. It allows users to input different processes with specific attributes (arrival time, burst time, etc.) and visualize how these processes are scheduled according to the chosen scheduling algorithm.
sonebu / V2lc SimA simulator for VLC-based vehicle localization using a novel angle-of-arrival-sensing receiver, the "QRX".
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
Reinier044 / ATM Arrival Manager Plugin For BlueSky SimulatorAn Arrival Manager (AMAN) for the TU Delft Air Traffic Management course (AE4321).
SusannaDiV / Undirected Weighted Graph Adjacency List Implementation In C This project is a simulator for a satellite navigator, that could be used by a salesman to plan trips between the cities in which he trades. Among the many functions that the navigator must offer the user is also to search for and suggest a route that, from any city of departure, leads to another city of arrival. Normally the path to look for would be that of minimum length, but for simplicity we limit ourselves to any path as long as it is acyclic, that is to say that a same location is visited at most once. The navigator is able to load, from files or standard input, the maps of the regions in which the user moves. The following actions can be carried out at the choice of the user: 1. Creation of the graph by acquiring information on vertices and arcs from standard input, expressed in the following format: origin1 destination1 dist1 origin2 destination2 dist2 .... originN destinationN distN 0 2. Creation of the graph acquiring from file the information on the vertices and on the arcs (the format is the same as for the acquisition from standard input) 3. Textual display of the graph, which shows the list of vertices with the respective labels and, for each vertex, the relative adjacency list with string weights. 4. Insertion of a new vertex in the graph, whose label is provided by input. 5. Insertion of a new arc in the graph, assuming that the labels of its vertices are supplied as input. 6. Determination of the number of vertices. 7. Determination of the number of arcs. 8. Determination of the degree of a vertex, whose label is provided by input. 9. Verificance adjacency between two vertices, whose labels are provided as input. 10. Display of the adjacency list associated with a vertex, whose label is provided as an input. 11. Search for an acyclic path between origin and destination and display on standard output of the path found, in vertex: source format1 vertex2 .... vertexN destination - and overall length.
