This projects is an illustration of how threads, locks, and semaphores work. In this example, we have an intersection in which cars want to pass it. Every area of this intersection (NE, NW, SW, SE) has a lock seperately. every car arrives at the intersection, has a source and a destination road, so it is clear which areas of the intersection should be without any other car to permit the very arrived car to pass. Hence, if a car want to pass an area line NE in its way, it must aquire that semaphore.
I implemented this project using java thread synchoronization and thread locks which they serve as four areas in the intersection that I mentioned above.
In this project, paging system of os is implemented. we have a backstore.bin file that it is as the physical memory. We have a virtual memory for processes running in the os and each virtual address should be translated to the related physical address using page table and TLB. For more details look at this readme file located in the directory of this project.
This program implements the following disk-scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN, Look and C-Look, and also will service a disk with 5000 cylinders numbered 0 to 4999. The program will generate a random series of 1000 cylinder requests and service them according to each of the algorithms listed above. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement required by each algorithm.