"""simple docstring"""




from collections import deque
class     UpperCamelCase__:





						def __init__(       self		,__UpperCAmelCase		,__UpperCAmelCase		,__UpperCAmelCase     )					->				None:
													A__	     =							process_name  # process name
													A__	     =							arrival_time  # arrival time of the process
													# completion time of finished process or last interrupted time
													A__	     =							arrival_time
													A__	     =							burst_time  # remaining burst time
													A__	     =							0  # total time of the process wait in ready queue
													A__	     =							0  # time from arrival time to completion time






class     UpperCamelCase__:





						def __init__(       self		,__UpperCAmelCase		,__UpperCAmelCase		,__UpperCAmelCase		,__UpperCAmelCase		,)					->				None:
													# total number of mlfq's queues
													A__	     =							number_of_queues
													# time slice of queues that round robin algorithm applied
													A__	     =							time_slices
													# unfinished process is in this ready_queue
													A__	     =							queue
													# current time
													A__	     =							current_time
													# finished process is in this sequence queue
													A__	     =							deque()





						def 				snake_case__	(       self     )					->				list[str]:
													A__	     =							[]
													for i in range(len(self.finish_queue     )     ):
																				sequence.append(self.finish_queue[i].process_name     )
													return sequence





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				list[int]:
													A__	     =							[]
													for i in range(len(__UpperCAmelCase     )     ):
																				waiting_times.append(queue[i].waiting_time     )
													return waiting_times





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				list[int]:
													A__	     =							[]
													for i in range(len(__UpperCAmelCase     )     ):
																				turnaround_times.append(queue[i].turnaround_time     )
													return turnaround_times





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				list[int]:
													A__	     =							[]
													for i in range(len(__UpperCAmelCase     )     ):
																				completion_times.append(queue[i].stop_time     )
													return completion_times





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				list[int]:
													return [q.burst_time for q in queue]





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				int:
													process.waiting_time += self.current_time - process.stop_time
													return process.waiting_time





						def 				snake_case__	(       self		,__UpperCAmelCase     )					->				deque[Process]:
													A__	     =							deque()  # sequence deque of finished process
													while len(__UpperCAmelCase     ) != 0:
																				A__	     =							ready_queue.popleft()  # current process

																				# if process's arrival time is later than current time, update current time
																				if self.current_time < cp.arrival_time:
																											self.current_time += cp.arrival_time

																				# update waiting time of current process
																				self.update_waiting_time(__UpperCAmelCase     )
																				# update current time
																				self.current_time += cp.burst_time
																				# finish the process and set the process's burst-time 0
																				A__	     =							0
																				# set the process's turnaround time because it is finished
																				A__	     =							self.current_time - cp.arrival_time
																				# set the completion time
																				A__	     =							self.current_time
																				# add the process to queue that has finished queue
																				finished.append(__UpperCAmelCase     )

													self.finish_queue.extend(__UpperCAmelCase     )  # add finished process to finish queue
													# FCFS will finish all remaining processes
													return finished





						def 				snake_case__	(       self		,__UpperCAmelCase		,__UpperCAmelCase     )					->				tuple[deque[Process], deque[Process]]:
													A__	     =							deque()  # sequence deque of terminated process
													# just for 1 cycle and unfinished processes will go back to queue
													for _ in range(len(__UpperCAmelCase     )     ):
																				A__	     =							ready_queue.popleft()  # current process

																				# if process's arrival time is later than current time, update current time
																				if self.current_time < cp.arrival_time:
																											self.current_time += cp.arrival_time

																				# update waiting time of unfinished processes
																				self.update_waiting_time(__UpperCAmelCase     )
																				# if the burst time of process is bigger than time-slice
																				if cp.burst_time > time_slice:
																											# use CPU for only time-slice
																											self.current_time += time_slice
																											# update remaining burst time
																											cp.burst_time -= time_slice
																											# update end point time
																											A__	     =							self.current_time
																											# locate the process behind the queue because it is not finished
																											ready_queue.append(__UpperCAmelCase     )
																				else:
																											# use CPU for remaining burst time
																											self.current_time += cp.burst_time
																											# set burst time 0 because the process is finished
																											A__	     =							0
																											# set the finish time
																											A__	     =							self.current_time
																											# update the process' turnaround time because it is finished
																											A__	     =							self.current_time - cp.arrival_time
																											# add the process to queue that has finished queue
																											finished.append(__UpperCAmelCase     )

													self.finish_queue.extend(__UpperCAmelCase     )  # add finished process to finish queue
													# return finished processes queue and remaining processes queue
													return finished, ready_queue





						def 				snake_case__	(       self     )					->				deque[Process]:

													#  all queues except last one have round_robin algorithm
													for i in range(self.number_of_queues - 1     ):
																				A__     ,  A__	     =							self.round_robin(
																				    self.ready_queue		,self.time_slices[i]     )
													#  the last queue has first_come_first_served algorithm
													self.first_come_first_served(self.ready_queue     )

													return self.finish_queue


if __name__ == "__main__":
				import doctest

				__lowerCamelCase											=  Process("P1", 0, 53)
				__lowerCamelCase											=  Process("P2", 0, 17)
				__lowerCamelCase											=  Process("P3", 0, 68)
				__lowerCamelCase											=  Process("P4", 0, 24)
				__lowerCamelCase											=  3
				__lowerCamelCase											=  [17, 25]
				__lowerCamelCase											=  deque([Pa, Pa, Pa, Pa])

				if len(time_slices) != number_of_queues - 1:
								raise SystemExit(0)

				doctest.testmod(extraglobs={"queue": deque([Pa, Pa, Pa, Pa])})

				__lowerCamelCase											=  Process("P1", 0, 53)
				__lowerCamelCase											=  Process("P2", 0, 17)
				__lowerCamelCase											=  Process("P3", 0, 68)
				__lowerCamelCase											=  Process("P4", 0, 24)
				__lowerCamelCase											=  3
				__lowerCamelCase											=  [17, 25]
				__lowerCamelCase											=  deque([Pa, Pa, Pa, Pa])
				__lowerCamelCase											=  MLFQ(number_of_queues, time_slices, queue, 0)
				__lowerCamelCase											=  mlfq.multi_level_feedback_queue()

				# print total waiting times of processes(P1, P2, P3, P4)
				print(
				    F'''waiting time:\
        \t\t\t{MLFQ.calculate_waiting_time(mlfq, [Pa, Pa, Pa, Pa])}'''
				)
				# print completion times of processes(P1, P2, P3, P4)
				print(
				    F'''completion time:\
        \t\t{MLFQ.calculate_completion_time(mlfq, [Pa, Pa, Pa, Pa])}'''
				)
				# print total turnaround times of processes(P1, P2, P3, P4)
				print(
				    F'''turnaround time:\
        \t\t{MLFQ.calculate_turnaround_time(mlfq, [Pa, Pa, Pa, Pa])}'''
				)
				# print sequence of finished processes
				print(
				    F'''sequence of finished processes:\
        {mlfq.calculate_sequence_of_finish_queue()}'''
				)






"""simple docstring"""




from manim import *
class     UpperCamelCase__(			__A ):





						def 				snake_case__	(       self     )					->				List[str]:
													A__	     =							Rectangle(height=0.5		,width=0.5     )
													A__	     =							Rectangle(height=0.4_6		,width=0.4_6     ).set_stroke(width=0     )

													A__	     =							Rectangle(height=0.2_5		,width=0.2_5     )

													A__	     =							[mem.copy() for i in range(6     )]
													A__	     =							[mem.copy() for i in range(6     )]
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							VGroup(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							Text('CPU'		,font_size=24     )
													A__	     =							Group(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0.5		,aligned_edge=__UpperCAmelCase     )
													cpu.move_to([-2.5, -0.5, 0]     )
													self.add(__UpperCAmelCase     )

													A__	     =							[mem.copy() for i in range(4     )]
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							Text('GPU'		,font_size=24     )
													A__	     =							Group(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0.5		,aligned_edge=__UpperCAmelCase     )
													gpu.move_to([-1, -1, 0]     )
													self.add(__UpperCAmelCase     )

													A__	     =							[mem.copy() for i in range(6     )]
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )

													A__	     =							Text('Model'		,font_size=24     )
													A__	     =							Group(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0.5		,aligned_edge=__UpperCAmelCase     )
													model.move_to([3, -1.0, 0]     )
													self.add(__UpperCAmelCase     )

													A__	     =							[]
													A__	     =							[]

													for i, rect in enumerate(__UpperCAmelCase     ):
																				A__	     =							fill.copy().set_fill(__UpperCAmelCase		,opacity=0.8     )
																				target.move_to(__UpperCAmelCase     )
																				model_arr.append(__UpperCAmelCase     )

																				A__	     =							Rectangle(height=0.4_6		,width=0.4_6     ).set_stroke(width=0.0     ).set_fill(__UpperCAmelCase		,opacity=0.8     )
																				cpu_target.move_to(cpu_left_col_base[i]     )
																				model_cpu_arr.append(__UpperCAmelCase     )

													self.add(*__UpperCAmelCase		,*__UpperCAmelCase     )

													A__	     =							[meta_mem.copy() for i in range(6     )]
													A__	     =							[meta_mem.copy() for i in range(6     )]
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							VGroup(*__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							VGroup(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0     )
													A__	     =							Text('Disk'		,font_size=24     )
													A__	     =							Group(__UpperCAmelCase		,__UpperCAmelCase     ).arrange(__UpperCAmelCase		,buff=0.5		,aligned_edge=__UpperCAmelCase     )
													disk.move_to([-4, -1.2_5, 0]     )
													self.add(__UpperCAmelCase		,__UpperCAmelCase     )

													A__	     =							Square(side_length=2.2     )
													key.move_to([-5, 2, 0]     )

													A__	     =							MarkupText(
													    f'''<b>Key:</b>\n\n<span fgcolor=\'{YELLOW}\'>●</span> Empty Model'''		,font_size=18		,)

													key_text.move_to([-5, 2.4, 0]     )

													self.add(__UpperCAmelCase		,__UpperCAmelCase     )

													A__	     =							MarkupText(
													    f'''<span fgcolor=\'{BLUE}\'>●</span> Checkpoint'''		,font_size=18		,)

													blue_text.next_to(__UpperCAmelCase		,DOWN * 2.4		,aligned_edge=key_text.get_left()     )
													self.add(__UpperCAmelCase     )

													A__	     =							MarkupText(
													    f'''Now watch as an input is passed through the model\nand how the memory is utilized and handled.'''		,font_size=24		,)
													step_a.move_to([2, 2, 0]     )

													self.play(Write(__UpperCAmelCase     )     )

													A__	     =							Square(0.3     )
													input.set_fill(__UpperCAmelCase		,opacity=1.0     )
													input.set_stroke(width=0.0     )
													input.next_to(model_base[0]		,__UpperCAmelCase		,buff=0.5     )

													self.play(Write(__UpperCAmelCase     )     )

													input.generate_target()
													input.target.next_to(model_arr[0]		,direction=__UpperCAmelCase		,buff=0.0_2     )
													self.play(MoveToTarget(__UpperCAmelCase     )     )

													self.play(FadeOut(__UpperCAmelCase     )     )

													A__	     =							Arrow(start=__UpperCAmelCase		,end=__UpperCAmelCase		,color=__UpperCAmelCase		,buff=0.5     )
													a.next_to(model_arr[0].get_left()		,__UpperCAmelCase		,buff=0.2     )

													model_cpu_arr[0].generate_target()
													model_cpu_arr[0].target.move_to(gpu_rect[0]     )

													A__	     =							MarkupText(
													    f'''As the input reaches a layer, the hook triggers\nand weights are moved from the CPU\nto the GPU and back.'''		,font_size=24		,)
													step_a.move_to([2, 2, 0]     )

													self.play(Write(__UpperCAmelCase		,run_time=3     )     )

													A__	     =							{'run_time': 1, 'fade_in': True, 'fade_out': True, 'buff': 0.0_2}

													self.play(
													    Write(__UpperCAmelCase     )		,Circumscribe(model_arr[0]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(model_cpu_arr[0]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(gpu_rect[0]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,)
													self.play(MoveToTarget(model_cpu_arr[0]     )     )

													A__	     =							a.copy()
													for i in range(6     ):
																				a_c.next_to(model_arr[i].get_right() + 0.0_2		,__UpperCAmelCase		,buff=0.2     )

																				input.generate_target()
																				input.target.move_to(model_arr[i].get_right() + 0.0_2     )

																				A__	     =							AnimationGroup(
																				    FadeOut(__UpperCAmelCase		,run_time=0.5     )		,MoveToTarget(__UpperCAmelCase		,run_time=0.5     )		,FadeIn(__UpperCAmelCase		,run_time=0.5     )		,lag_ratio=0.2     )

																				self.play(__UpperCAmelCase     )

																				model_cpu_arr[i].generate_target()
																				model_cpu_arr[i].target.move_to(cpu_left_col_base[i]     )

																				if i < 5:
																											model_cpu_arr[i + 1].generate_target()
																											model_cpu_arr[i + 1].target.move_to(gpu_rect[0]     )
																											if i >= 1:
																																		A__	     =							0.7

																											self.play(
																											    Circumscribe(model_arr[i]		,**__UpperCAmelCase     )		,Circumscribe(cpu_left_col_base[i]		,**__UpperCAmelCase     )		,Circumscribe(cpu_left_col_base[i + 1]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(gpu_rect[0]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(model_arr[i + 1]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,)
																											if i < 1:
																																		self.play(
																																		    MoveToTarget(model_cpu_arr[i]     )		,MoveToTarget(model_cpu_arr[i + 1]     )		,)
																											else:
																																		self.play(
																																		    MoveToTarget(model_cpu_arr[i]		,run_time=0.7     )		,MoveToTarget(model_cpu_arr[i + 1]		,run_time=0.7     )		,)
																				else:
																											model_cpu_arr[i].generate_target()
																											model_cpu_arr[i].target.move_to(cpu_left_col_base[-1]     )
																											input.generate_target()
																											input.target.next_to(model_arr[-1].get_right()		,RIGHT + 0.0_2		,buff=0.2     )

																											self.play(
																											    Circumscribe(model_arr[-1]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(cpu_left_col_base[-1]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,Circumscribe(gpu_rect[0]		,color=__UpperCAmelCase		,**__UpperCAmelCase     )		,)

																											self.play(MoveToTarget(model_cpu_arr[i]     )     )

																				A__	     =							a_c
																				A__	     =							a_c.copy()

													input.generate_target()
													input.target.next_to(model_base[-1]		,RIGHT + 0.0_2		,buff=0.5     )
													self.play(
													    FadeOut(__UpperCAmelCase     )		,FadeOut(__UpperCAmelCase		,run_time=0.5     )		,)

													A__	     =							MarkupText(f'''Inference on a model too large for GPU memory\nis successfully completed.'''		,font_size=24     )
													step_a.move_to([2, 2, 0]     )

													self.play(Write(__UpperCAmelCase		,run_time=3     )		,MoveToTarget(__UpperCAmelCase     )     )

													self.wait()





