Avoidance of deadlock in loop structures—a two process solution
P Pramanik, PK Das, AK Bandyopadhyay… - Microprocessing and …, 1992 - Elsevier
… In this paper we describe a new system using a set of only two processes per node for
achieving this. The system remains free of deadlock in spite of random message generation at
each of the nodes. The system has been modelled using the technique described in [4]. … We
propose here an identical configuratio,t of two processes in each node of a loop connected
architecture. The communication system consists of a receiver (R). and a sender iS}, A third …
achieving this. The system remains free of deadlock in spite of random message generation at
each of the nodes. The system has been modelled using the technique described in [4]. … We
propose here an identical configuratio,t of two processes in each node of a loop connected
architecture. The communication system consists of a receiver (R). and a sender iS}, A third …
以上显示的是最相近的搜索结果。 查看全部搜索结果