Distributed Simulation of Networks
暂无分享,去创建一个
Abstract A potentially valuable attribute of message switched networks is that all processors in the network can cooperate in solving a common problem. This attribute has not recieved sufficient attention in the literature probably because it is hard to partition most programs into processes which communicate exclusively by exchanging messages. The problem of partitioningng programs and assigning them to processors in message switched systems becomes acute when programs appear to be inherently sequential. In this paper we use a message switched network to solve a problem that has always been solved in a highly sequential fashion. The specific problem that is studied is discrete-event simulation though key concepts can be extended to other areas of message-switched problem-solving. There are no shared variables in message switched networks. The shared variable “clock” typically used in simulation algorithms, does not appear in the proposed scheme; instead each process maintains an internal clock that is not usually synchronized with clocks of other processes. The case where the network is a tandem of servers is considered in detail in this paper. The core ideas reported here were significantly developed and radically extended by a group at the University of Waterloo under the direction of Professors Manning and Wong.
[1] K. Mani Chandy,et al. A nontrivial example of concurrent processing: Distributed simulation , 1978, COMPSAC.
[2] Eric G. Manning,et al. Distributed Simulation Using a Network of Processors , 1979, Comput. Networks.
[3] Eric G. Manning,et al. Distributed Simulation Using a Network of Microcomputers , 1978, Berkeley Workshop.