When a process data is taken temporarily out of memory to a backing store, and then brought memory for continued execution of the process, the previous definition for is Dispatcher Load time binding Swapping Execution time binding The process state changes from waiting to ready if The process starts I/O The process is created The I/O is completed The process has finished execution The contents inside the page table are Page number Frame number Memory addresses thread. None The model maps each user-level thread to one kernel thread many-to-many two-level one-to-one many-to-one A uses an existing thread rather than creating a new one to complete lightweight process thread pool scheduler activation asynchronous procedure call If the time chosen time quantum of round robin is too short, then this results Short average waiting time Many context switches fair time for uses same as FIFO time The scheduling algorithm is designed especially for time-sharing