当前位置: 首页 > 图文教程 > 网络编程 > ASP.NET > 算法讨论:哲学家就餐问题

ASP.NET
探讨:ASP.NET技术的学习顺序问题
关于ASP.NET在IIS一些问题的经验总结
ASP.NET中通过对话框方式下载文件
ASP.NET网络编程中常用到的27个函数集
ASP.NET生成静态网页的方法
ASP.NET 2.0中实现弹窗报警提示
复杂ASP.NET服务器控件调整小技巧
ASP.NET调用oracle存储过程实现快速分页
VB.NET实现窗体图标最小化到状态栏
ASP.NET技巧:DataGrid传统分页方式
ASP.NET里的事务处理
ASP.NET 2.0高级数据处理之数据绑定
ASP.NET多频道网站架构实现方法
.NET vs J2EE——面对SOA的荒谬与误解
ASP.NET 2.0中执行数据库操作命令之一
ASP.NET应用程序资源访问安全模型
ASP.NET 2.0中的Web和HTML服务器控件
对.NET Framework 反射的反思
带你走进ASP.NET(1)
带你走进ASP.NET(2)

ASP.NET 中的 算法讨论:哲学家就餐问题


出处:互联网   整理: 软晨网(RuanChen.com)   发布: 2009-11-03   浏览: 45 ::
收藏到网摘: n/a

In 1965, Dijkstra posed and solved a synchronization problem he called thedining philosophers problem. ........ The problem can be stated quite simplyas follows. Five philosophers are seated around a circular table. Each philosopher has a plate of spaghetti. The spaghetti is so slippery that a philosopher needs two forks to eat it. Between each pair of plates is one fork. The life of a philosopher consists of alternate periods of eating and thinking. When a philosopher gets hungry, she tries to acquire her left and rightfork, one at a time, in either order. If successful in acquiring two forks,she eats for a while, then puts down the forks and continues to think. Thekey question is: Can you write a program for each philosopher that does what it is supposed to do and never gets stuck? --from written by Andrew S. Tanenbaum typed by foolball :-PProgramme provided by ya: : 法一: 用公共文件,按照严格轮流执行: : #include : : #include : : #include : : #include : : #define N 5: : int i,j,t,status;: : FILE * f;: : char *state[N];: : main(): : {: : f=fopen("/share","w+");: : putc(j,f);: : if (fork()): : { if (fork()): : { if (fork()): : { if (fork()): : { if (fork()): : {waitpid(-1,*status,0);: : fclose(f);}: : else : : philosophy(4);}: : else: : philosophy(3);}: : else: : philosophy(2);}: : else: : philosophy(1);}: : else: : philosophy(0);: : }: : void philosophy(int i): : {: : state[i ="thinking";: : printf("%d%s\n",i,"is thinking");: : for(t=0;t<=rand()+10000;t++);: : state[i = : : printf("%d%s\n",i,"is hungry");: : for(t=0;t<=rand()+10000;t++);: : for(;i!=j;): : {fseek(f,0l,0);: : j=getc(f);} : : state[i ="eating";: : printf("%d%s\n",i,"is eating");: : j=(j+1)% N: : fseek(f,0l,0);: : putc(j,f);: : }: : 法二:通过文件加锁实现: : #include : : #include : : #define N 4: : FILE *f;: : int i, status;: : char *state[N];: : void philosofy(int i);: : void main(): : {: : if ((f=fopen("turn", "w+"))==NULL): : {: : printf("Cann't open this file"); : : exit(0);: : }: : if (fork()): : {: : if(fork()): : {: : if(fork()): : {: : if(fork()): : {: : if(fork()): : {: : waitpid(-1, &status, 0);: : fclose(f);: : }: : else: : philosofy(4);: : }: : else: : philosofy(3);: : }: : else : : philosofy(2);: : }: : else: : philosofy(1);: : }: : else: : philosofy(0);: : }//end of main: : void philosophy(int i): : { int t;: : state[i ="thinking";: : printf("%d%s\n",i,"is thinking");: : for(t=0;t<=rand()+10000;t++);: : state[i ="hungry";: : printf("%d%s\n",i,"is hungry");: : for(t=0;t<=rand()+10000;t++);: : while ((f=fopen("turn.lock","r"))!=NULL);: : link ("turn","turn.lock");: : state[i ="eating"; : : printf("%d%s\n",i," is eating");: : for(t=1; t<=10000+rand();t++) ;: : unlink ("turn");: : }