sperse
发表于 2025-3-28 16:59:31
An improved multiple identification algorithm for synchronous broadcasting networks,oblem, where each of the p processors has a bit-string of length n and wants to determine the subset of processors that have the same string as itself. They described an O(n log.p + p) algorithm where the processors do not use any algebraic operations. In this paper an improved version is given with
发生
发表于 2025-3-28 20:42:45
http://reply.papertrans.cn/29/2818/281713/281713_42.png
Glycogen
发表于 2025-3-29 00:48:26
Load balancing in a network of transputers,with other network members via its four high speed serial links. Communication and user application are programmed in OCCAM, a language designed to describe a system of concurrent processes. We present a method to solve combinatorial problems in parallel on a transputer network, i.e. we formulate a
鸵鸟
发表于 2025-3-29 04:51:34
http://reply.papertrans.cn/29/2818/281713/281713_44.png
虚度
发表于 2025-3-29 09:56:51
http://reply.papertrans.cn/29/2818/281713/281713_45.png
Synapse
发表于 2025-3-29 15:22:10
How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual excmessages and do not share memory. This algorithm does not require a logical clock, and supposes that nodes do not fail..The average number of messages required is in the order of Log(n), where n is the number of nodes..In this paper, the tools are presented for detecting the node failures, and the r
疏忽
发表于 2025-3-29 17:45:35
http://reply.papertrans.cn/29/2818/281713/281713_47.png
嘲弄
发表于 2025-3-29 20:42:16
http://reply.papertrans.cn/29/2818/281713/281713_48.png
Offstage
发表于 2025-3-30 02:26:16
http://reply.papertrans.cn/29/2818/281713/281713_49.png
侵害
发表于 2025-3-30 06:00:25
http://reply.papertrans.cn/29/2818/281713/281713_50.png