操作系统实验报告实验2： #include #include #include int pid1,pid2; int EndFlag=0; int pf1=0; int pf2=0; void IntDelete() { kill(pid1,16); kill(pid2,17); EndFlag=1; } void Int1() { printf("child process 1 is killed !by parent\n"); exit(0); } void Int2() { printf("child process 2 is killed !by parent\n"); exit(0); } main() { int exitpid; signal(SIGINT,SIG_IGN); signal(SIGQUIT,SIG_IGN); if(pid1=fork()) { signal(SIGUSR1,Int1); signal(SIGINT,SIG_IGN); pause(); exit(0); } else { if(pid2=fork()) { signal(SIGUSR1,Int1); signal(SIGINT,SIG_IGN); pause(); exit(0); } else { signal(SIGINT,IntDelete); waitpid(-1,&exitpid,0); printf("parent process is killed\n"); exit(0); } } } 程序运行结果： parent process is killed 结论：由于忽略了中断与退出信号，程序会一直保持阻塞状态而无法退出。实验3： #include #include #include #include #include #include #include #define SHMKEY 75 /*定义共享区关键词*/ int shmid,i; int *addr; int CLIENT() { int i; shmid=shmget(SHMKEY,1024,0777); /*获取共享区，长度1024，关键词SHMKEY*/ addr=shmat(shmid,0,0); /*共享区起始地址为addr*/ for(i=9;i>=0;i--) { while(*addr!= -1); printf("(client)sent\n"); /*打印（client）sent*/ *addr=i; /*把i赋给addr*/ } exit(0); } int SERVER() { shmid=shmget(SHMKEY,1024,0777|IPC_CREAT); /*创建共享区*/ addr=shmat(shmid,0,0); /*共享区起始地址为addr*/ do { *addr=-1; while(*addr==-1); printf("(server)received\n"); /*服务进程使用共享区*/ } while(*addr); shmctl(shmid,IPC_RMID,0); exit(0); } int main() { if(fork())SERVER(); if(fork())CLIENT(); wait(0); wait(0); } 程序运行结果：每当client发送一次数据后，server要等大约0.1秒才有响应。同样，之后client又需要等待大约0.1秒才发送下一个数据。结论：出现上述的应答延迟的现象是程序设计的问题。当client端发送了数据后，并没有任何措施通知server端数据已经发出，需要由client的查询才能感知。此时，client端并没有放弃系统的控制权，仍然占用CPU的时间片。只有当系统进行调度时，切换到了server进程，再进行应答。实验4： #include #include #include #define TRUE 1 #define FALSE 0 #define INVALID -1 #define NUL 0 #define total_instruction 320 /*指令流长*/ #define total_vp 32 /*虚页长*/ #define clear_period 50 /*清零周期*/ typedef struct{ /*页面结构*/ int pn,pfn,counter,time; }pl_type; pl_type pl[total_vp]; /*页面结构数组*/ struct pfc_struct{ /*页面控制结构*/ int pn,pfn; struct pfc_struct *next; }; typedef struct pfc_struct pfc_type; pfc_type pfc[total_vp],*freepf_head,*busypf_head,*busypf_tail; int diseffect,a[total_instruction]; int page[total_instruction], offset[total_instruction]; void initialize(); void FIFO(); void LRU(); void OPT(); void LFU(); void NUR(); int main() { int S,i; srand((int)getpid()); S=(int)rand()%390; for(i=0;inext; pl[busypf_head->pn].pfn=INVALID; /*释放忙页面队列中的第一个页面*/ freepf_head=busypf_head; freepf_head->next=NUL; busypf_head=p; } p=freepf_head->next; /*按方式调新页面入内存页面*/ freepf_head->next=NUL; freepf_head->pn=page[i]; pl[page[i]].pfn=freepf_head->pfn; if(busypf_tail==NUL) busypf_head=busypf_tail=freepf_head; else { busypf_tail->next=freepf_head; busypf_tail=freepf_head; } freepf_head=p; } } printf("FIFO:%6.4F",1-(float)diseffect/320); } void LRU(total_pf) int total_pf; { int min,minj,i,j,present_time; initialize(total_pf);present_time=0; for(i=0;ipl[j].time&&pl[j].pfn!=INVALID) { min=pl[j].time; minj=j; } freepf_head=&pfc[pl[minj].pfn]; pl[minj].pfn=INVALID; pl[minj].time=-1; freepf_head->next=NUL; } pl[page[i]].pfn=freepf_head->pfn; pl[page[i]].time=present_time; freepf_head=freepf_head->next; } else pl[page[i]].time=present_time; present_time++; } printf("LRU:%6.4f",1-(float)diseffect/320); } void NUR(total_pf) int total_pf; { int i,j,dp,cont_flag,old_dp; pfc_type *t; initialize(total_pf); dp=0; for(i=0;inext=NUL; } pl[page[i]].pfn=freepf_head->pfn; freepf_head=freepf_head->next; } else pl[page[i]].counter=1; if(i%clear_period==0) for(j=0;jnext=NUL; pl[maxpage].pfn=INVALID; } pl[page[i]].pfn=freepf_head->pfn; freepf_head=freepf_head->next; } } printf("OPT:%6.4f",1-(float)diseffect/320); } void LFU(total_pf) /*LFU(leat Frequently Used) ALGORITHM*/ int total_pf; { int i,j,min,minpage; pfc_type *t; initialize(total_pf); for(i=0;ipl[j].counter&&pl[j].pfn!=INVALID) { min=pl[j].counter; minpage=j; } pl[j].counter=0; } freepf_head=&pfc[pl[minpage].pfn]; pl[minpage].pfn=INVALID; freepf_head->next=NUL; } pl[page[i]].pfn=freepf_head->pfn; freepf_head=freepf_head->next; } else pl[page[i]].counter++; } printf("LFU:%6.4f",1-(float)diseffect/320); } void initialize(total_pf) /*初始化相关数据结构*/ int total_pf; /*用户进程的内存页面数*/ { int i; diseffect=0; for(i=0;i

“操作系统实验”实验报告