mirror of https://github.com/golang/go.git
cmd/trace: notes on MMU view improvements
Change-Id: Ib9dcdc76095f6718f1cdc83349503f52567c76d4 Reviewed-on: https://go-review.googlesource.com/c/60801 Run-TryBot: Austin Clements <austin@google.com> TryBot-Result: Gobot Gobot <gobot@golang.org> Reviewed-by: Hyang-Ah Hana Kim <hyangah@gmail.com>
This commit is contained in:
parent
b251d7fbe6
commit
e72595ee0f
|
|
@ -4,6 +4,25 @@
|
|||
|
||||
// Minimum mutator utilization (MMU) graphing.
|
||||
|
||||
// TODO:
|
||||
//
|
||||
// In worst window list, show break-down of GC utilization sources
|
||||
// (STW, assist, etc). Probably requires a different MutatorUtil
|
||||
// representation.
|
||||
//
|
||||
// When a window size is selected, show a second plot of the mutator
|
||||
// utilization distribution for that window size.
|
||||
//
|
||||
// Render plot progressively so rough outline is visible quickly even
|
||||
// for very complex MUTs. Start by computing just a few window sizes
|
||||
// and then add more window sizes.
|
||||
//
|
||||
// Consider using sampling to compute an approximate MUT. This would
|
||||
// work by sampling the mutator utilization at randomly selected
|
||||
// points in time in the trace to build an empirical distribution. We
|
||||
// could potentially put confidence intervals on these estimates and
|
||||
// render this progressively as we refine the distributions.
|
||||
|
||||
package main
|
||||
|
||||
import (
|
||||
|
|
|
|||
Loading…
Reference in New Issue