东北大学操作系统实验报告

计算机科学与工程学院实验报告实验课程名称操作系统实验实验成绩专业计算机科学与技术班级1507班指导教师签字学号20154377姓名罗艺博实验报告批改时间实验项目目录1. 实验一 熟悉Linux系统2. 实验二 进程状态3. 实验三 进程同步和通信4. 实验四 进程的管道通信5. 实验五 页面置换算法实验报告正文实验一 熟悉Linux系统一、 实验目的熟悉和掌握Linux系统基本命令，熟悉Linux编程环境，为以后的实验打下基础。二、 实验原理基于linux系统的基础操作三、 实验内容（源码、注释、基础内容、扩展点等）启动、退出、ls（显示目录内容）、cp（文件或目录的复制）、mv（文件、目录更名或移动）、rm（删除文件或目录）、mkdir（创建目录）、rmdir（删除空目录）、cd（改变工作目录）C语言编辑、编译四、 实验结果（截图）ls mkdir:cd:rmdir:实验二 进程状态一、 实验目的自行编制模拟程序，通过形象化的状态显示，使学生理解进程的概念、进程之间的状态转换及其所带来的PCB内容 、组织的变化，理解进程与其PCB间的一一对应关系。二、 实验原理1.进程在内存中存在三种基本状态：就绪态、执行态、阻塞态2.三种状态在满足某种条件时会发生转换：就绪运行：调度程序选择一个新的进程运行运行就绪：运行进程用完了时间片运行进程被中断，因为一高优先级进程处于就绪状态运行阻塞：当一进程等待某一事件的发生时，如请求系统服务； 初始化I/O 且必须等待结果； 无新工作可做； 等待某一进程提供输入 (IPC)阻塞就绪：当所等待的事件发生时三、 实验内容（源码、注释、基础内容、扩展点等）#include #include #include #include /for sort in vectorusing namespace std;class Pro /process classpublic: char name; string status;vector ru,re,bl; /ru-running,re-ready,bl-blocked/function declarationint helloUI();int iniQ();int showPCB();int ruTOre();int ruTObl();int blTOre();int neTOre();int ruTOex();int helloUI() /start UI cout Hello!Welcome to come back. endl; cout #*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*#*# endl; cout endl; cout endl; return 0;int iniQ() /initialize the process int i; cout Please enter processes names and their status. endl; cout endl; for(i=0; i5; i+) /15 process a to o Pro process; char nam; string sta; cout Please enter i processes names. nam; = nam; cout Please enter processes status. endl; cout Status contains r1(running),r2(ready) and b(blocked). sta; process.status = sta; if(sta = r1) /judge which status if(ru.size()1) ru.push_back(process); cout yes endl; else cout Error! endl; else if(sta = r2) re.push_back(process); else if(sta = b) bl.push_back(process); else cout Error! endl; cout endl; cout endl; showPCB(); return 0;int showPCB() int i; cout running:; for(i=0; iru.size(); i+) cout ,; cout endl; cout ready:; for(i=0; ire.size(); i+) cout ,; cout endl; cout blocked:; for(i=0; ibl.size(); i+) cout ,; cout endl; return 0;int ruTOre() if(!ru.empty() /runningQueue is being used. re.push_back(ru.front(); /runnings first process go to readylast ru.erase(ru.begin(); /delete runnings first process ru.push_back(re.front(); re.erase(re.begin(); else cout Error in ruTOre endl; showPCB(); return 0;int ruTObl() if(!ru.empty() /runningQueue is being used. bl.push_back(ru.front(); ru.erase(ru.begin(); if(!re.empty() ru.push_back(re.front(); re.erase(re.begin(); else cout Error in ruTObl1. endl; else cout Error in ruTObl2. running ru.push_back(re.front(); re.erase(re.begin(); else cout Error in blTOre endl; showPCB(); return 0;int neTOre() int i; cout Please enter processes names and their status. endl; cout endl; Pro process; char nam; string sta; cout Please enter processes names. nam; = nam; process.status = r2; re.push_back(process); cout endl; cout endl; if(ru.empty() ru.push_back(re.front(); re.erase(re.begin(); showPCB(); return 0;int ruTOex() if(!ru.empty() /runningQueue is being used. ru.erase(ru.begin(); if(!re.empty() ru.push_back(re.front(); re.erase(re.begin(); else cout Error in ruTOex1. endl; else cout Error in ruTOex2. endl; showPCB(); return 0;int main() int act; /choose action helloUI(); cout Please initialize the process. endl; iniQ(); while(1) cout endl; cout Please select the action to take. endl; cout ready endl; cout blocked endl; cout ready endl; cout ready endl; cout exit act; if(act = 2) ruTOre(); else if(act = 3) ruTObl(); else if(act = 4) blTOre(); else if(act = 5) neTOre(); else if(act = 6) ruTOex(); else cout Error in select.endl; cout # endl; cout endl; return 0;拓展点：五状态模型四、 实验结果（截图）创建进程：状态 runningready：状态 runningblocked：状态 blockedready：创建新进程：情况一 有进程正在运行情况二 无进程正在运行终止进程：实验三 进程同步和通信一、实验目的调试、修改、运行模拟程序，通过形象化的状态显示，使学生理解进程的概念，了解同步和通信的过程，掌握进程通信和同步的机制，特别是利用缓冲区进行同步和通信的过程。通过补充新功能，使学生能灵活运用相关知识，培养创新能力。二、 实验原理假定.缓冲区可以容纳8个数据；因为缓冲区是有限的，因此当其满了时生产者进程应该等待；当消费者取走一个数据后，应唤醒正在等待的生产者进程；当缓冲区空时，消费者进程应该等待；当生产者向缓冲区放入了一个数据时，应唤醒正在等待的消费者进程。这就是生产者和消费者之间的同步三、 实验内容（源码、注释、基础内容、扩展点等）基础内容:编写程序使其模拟两个进程，即生产者（producer）进程和消费者(Consumer)进程工作；生产者每次产生一个数据，送入缓冲区中；消费者每次从缓冲区中取走一个数据。每次写入和读出数据时，都将读和写指针加一。当指针到达缓冲区尾，重新将指针退回起点；/*/* PROGRAM NAME: PRODUCER_CONSUMER */* This program simulates two processes, producer which */* continues to produce message and put it into a buffer */* implemented by PIPE, and consumer which continues to get */* message from the buffer and use it. */* The program also demonstrates the synchronism between */* processes and uses of PIPE. */*/#include #include /#include #define PIPESIZE 8#define PRODUCER 0#define CONSUMER 1#define RUN 0 /* statu of process */#define WAIT 1 /* statu of process */#define READY 2 /* statu of process */#define NORMAL 0#define SLEEP 1#define AWAKE 2#include /Process Control block struct pcb char *name; int statu; int time; ; /* times of execution */ /Buffer struct pipetype char type; /type int writeptr; /Write pointer int readptr; /Read pointer struct pcb *pointp; /* write wait point */ struct pcb *pointc; ; /* read wait point */ int pipePIPESIZE; /Buffer array struct pipetype pipetb; struct pcb process2; /number of producer - number of consumer,buffer. count = 8:too many prodecers; number of times, ret-present status char in2; int runp(),runc(),prn(); pipetb.type = c; pipetb.writeptr = 0; pipetb.readptr = 0; pipetb.pointp = pipetb.pointc = NULL; processPRODUCER.name = Producer0; processCONSUMER.name = Consumer0; processPRODUCER.statu = processCONSUMER.statu = READY; processPRODUCER.time = processCONSUMER.time = 0; output = 0;printf(Now starting the program!n); printf( Press p1 to run PRODUCER1, press p2 to run PRODUCER2.n press c to run CONSUMER.n); /PRODUCER1-product 1 new data, PRODUCER2-product 2 new data printf( Press e to exit from the program.n); for(i=0;i1000;i+)in0=N; while(in0=N)scanf(%s,in); if(in0!=e&in0!=p&in0!=c) /when not p,c,e continuein0=N; if(in0=p&processPRODUCER.statu=READY) /producer and ready if(in1 = 2) /producer2 int m; for(m=0;m 3) /the number of waitting producer over 4,waitqueue=4 printf(wrong!n); continue; if(countstatu=READY; runc(process,pipe,&pipetb,CONSUMER); countr-; printf(countr=%dn,countr); if(countr=0) pipetb.pointc=NULL; else if(in1 = 1) /producer1 if(countp 3) printf(wrong!n); continue; if(countstatu=READY; runc(process,pipe,&pipetb,CONSUMER); countr-; printf(countr=%dn,countr); if(countr=0)pipetb.pointc=NULL; if(in0=c&processCONSUMER.statu=READY) /consumer and readyif(ret=runc(process,pipe,&pipetb,CONSUMER)=SLEEP) /sleeppipetb.pointc = &processCONSUMER; if(ret=AWAKE) /awake(pipetb.pointp)-statu=READY;output=(output+1)%100; runp(output,process,pipe,&pipetb,PRODUCER);countp-;printf(countp=%dn,countp);if(countp=0)pipetb.pointp=NULL;if(in0=p&processPRODUCER.statu=WAIT) /producer and wait if(in1 = 2) /producer2 int m; for(m=0;m 3) printf(wrong!n); printf(PRODUCER is waiting, cant be scheduled.n); continue; countp+; printf(countp=%dn,countp); else if(in1 = 1) /producer1 if(countp 3) printf(wrong!n); printf(PRODUCER is waiting, cant be scheduled.n); continue; countp+; printf(countp=%dn,countp); printf(Look out.n);/printf(PRODUCER is waiting, cant be scheduled.n); if(in0=c&processCONSUMER.statu=WAIT) /consumer and wait if(countr 3) printf(wrong!n); printf(CONSUMER is waiting, cant be scheduled.n); continue; countr+;printf(countr=%dn,countr);printf(Look out!n); /printf(CONSUMER is waiting, cant be scheduled.n); if(in0=e) exit(1); prn(process,pipe,pipetb); in0=N; runp(out,p,pipe,tb,t) /* run producer */ int out,pipe,t; struct pcb p; struct pipetype *tb; pt.statu=RUN; printf(run PRODUCER. product %d ,out); if(count=8) /buffer over 8 pt.statu=WAIT; return(SLEEP); tb-writeptr=tb-writeptr%8; /only has 01234567 pipetb-writeptr=out; /change tb-writeptr+; printf(writeptr%dn,tb-writeptr); count+; printf(count=%dn,count); pt.time+; /printf(time+%dn,pt.time); pt.statu=READY; if(tb-pointc)!=NULL) /printf(返回AWAKE); return(AWAKE); return(NORMAL); runc(p,pipe,tb,t) /* run consumer */ int pipe,t; struct pcb p; struct pipetype *tb; int c; pt.statu = RUN; printf(run CONSUMER. ); if(countreadptr; pipetb-readptr=0; tb-readptr+; tb-readptr=tb-readptr%8; printf(readptr=%dn,tb-readptr); printf( use %d ,c); count-; printf(count=%dn,count); pt.time+; /printf(time+%dn,pt.time); pt.statu=READY; if(tb-pointp!=NULL) /printf(返回AWAKEn); return(AWAKE); return(NORMAL); prn(p,pipe,tb) int pipe; struct pipetype tb; struct pcb p; int i; printf(n ); for(i=0;iPIPESIZE;i+) printf(- ); printf(n |);for(i=0;iPIPESIZE;i+) /pipe insideif(pipei!=0) /pipei has somethingprintf( %2d |,pipei);elseprintf( |); printf(n ); for(i=0;i=1) /number of producer =1 printf(%d PRODUCER wait ,countp); else printf(PRODUCER ready ); if(pCONSUMER.statu=WAIT)|countr=1) printf(%d CONSUMER wait ,countr); else printf(CONSUMER ready ); printf(n); printf(n#n); 拓展点：设置了等待队列的长度，并显示等待队列内部情况四、 实验结果（截图）生产者：情况一 正常生产情况二 超过缓冲区情况三 超过等待队列消费者：情况一 正常情况二 无产品可消费又开始生产：实验四 进程的管道通信一、 实验目的加深对进程概念的理解，明确进程和程序的区别；学习进程创建的过程，进一步认识并发执行的实质；分析进程争用资源的现象，学习解决进程互斥的方法；学习解决进程同步的方法；掌握Linux系统进程间通过管道通信的具体实现方法。二、 实验原理1.基本概念：进程的概念；进程与程序的区别；并发执行的概念进程互斥的概念；进程通信的基本原理2.系统调用：设置系统调用号：设置多条系统调用命令，并赋予每条系统调用命令一个唯一的系统调用号处理系统调用：OS中有一张系统调用入口表，表中每个表目对应一条系统调用命令，包含该系统调用自带参数的数目、系统调用命令处理程序的入口地址等。OS内核便是根据所输入的系统调用号在该表中查找到相应的系统调用，进而转入它的入口地址去执行系统调用程序。Linux的系统调用机制：通过中断机制实现三、 实验内容（源码、注释、基础内容、扩展点等）#include #include #include #include #include int main() int pid1,pid2,pid3; int fd2; char outpipe50,inpipe50; pipe(fd); while (pid1=fork() = -1); if(pid1 = 0) printf(s1n); lockf(fd1,1,0);/ printf(s11n); sprintf(outpipe,I am the 1st!); write(fd1,outpipe,50); sleep(3); lockf(fd1,0,0); /sleep(2); exit(0); else while(pid2=fork() = -1); if(pid2 = 0) printf(s2n);/ if(pid1 != 0)/ wait(0);/ printf(s22n); lockf(fd1,1,0); /printf(f1); sprintf(outpipe,I am the 2nd!); write(fd1,outpipe,50); sleep(2); lockf(fd1,0,0); /sleep(2); exit(0); else while(pid3=fork() = -1); if (pid3 = 0) printf(s3n); lockf(fd1,1,0); sprintf(outpipe,I am the 3rd!); write(fd1,outpipe,50); sleep(2); lockf(fd1,0,0); exit(0); else wait(0); read(fd0,inpipe,50); printf(%s n,inpipe);/ printf(f1); wait(0); read(fd0,inpipe,50);/ printf(f2); printf(%s n,inpipe); wait(0); read(fd0,inpipe,50); printf(%s n,inpip