文件名称:DLogicalClocks
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:4.87kb
-
已下载:0次
-
提 供 者:
-
相关连接:无
-
下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Distributed Logical clocks.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.-Distributed Logical clocks.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.-Distributed Logical clocks.
Code will spawn n (distributed) processes Pi, 0 ≤ i < n, each one looping forever.
Each loop iteration is a loop interval and its duration can be set to 1 second. In every loop
interval Pi does the following:
− If there is a message m pending to be received it receives m
− Otherwise
o It does an internal action with probability 0.80
o It sends a message to process Pj, 0 ≤ j < n and j ≠ i with probability 0.20.
The message gets delayed at its source for a random amount of time < 2 sec
to simulate network delay.
− It calculates and prints its logical clock value along with the action it takes.
Note: several messages may arrive in a process within a loop interval. In such a case they
will be queued and delivered to the process in subsequent loop intervals.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
src/Configuration/config.cfg
src/IncMsgHandler.java
src/InitThread.java
src/Message.java
src/OutMsgHandler.java
src/ProcLClock.java
src/Queue.java
src/SPair.java
src/Configuration
src
src/IncMsgHandler.java
src/InitThread.java
src/Message.java
src/OutMsgHandler.java
src/ProcLClock.java
src/Queue.java
src/SPair.java
src/Configuration
src