Synchronization and computing capabilities of linear asynchronous structures
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science(1975)
摘要
A model is defined in which questions concerning delay bounded asynchronous parallel systems may be investigated. Persistence and determinacy are introduced for this model. These two conditions are shown to be sufficient to guarantee that a synchronous execution policy can be relaxed to an asynchronous execution policy with no change to the result of the computation. In addition, the asynchronous execution time is only (D+1) times the synchronous execution time, where D is the delay bound. A wide class of recognition problems is identified which can be solved by linear asynchronous structures. Also, it is shown that synchronization problems, similar to the "firing squad synchronization problem," cannot be solved by delay bounded asynchronous systems.
更多查看译文
关键词
asynchronous execution policy,asynchronous execution time,asynchronous parallel system,asynchronous system,linear asynchronous structure,synchronous execution policy,synchronous execution time,squad synchronization problem,synchronization problem,recognition problem,computing capability
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要