THE CONVERSATION DEADLOCK PROBLEM IN CLIENT-SERVER MODEL

Different problems have to be solved for an effective use of conversations as a mean to improve the overall reliabilty of a concurrent program. In this paper we address the so called Deserter Process Problem. We investigate the causes which generate deserter processes, distinguishing between the case in which a process does not enter a conversation and the case in which a process does not reach the acceptance test line. The first case is related with a particular type of deadlocks. A model of concurrent programs with conversations, and conditions, which are useful to detect deadlocks in these programs, are presented.