-
Notifications
You must be signed in to change notification settings - Fork 0
/
磁盘调度.cpp
243 lines (232 loc) · 7.36 KB
/
磁盘调度.cpp
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
#include <iostream>
#include <time.h>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <cstring>
#include <windows.h>
#include <fstream>
using namespace std;
int position = 0; //当前磁道位置
int dis = 0;
double average_distance = 0;
void request(vector<int>&m_vec,ofstream &outfile){
cout<<"随机生成磁盘序列:"<<endl;
int n = 0;
srand(time(NULL)); //添加随机数种子
n = rand() % 20 + 1;
int temp = 0;
for(int i=0;i<n;i++){
temp = rand() % 100;
m_vec.push_back(temp);
cout<<temp<<" ";
outfile<<temp<<endl;
}
cout<<endl;
position = rand() % 100;
cout<<"当前磁道:"<<position<<endl;
}
void compute_dis(vector<int>m_vec,int &dis,double &average_distance){
average_distance = (double)dis / (double)m_vec.size();
}
void FIFO(vector<int>m_vec,int position){ //先来先服务算法
dis = 0;
average_distance = 0;
for(vector<int>::iterator it=m_vec.begin();it!=m_vec.end();it++){
dis += abs(position-*it);
Sleep(500);
cout<<"->"<<*it;
position = *it;
}
compute_dis(m_vec,dis,average_distance);
}
void SSTF(vector<int>m_vec,int position){ //最短寻道时间算法
dis = 0;
average_distance = 0;
sort(m_vec.begin(),m_vec.end()); //从小到大排序
int i = 0;
for(vector<int>::iterator it=m_vec.begin();it!=m_vec.end();it++){
if(position >= *it)
i++;
}
int count = 0;
int left = i-1;
int right = i;
while(count<m_vec.size()){
if((left >=0 && abs(m_vec[right]-position) > abs(m_vec[left]-position)) || right>=m_vec.size()){
dis += abs(m_vec[left]-position);
Sleep(500);
cout<<"->"<<m_vec[left];
position = m_vec[left];
left--;
}
else{
dis += abs(m_vec[right]-position);
Sleep(500);
cout<<"->"<<m_vec[right];
position = m_vec[right];
right++;
}
count++;
}
compute_dis(m_vec,dis,average_distance);
}
void SCAN(vector<int>m_vec,int position){ //电梯调度算法
dis = 0;
average_distance = 0;
sort(m_vec.begin(),m_vec.end()); //从小到大排序
int i = 0;
for(vector<int>::iterator it=m_vec.begin();it!=m_vec.end();it++){
if(position >= *it)
i++; //找到position所在的磁道
}
int left = i - 1; //先从外到内扫描
int right = i;
while(left >= 0){
dis += abs(position - m_vec[left]);
Sleep(500);
cout<<"->"<<m_vec[left];
position = m_vec[left];
left --;
}
while(right < m_vec.size()){
dis += abs(position - m_vec[right]);
Sleep(500);
cout<<"->"<<m_vec[right];
position = m_vec[right];
right ++;
}
compute_dis(m_vec,dis,average_distance);
}
void CSCAN(vector<int>m_vec,int position){ //循环扫描算法
dis = 0;
average_distance = 0;
sort(m_vec.begin(),m_vec.end()); //从小到大排序
int i = 0;
for(vector<int>::iterator it=m_vec.begin();it!=m_vec.end();it++){
if(position >= *it)
i++; //找到position所在的磁道
}
int left = i - 1; //先从外到内扫描
int right = i;
while(left >= 0){
dis += abs(position - m_vec[left]);
Sleep(500);
cout<<"->"<<m_vec[left];
position = m_vec[left];
left --;
}
position = 100; //立即到最外侧的磁道
int len = m_vec.size()-1;
while(len >= right){
dis += abs(position - m_vec[len]);
Sleep(500);
cout<<"->"<<m_vec[len];
position = m_vec[len];
len --;
}
compute_dis(m_vec,dis,average_distance);
}
void FSCAN(vector<int>m_vec,int position){ //分步电梯调度算法,。分两个队列
dis = 0;
average_distance = 0;
//SCAN(m_vec,position);
sort(m_vec.begin(),m_vec.end()); //从小到大排序
int i = 0;
for(vector<int>::iterator it=m_vec.begin();it!=m_vec.end();it++){
if(position >= *it)
i++; //找到position所在的磁道
}
int left = i - 1; //先从外到内扫描
int right = i;
while(left >= 0){
dis += abs(position - m_vec[left]);
Sleep(500);
cout<<"->"<<m_vec[left];
position = m_vec[left];
left --;
}
while(right < m_vec.size()){
dis += abs(position - m_vec[right]);
Sleep(500);
cout<<"->"<<m_vec[right];
position = m_vec[right];
right ++;
}
cout<<endl;
cout<<"在扫描的过程中新产生的服务序列:"<<endl;
vector<int>ve;
while(!ve.empty())
ve.pop_back();
int n = 0;
n = rand() % 20 + 1;
int temp = 0;
for(i=0;i<n;i++){
temp = rand() % 100;
cout<<temp<<" ";
ve.push_back(temp);
}
cout<<endl;
cout<<position;
SCAN(ve,position);
average_distance = (double)dis / (double)(m_vec.size()+ve.size());
}
void print(){
cout<<endl<<endl;
cout<<"经计算,磁头移动的总距离为:"<<dis<<endl;
cout<<"磁头平均移动距离:"<<average_distance<<endl;
cout<<endl<<endl;
}
int choose_algorithm(vector<int>m_vec){
cout<<endl<<endl;
cout<<"本实验可用的调度算法有以下5种:"<<endl;
cout<<"1.FIFO 2.SSTF 3.SCAN 4.CSCAN 5.FSCAN 6.结束本序列的调度 7.结束程序"<<endl;
int choice = 0;
cout<<"选择:"<<endl;
cin>>choice;
cout<<endl;
while(choice!=6 && choice!=7){
cout<<"磁盘请求的服务状况:"<<endl;
cout<<position;
switch(choice){
case 1:
FIFO(m_vec,position);break;
case 2:
SSTF(m_vec,position);break;
case 3:
SCAN(m_vec,position);break;
case 4:
CSCAN(m_vec,position);break;
case 5:
FSCAN(m_vec,position);break;
default:
cout<<"******非法输入!******"<<endl<<endl;break;
}
if(choice<=7 && choice>=1)
print();
cout<<"选择:"<<endl;
cin>>choice;
}
if(choice == 7)
return 0;
else
cout<<endl<<endl;
return 1;
}
int main(){
cout<<"---------------磁盘调度算法模拟实验-----------------"<<endl;
ofstream outfile;
outfile.open("data.txt");
while(1){
vector<int> vec;
while(!vec.empty())
vec.pop_back();
request(vec,outfile); //请求服务序列
int flag = choose_algorithm(vec);
if(flag == 0)
break;
}
outfile.close();
return 0;
}