异步共享存储器互斥算法的研究与实现  

Research and implementation of Mutex algorithm in distributed shared memory

作　　者：陈仲民[1] 王飞[2] 

机构地区：[1]东南大学计算机科学系,江苏南京210096 [2]华中农业大学计算机科学系,湖北武汉430070

出　　处：《计算机工程与设计》2007年第11期2527-2529,2536,共4页Computer Engineering and Design

摘　　要：异步共享存储器是分布式计算系统的一个应用,它的出现使大规模的科学计算和存储成为可能。异步共享存储器算法要解决的前提问题是异步进程的互斥,资源的分配,一致性和原子对象。进程间的互斥保证各个进程访问单个非共享资源时的正确性和完整性。一致性则要分析故障可能性这个复杂的问题。原子对象指资源被几个不同的进程同时访问而不发生错误。对上述问题进行了分析,在此基础上重点讨论了几种互斥算法,并且在SunOS5．9Unix系统下模拟实现了互斥算法．The distributed shared memory （DSM） is an application of distributed computing system, it makes large scale scientific computation and storage possible. The problem that DSM should be solved in advance is the Mutex ofasynchronous processes, allocation of resource, coherence and atomic object, The Mutex between processes ensure the correctness and integrality of each process accessing to single non-shared resource. Coherence need analyzing malfunction possibility which is a very complex problem. The atomic object mean that no error occur when several process access resources at the same time. Such problems are analyzed, some Mutex algorithms are discussed, and the implementation in Sun Unix operating system is given.

关 键 词：异步共享存储器 资源 进程 互斥 实现 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]