电梯调度算法 磁盘驱动调度（Elevator scheduling algorithm, disk drive scheduling）.docVIP

电梯调度算法 磁盘驱动调度（Elevator scheduling algorithm, disk drive scheduling） # includes stdio.h # includes stdlib.h # includes string.h # includes math.h typedef struct _ proc { char name [20]; / * 定义进程名称 * / int team 定义柱面号; / * * / int i; / * 定义磁道面号 * / int rec 定义记录号; / * * / struct _ proc * prior; struct _ proc * next; } per; pro * g _ head = null, * g _ curr = null, * local; int record = 0; / / 初始柱面号 int i = 1; / / 初始方向 int rec0 = 0; / / 初始记录号 void init () { pro * p; / * 初始化链表 (初始i / o表) * / g _ head = (pro) malloc (sizeof (pro)); g _ head - next = null; g _ head - prior = null; p = (pro) malloc (sizeof (pro)); strcpy (p - name, p1); p - team = 100; p - i = 10; p - rec = 1; p - next = null; p - prior = g _ head; g _ head - next = p; g = g _ curr _ head - next; p = (pro) malloc (sizeof (pro)); strcpy (p - name, p2); p - team = 30; p - i = 5; p - rec = 5; p - next = null; p - prior = g _ curr; g _ curr - next = p; g _ curr = p; p = (pro) malloc (sizeof (pro)); strcpy (p - name, p3); p - team = 40. p - i = 2; p - rec = 4; p - next = null; p - prior = g _ curr; g _ curr - next = p; g _ curr = p; p = (pro) malloc (sizeof (pro)); strcpy (p - name, p4); p - team = 85; p - i = 7; p - rec = 3; p - next = null; p - prior = g _ curr; g _ curr - next = p; g _ curr = p; p = (pro) malloc (sizeof (pro)); strcpy (p - name, p5); p - team = 60; p - i = 8; p - rec = 4; p - next = null; p - prior = g _ curr; g _ curr - next = p; g = g _ curr _ head - next; local = (pro) malloc (sizeof (pro)); / * 选中进程 * / strcpy (local - name, pn); local - team = 0; local - i = 0; local - rec = 0; local - next = null; local - prior = null; } void printinit () / * 打印i / o表 * / { pro * t = g _ head - next; printf (------------------------------------- \ n); printf (请求i / o表 \ n); printf (进程名 柱面号 磁道号 记录号 \ n); while (t! = = null) { printf (% 48% 8d% 8d% 5d \ n, t - name, t - team, t - , t chr); t = t - next; } printf (current process is: \ n); printf (进程