C++动态优先级调度算法.doc

/ stdafx.h : include file for standard system include files,/ or project specific include files that are used frequently, but/ are changed infrequently/#if !defined(AFX_STDAFX_H_66EA409C_5A68_4105_A5B2_DF00F9B5E262_INCLUDED_)#define AFX_STDAFX_H_66EA409C_5A68_4105_A5B2_DF00F9B5E262_INCLUDED_#if _MSC_VER 1000#pragma once#endif / _MSC_VER 1000/ TODO: reference additional headers your program requires here/AFX_INSERT_LOCATION/ Microsoft Visual C+ will insert additional declarations immediately before the previous line.#endif / !defined(AFX_STDAFX_H_66EA409C_5A68_4105_A5B2_DF00F9B5E262_INCLUDED_)/ 动态优先级.cpp : Defines the entry point for the console application./#include stdafx.h#include#includetypedef struct /定义一个结构体（进程控制块） char name20; /进程名int runtime; /运行时间int privilege; /到达时间char state; /进程状态，输出为R时表示进程处于就绪状态 NODE;typedef struct node /定义一个结点 NODE data; /进程数据struct node *next; /链接指针LNODE;/*定义延时函数，模拟CPU调度用时过程*/void Delay(int i) int x,y;while(i-)x=0;while(x10000)y=0;while(ydata=x;p-next=NULL;if(*head=NULL) /若为空链表*head=p;else /若为非空链表 p2=p1=*head; /在首结点之后寻找新结点p的插入位置while(p2!=NULL&(p2-data).privilegedata).privilege) p1=p2;p2=p2-next;if(p2=NULL) /新结点插入尾结点后p1-next=p;else if(p1=p2) p-next=*head;*head=p;else /新结点插入p1和p2所指结点之间p-next=p2; p1-next=p;/*定义释放队列空间的函数*/void DeleteQueue(LNODE *head,NODE *n)LNODE *p=*head;*n=(*head)-data;*head=(*head)-next;delete p;cout-endl;cout被调度进程名为:namen;/*定义显示进程信息的函数*/void Output(LNODE *head)LNODE *p=*head;cout进程名 剩余时间 优先级 进程状态n;do coutsetw(4)data).name setw(8)data).runtime setw(10)data).privilegesetw(11)data).statenext;coutendl;while(p!=NULL);Delay(2); /模拟延时两秒void time(LNODE *head)LNODE *p=*head;/*主函数*/void main( ) LNODE *head=NULL; NODE curr,temp; coutendl; cout-优先级调度算法-n; coutendl; cout输入进程：（当进程到达时间为0时，结束输入）n; cout-n; temp.runtimetemp.privilege; if(temp.runtime=0) break; temp.state=R; InsertQueue(&head,temp); coutendl; while(head!=NULL) Output(&head); De