Question: Problem 8: i) In some office space, there can be in the room either only the employees that work there or the cleaning personnel that

Problem 8: i) In some office space, there can be in the room either only the employees that work there or the cleaning personnel that supervise and sterilize the office space. The employees work into their office for a window of time (working_window()) and then take periodically a break outside the office (break_time()). The cleaning personnel never enter the office while there are still employees there. And vice versa, the employees do not enter the office while members of the cleaning personnel are still cleaning and tidying up the offices The employees are represented by threads that execute function employee() and the cleaning personnel are represented by threads which execute function cleaner() void employee() void cleaner() while (true) f while (true) t working_window ; clean_office); break time); break_time(); paces, such that the You are requested to implement synchronization schemes in the dotteds working mode that was described above is ensured. You may use: signal() and wait() calls to properly initialized semaphores and any shared variables among the required threads/ processes. Please justify if there is any possibility of starvation in the solution you provided. ii The office space described above acquires exactly N employees seating/working space. Please modify the synchronization scheme you built for i) so that at most N employees can exist at the office space at the same time, hence at most N threads execute function working_window() at the same time iii)Assume that more cleaning personnel is hired, who can all work together at the same time in the office space, as long as no employees are present. Modify the synchronization scheme you developed for ii) so that at the office space there can be either: at most N employees or at most M members of the cleaning personnel. Solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
