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

ASP.NET
.Net技术开发中两个“属性”引起的歧异
技术文档:解读.Net虚拟框架的实现原理
.Net课堂:总结必须学习的10项.NET技术
实现MSMQ消息加密的安全实践
C#中对DatagridView的部分常用操作
.Net基础:了解ASP.NET中的IFRAME框架挂马
ASP.NET中显示Linq To SQL输出的SQL语句
链表的顺序表示和实现(C++模板类实现)
如何在ASP.NET项目里面正确使用Linq to Sql
ASP.NET两个截取字符串的实用方法技巧
一个简单程序的反编译
ASP.NET MVC中你必须知道的13个扩展点
Entity Framework的默认值BUG解决方法
C#中通过Assembly类访问程序集信息
Java与.NET间进行Web Service交互的选择
C#中用鼠标移动页面功能的实现
程序员的信仰
ASP.NET多附件上传和附件编辑的实现
菜鸟课堂:在Visual C# .NET中跟踪和调试
IronPython和C#执行速度对比

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


出处:互联网   整理: 软晨网(RuanChen.com)   发布: 2009-11-03   浏览: 123 ::
收藏到网摘: 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");: : }