Deadlock prevention in distributed object oriented systems

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a deadlock prevention algorithm for Distributed Object Oriented Systems (DOOS) 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. In this paper a resource ordering technique based on semantics of the object relationships like inheritance, aggregation and association is proposed. A formal model of the resource ordering technique is defined using predicate calculus. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Geetha, V., & Sreenath, N. (2011). Deadlock prevention in distributed object oriented systems. In Communications in Computer and Information Science (Vol. 191 CCIS, pp. 48–57). https://doi.org/10.1007/978-3-642-22714-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free