Problem
In a real time data base management system two important task are reading and writing in the database. The read operation will carried out in every 3 mile second and it will last for 1 mile second. The write operation executes in every 10 mile second and it will take 4 mile second to complete its operation. There is garbage collector process, which appears only one in an hour at 0.1 mile second and will take 0.8 mile second of CPU time. Propose a suitable scheduling algorithm so that the garbage collector will start as it appears in the system but that may not hamper the read or write operation. Give justification against your selection of algorithm. Draw the Gantt chart diagram to establish your proposal.