scheduler scheduling-method
scheduling-method Algorithm for allocating TCP connections and UDP datagrams to real servers.
Scheduling algorithms are implemented as kernel modules.
Ten are shipped with the Linux Virtual Server:
rr - Robin Robin:
distributes jobs equally amongst the available real servers.
(¸®¾ó¼¹ö¸¦ óÀ½ºÎÅÍ Â÷·Ê·Î ¼±ÅÃÇØ°£´Ù. ¸ðµç¼¹ö·Î ±ÕµîÇÏ°Ô Ã³¸®°¡ ºÐ»ê)
wrr - Weighted Round Robin:
assigns jobs to real servers proportionally to there real servers¡¯ weight.
Servers with higher weights receive new jobs first and get more jobs than servers with lower weights.
Servers with equal weights get an equal distribution of new jobs.
(rr ¹æ½Ä°ú °°Áö¸¸ °¡ÁßÄ¡¸¦ Ãß°¡Çؼ ºÐ»êºñÀ²À» º¯°æÇÑ´Ù. °¡ÁßÄ¡°¡ Å« ¼¹öÀϼö·Ï ºó¹øÇÏ°Ô
¼±ÅõǹǷΠ󸮴ɷÂÀÌ ³ôÀº ¼¹ö´Â °¡ÁßÄ¡¸¦ ³ô°Ô ¼³Á¤Çϴ°ÍÀÌ ÁÁ´Ù.)
lc - Least-Connection:
assigns more jobs to real servers with fewer active jobs.
(Á¢¼Ó¼ö°¡ °¡Àå ÀûÀº ¼¹ö¸¦ ¼±ÅÃÇÑ´Ù. ¾î¶² ¾Ë°í¸®ÁòÀ» »ç¿ëÇϸé ÁÁÀ»Áö ¸ð¸¦ °æ¿ì¿¡ »ç¿ëÇصµ ÁÁ´Ù)
wlc - Weighted Least-Connection:
assigns more jobs to servers with fewer jobs and relative to the real servers¡¯ weight (Ci/Wi).
This is the default.
(lc ¿Í °°Áö¸¸ °¡ÁßÄ¡¸¦ ºÎ¿©ÇÑ´Ù. ±¸Ã¼ÀûÀ¸·Î´Â [Á¢¼Ó¼ö+1/°¡ÁßÄ¡]°¡ ÃÖ¼Ò°¡ µÇ´Â ¼¹ö¸¦ ¼±ÅÃÇϹǷΠ°í¼º´É ¼¹ö´Â °¡ÁßÄ¡¸¦ Å©°Ô Çϴ°ÍÀÌ ÁÁ´Ù)
lblc - Locality-Based Least-Connection:
assigns jobs destined for the same IP address to the same server if the server is not overloaded and available;
otherwise assign jobs to servers with fewer jobs, and keep it for future assignment.
(Á¢¼ÓÀÚ¼ö°¡ °¡ÁßÄ¡·Î ÁöÁ¤ÇÑ °ªÀ» ³Ñ±â Àü±îÁö´Â µ¿ÀÏÇÑ ¼¹ö¸¦ ¼±ÅÃÇÏ°í Á¢¼ÓÀÚ¼ö°¡ °¡ÁßÄ¡¸¦ ³Ñ¾î¼± °æ¿ì´Â ´Ù¸¥¼¹ö¸¦ ¼±ÅÃÇÑ´Ù.
¸ðµç ¼¹öÀÇ Á¢¼Ó¼ö°¡ °¡ÁßÄ¡·Î ÁöÁ¤ÇÑ °ªÀ» ³Ñ°í ÀÖÀ» °æ¿ì ¸¶Áö¸·¿¡ ¼±ÅÃµÈ ¼¹ö°¡ °è¼Ó ¼±ÅõȴÙ.)
lblcr - Locality-Based Least-Connection with Replication:
assigns jobs destined for the same IP address to the least-connection node in the server set for the IP address.
If all the node in the server set are over loaded, it picks up a node with fewer jobs in the cluster
and adds it in the sever set for the target.
If the server set has not been modified for the specified time, the most loaded node is removed
from the server set, in order to avoid high degree of replication.
(lblc ¿Í °ÅÀÇ °°Áö¸¸ ¸ðµç ¼¹öÀÇ Á¢¼Ó¼ö°¡ °¡ÁßÄ¡·Î ÁöÁ¤ÇÑ °ªÀ» ³Ñ°í ÀÖÀ» °æ¿ì´Â Á¢¼Ó¼ö°¡ °¡Àå ÀûÀº ¼¹ö°¡ ¼±ÅõȴÙ.)
dh - Destination Hashing:
assigns jobs to servers through looking up a statically assigned hash table by their destination IP addresses.
(¸ñÀûÁö IP ÁּҷκÎÅÍ ÇؽðªÀ» °è»êÇؼ ºÐ»ê´ë»ó ¸®¾ó¼¹ö¸¦ ¼±ÅÃÇÑ´Ù.)
sh - Source Hashing:
assigns jobs to servers through looking up a statically assigned hash table by their source IP addresses.
(¼Ò½º IP ÁּҷκÎÅÍ ÇؽðªÀ» °è»êÇؼ ºÐ»ê´ë»ó ¸®¾ó¼¹ö¸¦ ¼±ÅÃÇÑ´Ù.)
sed - Shortest Expected Delay:
assigns an incoming job to the server with the shortest expected delay.
The expected delay that the job will experience is (Ci + 1) / Ui if sent to the ith server,
in which Ci is the number of jobs on the the ith server and Ui is the fixed service rate (weight) of the ith server.
(°¡Àå ÀÀ´ä¼Óµµ°¡ ºü¸¥ ¼¹ö¸¦ ¼±ÅÃÇÑ´Ù. ±×·¸´Ù°í Çصµ ¼¹ö¿¡ ÇÇŶÀ» ³¯·Á ÀÀ´ä½Ã°£À» °èÃøÇϴ°ÍÀº ¾Æ´Ï°í »óÅ°¡ established(active) ÀÎ Á¢¼Ó¼ö°¡ °¡Àå ÀûÀº ¼¹ö¸¦ ¼±ÅÃÇÏ´Â ¹æ½ÄÀÌ´Ù.
wlc¿Í °ÅÀÇ µ¿ÀÏÇÏ°Ô µ¿ÀÛÇÏÁö¸¸ wlc ¿¡¼´Â established ÀÌ¿ÜÀÇ »óÅÂÀÎ Á¢¼Ó¼ö(time_wait, fin_wait)¸¦ ´õÇÏ´Â Á¡ÀÌ ´Ù¸£´Ù.
nq - Never Queue:
assigns an incoming job to an idle server if there is, instead of waiting for a fast one;
if all the servers are busy, it adopts the Shortest Expected Delay policy to assign the job.
(sed¿Í µ¿ÀÏÇÑ ¾Ë°í¸®ÁòÀÌÁö¸¸ active Á¢¼Ó¼ö°¡ 0ÀÎ ¼¹ö¸¦ ÃÖ¿ì¼±À¸·Î ¼±ÅÃÇÑ´Ù.)