






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Various methods for locating entities in distributed systems, including home-based approaches, hierarchical location services, and unreferenced objects. It also explores the challenges of reference counting and proposes solutions. The document also touches upon the concept of leases and tracing in groups.
Typology: Study notes
1 / 10
This page cannot be seen from the preview
Don't miss anything!
Simple Solutions for Locating Entities Broadcasting : Simply broadcast the ID, requesting the entity to return its current address. •Can never scale beyond local-area networks (think of ARP/RARP) •Requires all processes to listen to incoming location requests Forwarding pointers : Each time an entity moves, it leaves behind a pointer telling where it has gone to. •Dereferencing can be made entirely transparent to clients by simple following the chain of pointers •Update a client’s reference as soon as present location has been found •Geographical scalability problems: –Long chains are not fault tolerant –Increased network latency at dereferencing Essential to have separate chain reduction mechanisms Home-Based Approaches ( 1 / 2 ) Single-tiered scheme : Let a home keep track of where the entity is:
Home-Based Approaches ( 2 / 2 ) Two-tiered scheme : Keep track of visiting entities:
HLS: Invalidate Cache Caching a reference to a directory node of the lowest- level domain in which an entity will reside most of the time. HLS: Scalability Issues Size scalability : Again, we have a problem of over-loading higher-level nodes:
Unreferenced Objects: Problem Assumption : Objects may exist only if they can be contacted:
Advanced Referencing Counting ( 2 ) Weight assignment when copying a reference Advanced Referencing Counting ( 3 ) Creating an indirection when the partial weight of a reference has reached 1
Advanced Referencing ( 4 ) Creating and copying a remote reference in generation reference counting Reference Listing Observation : We can avoid many problems if we can tolerate message loss and duplication Reference listing : Let an object keep a list of its clients:
Tracing in Groups ( 2 ) After local propagation in each process. Tracing in Groups ( 3 ) Final Marking