操作系统上机实验

计算机操作系统实验指导

实验一进程管理

1．目的和要求

加强对进程概念的理解。

2．实验内容

至少要有：创建新的进程；查看运行进程；换出某个进程；杀死运行进程以及进程之间通信等功能。

3．实验环境

①PC兼容机

②Windows、DOS系统

③TC语言

4．实验提示

PCB结构通常包括以下信息：进程名，进程优先数，轮转时间片，进程所

占用的CPU时间，进程的状态，当前队列指针等。可根据实验的不同，PCB结

构的内容可以作适当的增删。

主体程序

#include "conio.h"

#include "stdio.h"

#include "stdlib.h"

struct jincheng_type

{ int pid;

int youxian;

int daxiao;……… };

struct jincheng_type neicun[20];

int shumu=0,pid_l;

main()

{

int n,m,i;

char a;

n=1;

while(n==1)

{

clrscr();

printf("\n********************************************"); printf("\n* 进程演示系统*"); printf("\n********************************************"); printf("\n 1.创建新的进程 2.查看运行进程"); printf("\n 3.换出某个进程 4.杀死运行进程"); printf("\n 5.进程之间通信 6.退出系统"); printf("\n********************************************"); printf("\n请选择（1～6）");

a=getche();

switch(a)

{ case'1':

create( );

break;

case'2':

run( );

break;

case'3':

huanchu();

break;

case'4':

kill( );

break;

case'5':

tongxun( );

break;

case'6': exit(0);

default: n=0;

}

}

}

create( ) /* 创建一个进程的示例（不完整的程序）*/ {

if(shumu>=20)

{

printf("\n内存已满，请先结束或换出进程\n");

}

else

{

printf("\n请输入新进程的pid\n");

scanf("%d",&neicun[shumu-1].pid);

printf("\n请输入新进程的优先级\n");

scanf("%d",&neicun[shumu-1].youxian);

printf("\n请输入新进程的大小\n");

scanf("%d",&neicun[shumu-1].daxiao);

shumu++;

}

}

5．实验运行结果

********************************************

* 进程演示系统*

********************************************

1.创建新的进程

2.查看运行进程

3.换出某个进程

4.杀死运行进程

5.进程之间通信

6.退出系统

********************************************

请选择（1～6）

然后根据你选择的不同，出现不同的结果。

实验二进程调度

1．目的和要求

进程调度是处理机管理的核心内容。本实验要求用C语言编写和调试一个简单的进程调度程序。通过本实验可以加深理解有关进程控制块、进程队列的概念，并体会和了解优先数和时间片轮转调度算法的具体实施办法。

2．实验内容

①设计进程控制块PCB表结构（与实验一的结构相同），分别适用于优先数调度算法和循环轮转调度算法。

②建立进程就绪队列。对两种不同算法编制入链子程序。

③编制两种进程调度算法：1）优先数调度；2）循环轮转调度

3．实验环境

同实验一

4．实验提示

①本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。

②为了便于处理，程序中的某进程运行时间以时间片为单位计算。各进程的优先数或轮转时间数以及进程需运行的时间片数的初始值均由用户给定。

③在优先数算法中，优先数可以先取值为98，进程每执行一次，优先数减3，CPU时间片数加1，进程还需要的时间片数减1。在轮转算法中，采用固定时间片（即：每执行一次进程，该进程的执行时间片数为已执行了2个单位），这时，CPU时间片数加2，进程还需要的时间片数减2，并排列到就绪队列的尾上。

④对于遇到优先数一致的情况，采用FIFO策略解决。

5．实验运行结果

TYPE THE ALGORITHM (PRIORITY/ROUNDROBIN):

若选择了PRIORITY（优先数算法），则进一步显示：

INPUT NAME AND NEEDTIME

A1 2

A2 3

A3 4

A4 2

A5 4

OUTPUT OF PRIORITY：

CPUTIME:1

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 1 1 45 working

A2 0 3 47 ready

A3 0 4 46 ready

A4 0 2 48 ready

A5 0 4 46 ready

CPUTIME:2

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 2 1 45 ready

A2 0 3 47 ready

A3 0 4 46 ready

A4 1 1 45 working

A5 0 4 46 ready

CPUTIME:3

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 3 1 45 ready

A2 1 2 44 working

A3 0 4 46 ready

A4 2 2 45 ready

A5 0 4 46 ready

CPUTIME:4

NAME CPUTIME NEEDTIME PRIORITY STATE A1 4 1 45 working A2 2 2 44 ready

A3 0 4 46 ready

A4 3 2 45 ready

A5 0 4 46 ready

CPUTIME:5

NAME CPUTIME NEEDTIME PRIORITY STATE A1 5 1 45 ready

A2 3 2 44 ready

A3 1 3 43 working A4 4 2 45 ready

A5 0 4 46 ready

CPUTIME:6

NAME CPUTIME NEEDTIME PRIORITY STATE A1 6 1 45 ready

A2 4 2 44 ready

A3 2 3 43 ready

A4 5 2 45 ready

A5 1 3 43 working

CPUTIME:7

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 5 2 44 ready

A3 3 3 43 ready

A4 6 2 45 ready

A5 2 3 43 ready

CPUTIME:8

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 6 2 44 ready

A3 4 3 43 ready

A4 7 1 42 working A5 3 3 43 ready

CPUTIME:9

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 7 1 41 working A3 5 3 43 ready

A4 8 1 42 ready

A5 4 3 43 ready

CPUTIME:10

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 9 1 41 ready

A3 7 2 40 working A4 9 1 42 ready

A5 5 3 43 ready

CPUTIME:11

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 10 1 41 ready

A3 8 2 40 ready

A4 10 1 42 ready

A5 6 2 40 working

CPUTIME:12

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 11 1 41 ready

A3 9 2 40 ready

A4 11 0 39 finish

A5 7 2 40 ready

CPUTIME:13

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 12 0 38 finish A3 9 2 40 ready

A4 11 0 42 finish

A5 7 2 40 ready

CPUTIME:13

NAME CPUTIME NEEDTIME PRIORITY STATE A1 7 0 42 finish A2 12 0 38 finish A3 10 1 37 working A4 11 0 42 finish

A5 8 2 40 ready CPUTIME:14

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 7 0 42 finish

A2 12 0 38 finish

A3 11 1 37 ready

A4 11 0 42 finish

A5 9 1 37 working

CPUTIME:15

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 7 0 42 finish

A2 12 0 38 finish

A3 12 0 34 finish

A4 11 0 42 finish

A5 10 1 37 ready

CPUTIME:16

NAME CPUTIME NEEDTIME PRIORITY STATE

A1 7 0 42 finish

A2 12 0 38 finish

A3 12 0 34 finish

A4 11 0 42 finish

A5 11 0 34 finish

若选择了ROUNDROBIN（时间片轮转算法），则进一步显示：

INPUT NAME AND NEEDTIME

A1 2

A2 3

A3 4

A4 2

A5 4

OUTPUT OF ROUNDROBIN：

NAME CPUTIME NEEDTIME COUNT STATE

……………

NAME CPUTIME NEEDTIME COUNT STATE

……………

时间片轮转调度算法输出与上大致相同，但要将PRIORITY项换为COUNT项。

有关实验的改进意见:

在实验操作过程中，发现用户输入的数据量太大且每次用户输入的大多数数据为重复数据，因此考虑采用文件输入方式，用户只需指定特定的输入文件的文件名来输入数据。另一方面，程序的输出量较大，可以考虑采用文件输出的方式来储存程序的运行结果。也可以用实时的输出界面来输出程序结果。

实验二的示例程序如下：

#include

#include

#include

#include

#include

#define P_NUM 5

#define P_TIME 50

enum state{

ready,

execute,

block,

finish

};

struct pcb{

char name[4];

int priority;

int cputime;

int needtime;

int count;

int round;

state process;

pcb * next;

};

pcb * get_process();

pcb * get_process(){

pcb *q;

pcb *t;

pcb *p;

int i=0;

cout<<"input name and time"<

while (i

q=(struct pcb *)malloc(sizeof(pcb));

cin>>q->name;

cin>>q->needtime;

q->cputime=0;

q->priority=P_TIME-q->needtime;

q->process=ready;

q->next=NULL;

if (i==0){

p=q;

t=q;

}

else{

t->next=q;

t=q;

}

i++;

} //while

return p;

}

void display(pcb *p){

cout<<"name"<<" "<<"cputime"<<" "<<"needtime"<<" "<<"priority"<<" "<<"state"<

while(p){

cout<name;

cout<<" ";

cout<cputime;

cout<<" ";

cout<needtime;

cout<<" ";

cout<priority;

cout<<" ";

switch(p->process){

case ready:cout<<"ready"<

case execute:cout<<"execute"<

case block:cout<<"block"<

case finish:cout<<"finish"<

}

p=p->next;

}

}

int process_finish(pcb *q){

int bl=1;

while(bl&&q){

bl=bl&&q->needtime==0;

q=q->next;

}

return bl;

}

void cpuexe(pcb *q){

pcb *t=q;

int tp=0;

while(q){

if (q->process!=finish){

q->process=ready;

if(q->needtime==0){

q->process=finish;

}

}

if(tppriority&&q->process!=finish){

tp=q->priority;

t=q;

}

q=q->next;

}

if(t->needtime!=0){

t->priority-=3;

t->needtime--;

t->process=execute;

t->cputime++;

}

}

void priority_cal(){

pcb * p;

clrscr();

p=get_process();

int cpu=0;

clrscr();

while(!process_finish(p)){

cpu++;

cout<<"cputime:"<

cpuexe(p);

display(p);

sleep(2);

clrscr();

}

printf("All processes have finished,press any key to exit");

getch();

}

void display_menu(){

cout<<"CHOOSE THE ALGORITHM:"<

cout<<"1 PRIORITY"<

cout<<"2 ROUNDROBIN"<

cout<<"3 EXIT"<

}

pcb * get_process_round(){

pcb *q;

pcb *t;

pcb *p;

int i=0;

cout<<"input name and time"<

while (i

q=(struct pcb *)malloc(sizeof(pcb));

cin>>q->name;

cin>>q->needtime;

q->cputime=0;

q->round=0;

q->count=0;

q->process=ready;

q->next=NULL;

if (i==0){

p=q;

t=q;

}

else{

t->next=q;

t=q;

}

i++;

} //while

return p;

}

void cpu_round(pcb *q){

q->cputime+=2;

q->needtime-=2;

if(q->needtime<0) {

q->needtime=0;

}

q->count++;

q->round++;

q->process=execute;

}

pcb * get_next(pcb * k,pcb * head){

pcb * t;

t=k;

do{

t=t->next;

}

while (t && t->process==finish);

if(t==NULL){

t=head;

while (t->next!=k && t->process==finish){

t=t->next;

}

}

return t;

}

void set_state(pcb *p){

while(p){

if (p->needtime==0){

p->process=finish;

}

if (p->process==execute){

p->process=ready;

}

p=p->next;

}

}

void display_round(pcb *p){

cout<<"NAME"<<" "<<"CPUTIME"<<" "<<"NEEDTIME"<<" "<<"COUNT"<<" "<<"ROUND"<<" "<<"STA TE"<

while(p){

cout<name;

cout<<" ";

cout<cputime;

cout<<" ";

cout<needtime;

cout<<" ";

cout<count;

cout<<" ";

cout<round;

cout<<" ";

switch(p->process){

case ready:cout<<"ready"<

case execute:cout<<"execute"<

case finish:cout<<"finish"<

}

p=p->next;

}

}

void round_cal(){

pcb * p;

pcb * r;

clrscr();

p=get_process_round();

int cpu=0;

clrscr();

r=p;

while(!process_finish(p)){

cpu+=2;

cpu_round(r);

r=get_next(r,p);

cout<<"cpu "<

display_round(p);

set_state(p);

sleep(5);

clrscr();

}

}

void main(){

display_menu();

int k;

scanf("%d",&k);

switch(k){

case 1:priority_cal();break;

case 2:round_cal();break;

case 3:break;

display_menu();

scanf("%d",&k);

}

}