pending messages, which need to be sent or received > T
, then the remote cache send
process yields the CPU to other processes instead of waiting for a reply from a service
node. At a service node, the DCS coscheduling algorithm is applied only when the
number of open connections < T
(The number of open connections is widely used to
estimate the Web server load [58]). If so, the remote cache recv process is assigned to
the CPU according to the Linux scheduler policy only. The DCS coscheduling algorithm
is beneficial only when a sending process receives a reply within the waiting time. It
not, the CPU time is wasted. Therefore, the adaptive model deploys the coscheduling
mechanism only when the probability of receiving a reply within a time quantum is higher
than the threshold value. Note that the adaptive model does not have to exchange
additional information among servers since they use their local information. T
, the
number of pending messages, is obtained to count the VIA sending and receiving queues
and T
is easily calculated in the Web server programs. Here, we choose T
based on
the experiment results and T
by the CPU utilization. However, finding the optimal
threshold values is another future research topic.



About Services Network Support FAQ Order Contact


Clan Web Hosting

Our partners:Jsp Web Hosting Unlimited Web Hosting Cheapest Web Hosting  Java Web Hosting Web Templates Best Web Templates PHP Mysql Web Hosting Interland Web Hosting Cheap Web Hosting PHP Web Hosting Tomcat Web Hosting Quality Web Hosting Best Web Hosting  Mac Web Hosting 

Lunarwebhost.net  Business web hosting division of Vision Web Hosting Inc. All rights reserved