操作系统磁盘调度算法实验报告及代码(2)

}

}

}

cout << \排序后的磁盘序列为：\; for (i = 0; i < m; i++) { }

cout << endl; return cidao;

cout << cidao[i] << \;

//当前磁道输入 int printnow() { A: }

int printoi(int cidao[], int now, int m) { }

//直接由内向外依次给予各请求服务

int printio(int cidao[], int now, int m)

}

return sum; int i; int sum = 0;

cout << \磁道扫描序列为：\; for (i = m - 1; i >= 0; i--) {

cout << cidao[i] << \; sum += abs(now - cidao[i]); now = cidao[i]; cin >> str; a = decide(str); if (a == 0) { } else

now = trans(str, a); return now;

cout << \输入数据类型有误，请重新输入！\ << endl; goto A; char str[10]; int a, now;

cout << \请输入当前磁道号：\;

{ }

//直接从当前次磁道到最外，再由外向内依次给予各请求服务 int printioi(int cidao[], int now, int m) { }

//直接从当前次磁道到最内，再由内向外依次给予各请求服务 int printoio(int cidao[], int now, int m) { }

//先向磁道减小的方向，再向磁道增加的方向 int printsb(int cidao[], int now, int m)

int i; int sum = 0;

cout << \磁道扫描序列为：\; for (i = 0; i < m; i++) { }

return sum;

cout << cidao[i] << \; sum += abs(cidao[i] - now); now = cidao[i]; }

return sum; int i; int sum = 0;

cout << \磁道扫描序列为：\; for (i = m - 1; i >= 0; i--) {

cout << cidao[i] << \; sum += abs(now - cidao[i]); now = cidao[i]; }

return sum; int i; int sum = 0;

cout << \磁道扫描序列为：\; for (i = 0; i < m; i++) {

cout << cidao[i] << \; sum += abs(cidao[i] - now); now = cidao[i];

{ }

//先向磁道增加的方向，再向磁道减小的方向 int printbs(int cidao[], int now, int m) {

int k = 0; int l = 0; int r = 0; int j; int sum = 0;

while (cidao[k]

l = k + 1 ; r = k; while (r

k++; int k = 0; int l = 0; int r = 0; int j; int sum = 0;

while (cidao[k]

l = k + 1; r = k;

for (j = l; j >= 0; j--) { }

now = cidao[0]; while (r

return sum;

cout << cidao[r] << \; sum += cidao[r] - now; now = cidao[r]; r++;

cout << cidao[j] << \; sum += now - cidao[j]; now = cidao[j]; k++;

}

{ }

now = cidao[m - 1]; for (j = l; j >= 0; j--) { }

return sum;

cout << cidao[j] << \; sum += now - cidao[j]; now = cidao[j];

cout << cidao[r] << \; sum += cidao[r] - now; now = cidao[r]; r ++;

//先向磁道减小的方向，再从磁道最大的地方向减小的方向, int printsbs(int cidao[], int now, int m) {

int k = 0; int l = 0; int r = 0; int j; int sum = 0;

cout << \磁盘扫描序列为：\; while (cidao[k]

l = k - 1; r = k;

for (j = l; j >= 0; j--) { }

now = cidao[0];

//sum += abs(cidao[0] - cidao[m - 1]); for (j = m-1; j>=r; j--) { }

cout << cidao[j] << \; sum += abs(now - cidao[j]); now = cidao[j];

cout << cidao[j] << \; sum += now - cidao[j]; now = cidao[j]; k++;

}

return sum;

//先向磁道增大的方向，再从磁道最小的地方向向增大的方向 int printbsb(int cidao[], int now, int m) { }

//就近选择磁道方法

int nearbyselect(int cidao[], int now, int m) {

int k = 0; int l = 0; int r = 0; int sum1 = 0; int sum2 = 0; int suml = 0; int sumr = 0; int sum = 0; int k = 0; int l = 0; int r = 0; int j; int sum = 0;

cout << \磁盘扫描序列为：\; while (cidao[k]

l = k - 1; r = k; while (r

now = cidao[m-1]; for (j = 0; j <= l; j++) { }

return sum;

cout << cidao[j] << \; sum += abs(cidao[j] - now); now = cidao[j];

cout << cidao[r] << \; sum += cidao[r] - now; now = cidao[r]; r ++; k++;