Most mutual exclusion algorithms require O(n) operations to enter the critical section despite how many may be actively trying to enter the critical section.This paper presents a mutual exclusion algorithm that is much more sensitive to how many processes currently want to enter the critical section.This algorithm is based on a parameter 1, and assumes there is a total of n = kl processes.If only one process wants to enter the critical section, 1 + 7 operations are sufficient.If there are -t processes currently wanting to enter the critical section, then (9(tlk) operations are all that is necessary.This is ususally much less than the O(n) operations required by ordinary mutual exclusion algorithms.If the need is only to elect one process, the same minimum of 8 operations will hold, but the number of variables used will be O(log t), if t processes are contending to be elected.This algorithm will also by symmetric, with no distinctions between processes.

We consider the minimum number of variables required for symmetric mutual exclusion and related problems.The symmetric.mutual exclusion problem takes the standard shared memory mutual exclusion problem and

Article Improved algorithms for distributed resource allocation Share on Authors: Eugene Styer School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Ga. School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Ga.View Profile , Gary L. Peterson School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Ga. School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Ga.View Profile Authors Info & Claims PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computingJanuary 1988 Pages 105–116https://doi.org/10.1145/62546.62567Published:01 January 1988 28citation515DownloadsMetricsTotal Citations28Total Downloads515Last 12 Months5Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access