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

ASP.NET
Asp.net 时间操作基类(支持短日期,长日期,时间差)
asp.net 获取机器硬件信息(cpu频率、磁盘可用空间、内存容量等)
asp.net 数据库备份还原(sqlserver+access)
Asp.Net 数据操作类(附通用数据基类)
Asp.net 弹出对话框基类(输出alet警告框)
Asp.net 文件上传类(取得文件后缀名,保存文件,加入文字水印)
Asp.net Socket客户端(远程发送和接收数据)
Asp.net 字符串操作基类(安全,替换,分解等)
Asp.Net数据输出到EXCEL表格中
asp.net Gridview里添加汇总行
asp.net UpdatePanel的简单用法
asp.net ajaxControlToolkit FilteredTextBoxExtender的简单用法
this connector is disabled错误的解决方法
sql事务应用积累
asp.net Page.Controls对象(找到所有服务器控件)
在asp.NET中字符串替换的五种方法
ASP.NET缓存方法分析和实践示例代码
asp.net 在DNN模块开发中遇到的resx怪问题
ASP.NET State service状态服务的问题解决方法
asp.net 结合mysql存储过程进行分页代码

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


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