Statements (105)
| Predicate | Object |
|---|---|
| gptkbp:instance_of |
gptkb:architecture
gptkb:Garbage_Collection |
| gptkbp:can_be_configured_for |
Throughput optimization
Latency optimization |
| gptkbp:can_be_traversed_by |
depth-first search
breadth-first search |
| gptkbp:can_be_tuned_with |
JVM flags
|
| gptkbp:can_be_used_with |
Java 8 and later versions
|
| gptkbp:can_be_visualized |
gptkb:true
|
| gptkbp:can_have_cycles |
gptkb:true
|
| gptkbp:can_have_loops |
gptkb:true
|
| gptkbp:can_have_properties |
density
diameter centrality measures clustering coefficient degree of vertices |
| gptkbp:can_have_weights |
gptkb:true
|
| gptkbp:collects |
Old generation
Young generation |
| gptkbp:color |
gptkb:true
|
| gptkbp:coordinates |
multiple
|
| gptkbp:designed_for |
Java applications
|
| gptkbp:developed_by |
gptkb:Oracle_Corporation
|
| gptkbp:directed |
false
|
| gptkbp:goal |
Minimize pause times
|
| gptkbp:has |
Garbage collection phases
|
| gptkbp:has_type |
graph
|
| https://www.w3.org/2000/01/rdf-schema#label |
G1
|
| gptkbp:includes |
Full collection
Mixed collection Young collection |
| gptkbp:introduced_in |
gptkb:Java_SE_7u4
|
| gptkbp:is |
gptkb:Java_SE
Garbage collection algorithm Java performance enhancement Adaptive collector Automatic memory management system Concurrent collector Default collector in Java 9 and later Garbage collection strategy Generational collector Incremental collector Java application performance tool Java garbage collection mechanism Java memory management feature Java performance feature Java runtime feature Low-pause collector Memory cleanup process Memory management technique Memory optimization technique Memory reclamation method Non-intrusive collector Parallel collector Performance tuning tool Region-based collector Resource management tool System optimization feature |
| gptkbp:is_analyzed_in |
algorithm design
combinatorial optimization graph theory graph algorithms |
| gptkbp:is_connected_to |
depends on structure
|
| gptkbp:is_optimized_for |
Garbage collection performance
|
| gptkbp:is_part_of |
gptkb:Java_Virtual_Machine_(JVM)
graph theory |
| gptkbp:is_related_to |
graphs
trees hypergraphs digraphs |
| gptkbp:is_represented_in |
gptkb:Graphics_Processing_Unit
data visualization adjacency matrix incidence matrix |
| gptkbp:is_studied_in |
discrete mathematics
|
| gptkbp:is_used_in |
gptkb:computer_science
gptkb:Mathematics social network analysis network analysis transportation networks communication networks biological networks data structure design |
| gptkbp:length |
gptkb:2_D
|
| gptkbp:modifications |
adding edges
removing edges adding vertices removing vertices |
| gptkbp:provides |
Heap compaction
Predictable pause time goals |
| gptkbp:replaces |
CMS (Concurrent Mark-Sweep) collector
|
| gptkbp:represents |
relationships
networks hierarchies |
| gptkbp:scientific_classification |
simple graph
weighted graph multigraph unweighted graph |
| gptkbp:suitable_for |
Large heap sizes
|
| gptkbp:supports |
Concurrent garbage collection
|
| gptkbp:uses |
Region-based memory management
Mark and sweep algorithm |
| gptkbp:works_with |
Heap memory
|
| gptkbp:bfsParent |
gptkb:Metroplex
|
| gptkbp:bfsLayer |
3
|