The project will involve the development of an interactive card game called Five Hundred (a.k.a 500, or "Cinq Cent" in French). The game will pit one human player and one robot player against a team of robot players. Alternately, the game engine will also support completely automatic playing, for the purpose of testing and evaluating the skills of the robots.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
I will develop a user-level threads package. This provides a simplified replacement for Pthreads that is used previously. Here, I developed Mythreads library which provides a preemptive multi-threading on Linux. It is built as a user library.
We will also attempt to compare the performance if branches could be resolved during IF. Methodology: 1. Change the EduMIPS64 architecture to accommodate for branching by incorporating flushing the pipeline. Perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch predict not-taken). 2. Change the EduMIPS64 architecture to predict-taken for branching. Similarly, we will perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch predict not-taken). 3. Change the EduMIPS64 architecture to resolve branches in the IF stage. This should remove the need for branch prediction. Similarly, we will perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch resolution in the EX stage).
In this investigation Branch Prediction will be considered. We will be investigating the performance difference between predict-taken branches and predict-not-taken. In investigating the above scenarios, we will try to compare it against the performance where the EduMIPS6 waits until EX to resolve branches. We will also attempt to compare the performance if branches could be resolved during IF. Methodology: 1. Change the EduMIPS64 architecture to accommodate for branching by incorporating flushing the pipeline. Perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch predict not-taken). 2. Change the EduMIPS64 architecture to predict-taken for branching. Similarly, we will perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch predict not-taken). 3. Change the EduMIPS64 architecture to resolve branches in the IF stage. This should remove the need for branch prediction. Similarly, we will perform tests of a standard MIPS program (eg. Gcc). Compare performance metrics (specifically total number of clock cycles), to default architecture (branch resolution in the EX stage).
A memory allocation library is developed that is similar to malloc library provided by Unix-like operating systems