.png){kind=icon}
.png){kind=icon}
Return
A distributed mutual exclusion algorithm for mobile computing environments
.png){kind=icon}
PRE
AI
DOI：10.1109/IIS.1997.645389.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile computing systems are expected to revolutionize the way computers are used. Mobile hosts have small memory, a relatively slow processor and low power batteries, and communicate over low bandwidth wireless communication links. Existing mutual exclusion algorithms for distributed systems are not suitable to mobile systems due to these limitations. In this paper we propose a concept of look-ahead technique for distributed mutual exclusion which instead of enforcing mutual exclusion among all the sites of a mobile system, enforces mutual exclusion only among the sites which are concurrently competing for critical section (CS), resulting in less message overhead. We refer to it as look-ahead technique because it first looks into to find out the sites that are currently requesting GS before sending out request messages. Designing look-ahead mutual exclusion involves two issues: First is identifying sites which are concurrently competing for CS, and second enforcing mutual exclusion among these sites. In this paper, we systematically develop a look-ahead mutual exclusion algorithm from the first principles, which suits mobile computing environments. Look-ahead mutual exclusion algorithms are more efficient because they eliminate unnecessary communication among sites. Message traffic is proportional to average number of active sites at any time instead of the total number of sites in the system.
Keywords:
distributed synchronization
mutual exclusion
mobile computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
1
Citations:
0
Organization
No organization information available