Preventing deadlocks and starvation in distributed object oriented systems

This paper proposes a deadlock prevention algorithm for distributed object oriented systems based on the popular resource ordering technique. In distributed object oriented system, objects are the resources requested by the transactions. Though resource-ordering technique is not new, novelty of the proposed deadlock prevention algorithm lies in exploiting the relationships among objects present in the domain to do the resource ordering. Resource ordering rules are formally represented using predicate calculus. This algorithm also addresses the elimination of starvation in wealth and starvation in poverty by proposing a combination of timestamp and expedient access ordering of transactions in accessing the resources.

Figure optionsDownload as PowerPoint slideHighlights
► A deadlock prevention algorithm for distributed object oriented system.
► A resource ordering technique is proposed to prevent deadlocks for objects.
► The resource ordering is based on the relationships with other objects.
► The technique is formally defined using predicate calculus.
► Access ordering rules are specified for eliminating starvation.