2011
DOI: 10.1007/s10586-011-0168-5
|View full text |Cite
|
Sign up to set email alerts
|

Autonomous learning of load and traffic patterns to improve cluster utilization

Abstract: Adaptive clustering aims at improving cluster utilization for varying load and traffic patterns. Localitybased least-connection with replication (LBLCR) scheduling that comes with Linux is designed to help improve cluster utilization through adaptive clustering. A key issue with LBLCR, however, is that cluster performance depends much on a single threshold value that is used to determine adaptation. Once set, the threshold remains fixed, regardless of the load and traffic patterns. If a cluster of PCs is to ad… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 26 publications
0
1
0
Order By: Relevance
“…Load balancing strategy [8] mainly includes RoundRobin Scheduling (RR), Weighted Round-Robin Scheduling (WRR) [9], Least-Connection Scheduling(LC) [10], Weighted Least-Connection Scheduling(WLC) [11], Locality-Based Least-Connection Scheduling(LBLC) [12], Locality-Based Least-Connection with Replication Schedul-ing(LBLCR), Destination Hashing Scheduling(DH), Source Hashing Scheduling and so on. Aiming at practical situation or experimental questions, algorithms can be restructured to optimize job assignment, such as appending dynamic detection based on the state of node, or adding algorithms based on some effective math conclusion into load balancing strategy.…”
Section: Related Workmentioning
confidence: 99%
“…Load balancing strategy [8] mainly includes RoundRobin Scheduling (RR), Weighted Round-Robin Scheduling (WRR) [9], Least-Connection Scheduling(LC) [10], Weighted Least-Connection Scheduling(WLC) [11], Locality-Based Least-Connection Scheduling(LBLC) [12], Locality-Based Least-Connection with Replication Schedul-ing(LBLCR), Destination Hashing Scheduling(DH), Source Hashing Scheduling and so on. Aiming at practical situation or experimental questions, algorithms can be restructured to optimize job assignment, such as appending dynamic detection based on the state of node, or adding algorithms based on some effective math conclusion into load balancing strategy.…”
Section: Related Workmentioning
confidence: 99%