-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
73 lines (58 loc) · 2.62 KB
/
main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
import matplotlib.pyplot as plt
class DiskSchedulerSimulator:
def __init__(self, initial_position, requests):
self.initial_position = initial_position
self.requests = requests
self.sequence_dict = {}
def fcfs(self):
self.sequence_dict['FCFS'] = self.requests.copy()
def sstf(self):
self.sequence_dict['SSTF'] = sorted(self.requests, key=lambda x: abs(x - self.initial_position))
def scan(self):
sorted_requests = sorted(self.requests)
lower = [r for r in sorted_requests if r < self.initial_position]
upper = [r for r in sorted_requests if r >= self.initial_position]
self.sequence_dict['SCAN'] = lower + upper
def c_scan(self):
sorted_requests = sorted(self.requests)
lower = [r for r in sorted_requests if r < self.initial_position]
upper = [r for r in sorted_requests if r >= self.initial_position]
self.sequence_dict['C-SCAN'] = upper + lower
def look(self):
sorted_requests = sorted(self.requests)
lower = [r for r in sorted_requests if r < self.initial_position]
upper = [r for r in sorted_requests if r > self.initial_position]
self.sequence_dict['LOOK'] = lower + upper
def c_look(self):
sorted_requests = sorted(self.requests)
lower = [r for r in sorted_requests if r < self.initial_position]
upper = [r for r in sorted_requests if r > self.initial_position]
self.sequence_dict['C-LOOK'] = upper + lower
def visualize_all(self, algorithm_name=None):
plt.figure(figsize=(12, 6))
if algorithm_name:
plt.step(range(len(self.sequence_dict[algorithm_name])), self.sequence_dict[algorithm_name], label=algorithm_name)
plt.title(f'Disk Scheduling Algorithm: {algorithm_name}')
else:
for algorithm_name, sequence in self.sequence_dict.items():
plt.step(range(len(sequence)), sequence, label=algorithm_name)
plt.title('Disk Scheduling Algorithms Comparison')
plt.xlabel('Request Order')
plt.ylabel('Disk Position')
plt.legend()
plt.show()
while True:
initial_position = 50
requests_sequence = [82, 170, 43, 140, 24, 16, 190]
simulator = DiskSchedulerSimulator(initial_position, requests_sequence)
simulator.fcfs()
simulator.sstf()
simulator.scan()
simulator.c_scan()
simulator.look()
simulator.c_look()
algorithm_name = input("Enter the algorithm name to visualize (or type 'x' to exit): ").upper()
if algorithm_name == 'X':
break
else:
simulator.visualize_all(algorithm_name)