1、HWND hWnd;/* 检查6个进程的到达时间和服务时间是否已经全部输入 已经全部输入返回TRUE,否则返回FALSE*/bool CheckEdits() wchar_t strEDITLEN; for (int i=IDC_A1;inext = node; endProc = node; if (startProc-next = NULL) startProc-next = endProc; 移除链表头结点void RemoveNode() if (startProc != NULL) float finishT; wchar_t str10; ProcInfo *tmp = start
2、Proc;next ! startProc = startProc-next;lastrunT = tmp-lastrunT+tmp-remainT; else startProc = endProc = NULL; finishT = tmp- StringCchPrintf(str,10,_T(),finishT); SetDlgItemText(hWnd,IDC_A3+5*tmp-procID,str);),finishT-tmp-arriveT); SetDlgItemText(hWnd,IDC_A4+5*tmp-),(finishT-tmp-arriveT)/(float)tmp-s
3、erverT); SetDlgItemText(hWnd,IDC_A5+5*tmp- delete tmp; 当链表头结点被抢占或时间片到时,将头结点移到尾结点 参数:moreT为头结点运行到被抢占或时间片到的时间间隔void ChangeNode(int moreT) ProcInfo *tmp = startProc; tmp-next = NULL;runT += moreT;remainT -= moreT; endProc-next = tmp; endProc = tmp;lastrunT+moreT;lastrunT += moreT; 先到先服务调度算法void AlgoFCF
4、S(int *arrive,int *server) int procNum = 6; int index = 0; ProcInfo *node; startProc = endProc = NULL; while (procNum) if (startProc ! / 直接将每个进程插入链表,链表中每个结点按顺序运行 while (indexprocID = index;arriveT = arriveindex;serverT = serverindex;remainT = serverindex;lastrunT = arriveindex;runT = 0;priority = 0;
5、 index+; InsertNode(node); RemoveNode(); procNum-; if (index / 查看链表中是否有剩余运行时间比头结点小的进程,如果有存入最小运行时间 while (tmp=tmp-next) ! if (tmp-remainT seize = tmp; else if (minremainT remainT & tmp-remainT = minremainT) if (tmp-arriveT arriveT) seize = tmp; / 查看在头结点被短进程抢占,或运行结束时,是否有新进程到达 if (arriveindex lastrunT+
6、minremainT) node = new ProcInfo; node- index+; InsertNode(node); / 当有新进程到达时,根据剩余运行时间插入到链表中 mid = NULL; tmp = startProc; while (tmp-= endProc) if (tmp-next-remainT endProc-remainT) mid = tmp; break; tmp = tmp- if (mid ! tmp = startProc- while (tmp- if (tmp-next = endProc) tmp2 = endProc; tmp- endProc
7、 = tmp; tmp2-next = mid- mid-next = tmp2; break; tmp = tmp- / 查看刚插入的结点的剩余运行时间是否小于最小剩余时间 if (node- minremainT = node- seize = node; else if (minremainT if (node- seize = node; else break; / 当seize仍为头结点时,表示没有比头结点更小的剩余运行时间,故移除头结点 if (seize = startProc) RemoveNode(); procNum-; else / 否则,将抢占进程移到头结点之后,并更改
8、结点 tmp = startProc; while (tmp !next = seize) tmp-next = seize- if (seize = endProc) endProc = tmp; break; tmp = tmp- seize-next = startProc- if (startProc = endProc) endProc = seize; startProc-next = seize; ChangeNode(minremainT); /* 高响应比优先调度算法 */void AlgoHRP(int *arrive,int *server) int procNum=6;
9、 int index=0; float waitT,minwaitT,waitT2,lastwaitT; ProcInfo *node,*tmp,*seize,*second; float prio=0,stmp; while(procNum) tmp = seize = second = startProc; minwaitT = startProc- / 计算在头结点剩余时间内,是否有进程的优先级超过头结点,如果有,取最先超过头结点的进程为抢占进程 while(tmp=tmp- waitT = (startProc-priority-1)*tmp-serverT+0.1; / 计算超过头结
10、点的最小等待时间 lastwaitT = waitT-(startProc-lastrunT-tmp-arriveT-tmp-runT); / 计算头结点运行期间还需要等待的时间 if (lastwaitT priority = waitT/tmp-serverT+1; else if (minwaitT lastwaitT = minwaitT) / 当等于最小时间时,服务时间越小,优先级越高serverT serverT = seize-serverT) / 当等于最小时间,服务时间也相同时,先到达者优先arriveT) tmp- seize = tmp; else if (minwait
11、T = startProc-remainT) / 当头结点剩余时间内,没有进程的优先级抢占时,计算优先级第二高的进程 waitT2 = startProc-runT+startProc- stmp = waitT2/tmp- if (stmpprio) priority = prio = stmp; second = tmp;6) / 查看在头结点的剩余时间内,或被抢占的时间间隔内,是否有进程到达lastrunT+minwaitT) priority = 1; / 查看在该进程到达,到头结点运行结束,或被抢占前,优先级是否能超过头结点 waitT = (startProc-priority-1
12、)*node- lastwaitT = waitT+(node-arriveT-startProc-lastrunT); if (lastwaitT priority = waitT/node- else if (minwaitT else if (node- if (node- node- seize = node; else if (minwaitT = startProc- waitT2 = startProc-remainT-(node- stmp = waitT2/node- if (stmp prio) second = node; / 当计算的抢占结点仍为头结点时,表示没有抢占的进程,故将第二高优先级的进程移到头结点之后,并移除头结点 if (second != startProc) while (tmp !next = second) next