2014 IEEE 13th International Symposium on Parallel and Distributed Computing 2014
DOI: 10.1109/ispdc.2014.20
|View full text |Cite
|
Sign up to set email alerts
|

Load Balancing of Java Applications by Forecasting Garbage Collections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
2
2
1

Relationship

4
1

Authors

Journals

citations
Cited by 13 publications
(27 citation statements)
references
References 15 publications
0
27
0
Order By: Relevance
“…In our previous work [15], we presented an algorithm to predict MaGC events in generational heaps. The algorithm works by periodically retrieving MiGC and memory samples from a monitored JVM (as per a configurable Sample Interval) to build the history of memory allocations that occur in the Young and Old Generations through time.…”
Section: Background and Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…In our previous work [15], we presented an algorithm to predict MaGC events in generational heaps. The algorithm works by periodically retrieving MiGC and memory samples from a monitored JVM (as per a configurable Sample Interval) to build the history of memory allocations that occur in the Young and Old Generations through time.…”
Section: Background and Related Workmentioning
confidence: 99%
“…To assess the performance benefits of adapting the load balancing based on the MaGC forecasts, in [15] we also presented a modified version of the round-robin 3 load balancing algorithm. The main difference of our algorithm (compared against the normal round-robin) is that it performs an additional check in the selection of the next node.…”
Section: Background and Related Workmentioning
confidence: 99%
See 3 more Smart Citations