以下是问题具体内容
1、 设计进程同步算法,使用P/V(wait/signal)操作模拟解决进程中经典同步问题。假设有一个生产者和一个消费者,缓冲区可以存放产品,生产者不断生产产品并存入缓冲区,消费者不断从缓冲区中取出产品并消费,设计代码并运行实现结果。
2、编制时间片轮转调度算法,可自定义时间片的大小。
3、编制静态优先级调度算法,优先级高低可自定义。
(1)生产者与消费者问题代码
#include <semaphore.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#define MAX 256
char *buffer;
sem_t empty; //定义同步信号量empty
sem_t full; //定义同步信号量full
sem_t mutex; //定义互斥信号量mutex
void * producer() //生产者
{
sem_wait(&empty); //empty的P操作
sem_wait(&mutex); //mutex的P操作
printf("input something to buffer:");
buffer=(char *)malloc(MAX); //给缓冲区分配内存空间
fgets(buffer,MAX,stdin); //输入产品至缓冲区
sem_post(&mutex); //mutex的V操作
sem_post(&full); //full的V操作
}
void *consumer() //消费者
{
sem_wait(&full); //full的P操作
sem_wait(&mutex); //mutex的V操作
printf("read product from buffer:%s",buffer); //从缓冲区中取出产品
memset (buffer,0,MAX); //清空缓冲区
sem_post(&mutex); //mutex的V操作
sem_post(&empty); //empty的V操作
}
int main()
{
pthread_t id_producer;
pthread_t id_consumer;
int ret;
sem_init(&empty,0,10); //设置empty的初始值为10
sem_init(&full,0,0); //设置full的初始值为0
sem_init(&mutex,0,1); //设置mutex的初值为1
ret=pthread_create(&id_producer,NULL,producer,NULL); //创建生产者进程
ret=pthread_create(&id_consumer,NULL,consumer,NULL); //创建消费者进程
pthread_join(id_producer,NULL); //等待生产者进程结束
pthread_join(id_consumer,NULL); //等待消费者进程结束
sem_destroy(&empty); //删除信号量
sem_destroy(&full);
sem_destroy(&mutex);
printf("The End...\n");
}
(2)时间片轮转调度
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node
{
char name[20]; /*进程的名字*/
int round; /*分配CPU的时间片*/
int cputime; /*CPU执行时间*/
int needtime; /*进程执行所需要的时间*/
char state; /*进程的状态,W--就绪态,R--执行态,F--完成态*/
int count; /*记录执行的次数*/
struct node *next; /*链表指针*/
}PCB;
PCB *ready=NULL,*run=NULL,*finish=NULL; /*定义三个队列,就绪队列,执行队列和完成队列*/
int num;
void GetFirst(); /*从就绪队列取得第一个节点*/
void Output(); /*输出队列信息*/
void InsertTime(PCB *in); /*时间片队列*/
void InsertFinish(PCB *in); /*时间片队列*/
void TimeCreate(); /*时间片输入函数*/
void RoundRun(); /*时间片轮转调度*/
int main()
{
printf("请输入要创建的进程数目:\n");
scanf("%d",&num);
getchar();
TimeCreate();
RoundRun();
Output();
return 0;
}
void GetFirst() /*取得第一个就绪队列节点*/
{
run = ready;
if(ready!=NULL)
{
run->state = 'R';
ready = ready->next;
run->next = NULL;
}
}
void Output() /*输出队列信息*/
{
PCB *p;
/*p = ready;*/
printf("进程名\t时间片\tcpu时间\t需要时间\t进程状态\t计数器\n");
p = ready;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->round,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
p = finish;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->round,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
p = run;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->round,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
}
void InsertTime(PCB *in) /*将进程插入到就绪队列尾部*/
{
PCB *fst;
fst = ready;
if(ready == NULL)
{
in->next = ready;
ready = in;
}
else
{
while(fst->next != NULL)
{
fst = fst->next;
}
in->next = fst->next;
fst->next = in;
}
}
void InsertFinish(PCB *in) /*将进程插入到完成队列尾部*/
{
PCB *fst;
fst = finish;
if(finish == NULL)
{
in->next = finish;
finish = in;
}
else
{
while(fst->next != NULL)
{
fst = fst->next;
}
in->next = fst->next;
fst->next = in;
}
}
void TimeCreate() /*时间片输入函数*/
{
PCB *tmp;
int i;
printf("输入进程名字和进程时间片所需时间:\n");
for(i = 0;i < num; i++)
{
if((tmp = (PCB *)malloc(sizeof(PCB)))==NULL)
{
perror("malloc");
exit(1);
}
scanf("%s",tmp->name);
getchar();
scanf("%d",&(tmp->needtime));
tmp->cputime = 0;
tmp->state ='W';
tmp->round = 2; /*假设每个进程所分配的时间片是2*/
tmp->count = 0;
InsertTime(tmp);
}
}
void RoundRun() /*时间片轮转调度算法*/
{
int flag = 1;
GetFirst();
while(run != NULL)
{
Output();
while(flag)
{
run->count++;
run->cputime++;
run->needtime--;
if(run->needtime == 0) /*进程执行完毕*/
{
run->state = 'F';
InsertFinish(run);
flag = 0;
}
else if(run->count == run->round)/*时间片用完*/
{
run->state = 'W';
run->count = 0; /*计数器清零,为下次做准备*/
InsertTime(run);
flag = 0;
}
}
flag = 1;
GetFirst();
}
}
(3)静态优先级调度
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node
{
char name[20]; /*进程的名字*/
int priority; /*进程的优先级*/
int round; /*分配CPU的时间片*/
int cputime; /*CPU执行时间*/
int needtime; /*进程执行所需要的时间*/
char state; /*进程的状态,W--就绪态,R--执行态,F--完成态*/
int count; /*记录执行的次数*/
struct node *next; /*链表指针*/
}PCB;
PCB *ready=NULL,*run=NULL,*finish=NULL; /*定义三个队列,就绪队列,执行队列和完成队列*/
int num;
void GetFirst(); /*从就绪队列取得第一个节点*/
void Output(); /*输出队列信息*/
void InsertPrio(PCB *in); /*创建优先级队列,规定优先数越小,优先级越高*/
void PrioCreate(); /*优先级输入函数*/
void Priority(); /*按照优先级调度*/
int main()
{
printf("请输入要创建的进程数目:\n");
scanf("%d",&num);
getchar();
PrioCreate();
Priority();
Output();
return 0;
}
void GetFirst() /*取得第一个就绪队列节点*/
{
run = ready;
if(ready!=NULL)
{
run->state = 'R';
ready = ready->next;
run->next = NULL;
}
}
void Output() /*输出队列信息*/
{
PCB *p;
/*p = ready;*/
printf("进程名\t优先级\tcpu时间\t需要时间\t进程状态\t计数器\n");
p = ready;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->priority,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
p = finish;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->priority,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
p = run;
while(p!=NULL)
{
printf("%s\t%d\t%d\t%d\t\t%c\t\t%d\n",p->name,p->priority,p->cputime,p->needtime,p->state,p->count);
p = p->next;
}
}
void InsertPrio(PCB *in) /*创建优先级队列,规定优先数越小,优先级越低*/
{
PCB *fst,*nxt;
fst = nxt = ready;
if(ready == NULL) /*如果队列为空,则为第一个元素*/
{
in->next = ready;
ready = in;
}
else /*查到合适的位置进行插入*/
{
if(in->priority > fst->priority) /*比第一个还要大(大于等于),则插入到队头*/
{
in->next = ready;
ready = in;
}
else
{
while(fst->next != NULL) /*移动指针查找第一个别它小的元素的位置进行插入*/
{
nxt = fst;
fst = fst->next;
}
if(fst->next == NULL) /*已经搜索到队尾,则其优先级数最小,将其插入到队尾即可*/
{
in->next = fst->next;
fst->next = in;
}
else /*插入到队列中*/
{
nxt = in;
in->next = fst;
}
}
}
}
void InsertTime(PCB *in) /*将进程插入到就绪队列尾部*/
{
PCB *fst;
fst = ready;
if(ready == NULL)
{
in->next = ready;
ready = in;
}
else
{
while(fst->next != NULL)
{
fst = fst->next;
}
in->next = fst->next;
fst->next = in;
}
}
void InsertFinish(PCB *in) /*将进程插入到完成队列尾部*/
{
PCB *fst;
fst = finish;
if(finish == NULL)
{
in->next = finish;
finish = in;
}
else
{
while(fst->next != NULL)
{
fst = fst->next;
}
in->next = fst->next;
fst->next = in;
}
}
void PrioCreate() /*优先级调度输入函数*/
{
PCB *tmp;
int i;
printf("输入进程名字和进程所需时间:\n");
for(i = 0;i < num; i++)
{
if((tmp = (PCB *)malloc(sizeof(PCB)))==NULL)
{
perror("malloc");
exit(1);
}
scanf("%s",tmp->name);
getchar(); /*吸收回车符号*/
scanf("%d",&(tmp->needtime));
tmp->cputime = 0;
tmp->state ='W';
tmp->priority = 50 - tmp->needtime; /*设置其优先级,需要的时间越多,优先级越低*/
tmp->round = 0;
tmp->count = 0;
InsertPrio(tmp); /*按照优先级从高到低,插入到就绪队列*/
}
}
void Priority() /*按照优先级调度,每次执行一个时间片*/
{
int flag = 1;
GetFirst();
while(run != NULL) /*当就绪队列不为空时,则调度进程如执行队列执行*/
{
Output(); /*输出每次调度过程中各个节点的状态*/
while(flag)
{
run->priority -= 0; /*优先级减去三,若设为0则优先级不变*/
run->cputime++; /*CPU时间片加一*/
run->needtime--;/*进程执行完成的剩余时间减一*/
if(run->needtime == 0)/*如果进程执行完毕,将进程状态置为F,将其插入到完成队列*/
{
run->state = 'F';
run->count++; /*进程执行的次数加一*/
InsertFinish(run);
flag = 0;
}
else /*将进程状态置为W,入就绪队列*/
{
run->state = 'W';
run->count++; /*进程执行的次数加一*/
InsertTime(run);
flag = 0;
}
}
flag = 1;
GetFirst(); /*继续取就绪队列队头进程进入执行队列*/
}
}
以上就是这三个问题的主要内容了,希望对你有些帮助。