Algorithms to implement semaphores in distributed environments
Mahendra Ramachandran · OhioLink ETD Center (Ohio Library and Information Network) · 1995
Response Time Versus XCST.Consensus-based and Centralized Approaches, One Binary Semaphore on 10 Processors (CST= 4 msec, 7ZA= 10 msec) .110 Response Time Versus XCST.Consensus-based and Centralized Approaches, One Binary Semaphore on 35 Processors (CST= 4 msec, 72.-4= 10 msec) .I l l Response Time Versus XCST.Consensus-based and Centralized Approaches, Multiple Binary Semaphores on 10 Processors (CST= 4 msec, 7ZA= 10 msec) 112 Response Time Versus XCST.Consensus-based and Centralized Approaches, Multiple Binary Semaphores on 35 Processors (CST= 4 msec, 71A= 10 msec) 112 Response Time Versus XCST.Consensus-based and Centralized Approaches, Multiple Resource Counting Semaphores on 10 Processors (CST= 4 msec, 7ZA= 10 m se c )............................