首页   按字顺浏览 期刊浏览 卷期浏览 EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS

 

作者: JOSYULAR. RAO,  

 

期刊: Parallel Algorithms and Applications  (Taylor Available online 1996)
卷期: Volume 8, issue 1  

页码: 3-19

 

ISSN:1063-7192

 

年代: 1996

 

DOI:10.1080/10637199608915541

 

出版商: Taylor & Francis Group

 

关键词: Probabilistic;deterministic;eventual determinism;symmetry;dining philosophers;Lehmann-Rabin;Chandy-Misra;self-stabilization;D.1.3;G.3

 

数据来源: Taylor

 

摘要:

We introduce a new paradigm For Ihc design of parallel algorithms called eventual determinism. In an eventualfy-determinizing algorithm, all processes execute identical programs from identical starting states. A program has two parts (also called modes) —probabilistic and deterministic. A process begins execution in the probabilistic mode and eventually (with probability one) switches to a deterministic mode. The decision to switch is taken independently by each process. This means that it is possible for different processes to be executing in different modes at the same time. It is possible that a process may change back to the probabilistic mode but it is required that eventually, each process should switch and stay in the deterministic mode. Thus determinacy pervades the system.

 

点击下载:  PDF (298KB)



返 回