版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:NYUCOURANT INST MATH SCINEW YORKNY 10012
出 版 物:《SIAM JOURNAL ON COMPUTING》 (工业与应用数学会计算杂志)
年 卷 期:1985年第14卷第1期
页 面:75-92页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:distributed networks communicating sequential processes handshake communication synchronization real-time response probabilistic choice randomized algorithms
摘 要:This paper concerns the fundamental problem of synchronizing communication between distributed processes whose speeds (steps per time unit) vary dynamically. Communication must be established in matching pairs, which are mutually willing to communicate. We show how to implement a distributed local scheduler to find these pairs. The only means of synchronization are boolean “flag variables, each of which can be written by only one process and read by at most one other process.