cluster_helpers.go 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658
  1. package costmodel
  2. import (
  3. "time"
  4. "github.com/kubecost/cost-model/pkg/env"
  5. "github.com/kubecost/cost-model/pkg/log"
  6. "github.com/kubecost/cost-model/pkg/prom"
  7. )
  8. // mergeTypeMaps takes two maps of (cluster name, node name) -> node type
  9. // and combines them into a single map, preferring the k/v pairs in
  10. // the first map.
  11. func mergeTypeMaps(clusterAndNameToType1, clusterAndNameToType2 map[nodeIdentifierNoProviderID]string) map[nodeIdentifierNoProviderID]string {
  12. merged := map[nodeIdentifierNoProviderID]string{}
  13. for k, v := range clusterAndNameToType2 {
  14. merged[k] = v
  15. }
  16. // This ordering ensures the mappings in the first arg are preferred.
  17. for k, v := range clusterAndNameToType1 {
  18. merged[k] = v
  19. }
  20. return merged
  21. }
  22. func buildCPUCostMap(
  23. resNodeCPUCost []*prom.QueryResult,
  24. providerIDParser func(string) string,
  25. ) (
  26. map[NodeIdentifier]float64,
  27. map[nodeIdentifierNoProviderID]string,
  28. ) {
  29. cpuCostMap := make(map[NodeIdentifier]float64)
  30. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  31. for _, result := range resNodeCPUCost {
  32. cluster, err := result.GetString("cluster_id")
  33. if err != nil {
  34. cluster = env.GetClusterID()
  35. }
  36. name, err := result.GetString("node")
  37. if err != nil {
  38. log.Warningf("ClusterNodes: CPU cost data missing node")
  39. continue
  40. }
  41. nodeType, _ := result.GetString("instance_type")
  42. providerID, _ := result.GetString("provider_id")
  43. cpuCost := result.Values[0].Value
  44. key := NodeIdentifier{
  45. Cluster: cluster,
  46. Name: name,
  47. ProviderID: providerIDParser(providerID),
  48. }
  49. keyNon := nodeIdentifierNoProviderID{
  50. Cluster: cluster,
  51. Name: name,
  52. }
  53. clusterAndNameToType[keyNon] = nodeType
  54. cpuCostMap[key] = cpuCost
  55. }
  56. return cpuCostMap, clusterAndNameToType
  57. }
  58. func buildRAMCostMap(
  59. resNodeRAMCost []*prom.QueryResult,
  60. providerIDParser func(string) string,
  61. ) (
  62. map[NodeIdentifier]float64,
  63. map[nodeIdentifierNoProviderID]string,
  64. ) {
  65. ramCostMap := make(map[NodeIdentifier]float64)
  66. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  67. for _, result := range resNodeRAMCost {
  68. cluster, err := result.GetString("cluster_id")
  69. if err != nil {
  70. cluster = env.GetClusterID()
  71. }
  72. name, err := result.GetString("node")
  73. if err != nil {
  74. log.Warningf("ClusterNodes: RAM cost data missing node")
  75. continue
  76. }
  77. nodeType, _ := result.GetString("instance_type")
  78. providerID, _ := result.GetString("provider_id")
  79. ramCost := result.Values[0].Value
  80. key := NodeIdentifier{
  81. Cluster: cluster,
  82. Name: name,
  83. ProviderID: providerIDParser(providerID),
  84. }
  85. keyNon := nodeIdentifierNoProviderID{
  86. Cluster: cluster,
  87. Name: name,
  88. }
  89. clusterAndNameToType[keyNon] = nodeType
  90. ramCostMap[key] = ramCost
  91. }
  92. return ramCostMap, clusterAndNameToType
  93. }
  94. func buildGPUCostMap(
  95. resNodeGPUCost []*prom.QueryResult,
  96. providerIDParser func(string) string,
  97. ) (
  98. map[NodeIdentifier]float64,
  99. map[nodeIdentifierNoProviderID]string,
  100. ) {
  101. gpuCostMap := make(map[NodeIdentifier]float64)
  102. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  103. for _, result := range resNodeGPUCost {
  104. cluster, err := result.GetString("cluster_id")
  105. if err != nil {
  106. cluster = env.GetClusterID()
  107. }
  108. name, err := result.GetString("node")
  109. if err != nil {
  110. log.Warningf("ClusterNodes: GPU cost data missing node")
  111. continue
  112. }
  113. nodeType, _ := result.GetString("instance_type")
  114. providerID, _ := result.GetString("provider_id")
  115. gpuCost := result.Values[0].Value
  116. key := NodeIdentifier{
  117. Cluster: cluster,
  118. Name: name,
  119. ProviderID: providerIDParser(providerID),
  120. }
  121. keyNon := nodeIdentifierNoProviderID{
  122. Cluster: cluster,
  123. Name: name,
  124. }
  125. clusterAndNameToType[keyNon] = nodeType
  126. gpuCostMap[key] = gpuCost
  127. }
  128. return gpuCostMap, clusterAndNameToType
  129. }
  130. func buildCPUCoresMap(
  131. resNodeCPUCores []*prom.QueryResult,
  132. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  133. ) map[nodeIdentifierNoProviderID]float64 {
  134. m := make(map[nodeIdentifierNoProviderID]float64)
  135. for _, result := range resNodeCPUCores {
  136. cluster, err := result.GetString("cluster_id")
  137. if err != nil {
  138. cluster = env.GetClusterID()
  139. }
  140. name, err := result.GetString("node")
  141. if err != nil {
  142. log.Warningf("ClusterNodes: CPU cores data missing node")
  143. continue
  144. }
  145. cpuCores := result.Values[0].Value
  146. key := nodeIdentifierNoProviderID{
  147. Cluster: cluster,
  148. Name: name,
  149. }
  150. m[key] = cpuCores
  151. }
  152. return m
  153. }
  154. func buildRAMBytesMap(resNodeRAMBytes []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  155. m := make(map[nodeIdentifierNoProviderID]float64)
  156. for _, result := range resNodeRAMBytes {
  157. cluster, err := result.GetString("cluster_id")
  158. if err != nil {
  159. cluster = env.GetClusterID()
  160. }
  161. name, err := result.GetString("node")
  162. if err != nil {
  163. log.Warningf("ClusterNodes: RAM bytes data missing node")
  164. continue
  165. }
  166. ramBytes := result.Values[0].Value
  167. key := nodeIdentifierNoProviderID{
  168. Cluster: cluster,
  169. Name: name,
  170. }
  171. m[key] = ramBytes
  172. }
  173. return m
  174. }
  175. // Mapping of cluster/node=cpu for computing resource efficiency
  176. func buildCPUBreakdownMap(resNodeCPUModeTotal []*prom.QueryResult) map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown {
  177. cpuBreakdownMap := make(map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown)
  178. // Mapping of cluster/node=cpu for computing resource efficiency
  179. clusterNodeCPUTotal := map[nodeIdentifierNoProviderID]float64{}
  180. // Mapping of cluster/node:mode=cpu for computing resource efficiency
  181. clusterNodeModeCPUTotal := map[nodeIdentifierNoProviderID]map[string]float64{}
  182. // Build intermediate structures for CPU usage by (cluster, node) and by
  183. // (cluster, node, mode) for computing resouce efficiency
  184. for _, result := range resNodeCPUModeTotal {
  185. cluster, err := result.GetString("cluster_id")
  186. if err != nil {
  187. cluster = env.GetClusterID()
  188. }
  189. node, err := result.GetString("kubernetes_node")
  190. if err != nil {
  191. log.DedupedWarningf(5, "ClusterNodes: CPU mode data missing node")
  192. continue
  193. }
  194. mode, err := result.GetString("mode")
  195. if err != nil {
  196. log.Warningf("ClusterNodes: unable to read CPU mode: %s", err)
  197. mode = "other"
  198. }
  199. key := nodeIdentifierNoProviderID{
  200. Cluster: cluster,
  201. Name: node,
  202. }
  203. total := result.Values[0].Value
  204. // Increment total
  205. clusterNodeCPUTotal[key] += total
  206. // Increment mode
  207. if _, ok := clusterNodeModeCPUTotal[key]; !ok {
  208. clusterNodeModeCPUTotal[key] = map[string]float64{}
  209. }
  210. clusterNodeModeCPUTotal[key][mode] += total
  211. }
  212. // Compute resource efficiency from intermediate structures
  213. for key, total := range clusterNodeCPUTotal {
  214. if modeTotals, ok := clusterNodeModeCPUTotal[key]; ok {
  215. for mode, subtotal := range modeTotals {
  216. // Compute percentage for the current cluster, node, mode
  217. pct := 0.0
  218. if total > 0 {
  219. pct = subtotal / total
  220. }
  221. if _, ok := cpuBreakdownMap[key]; !ok {
  222. cpuBreakdownMap[key] = &ClusterCostsBreakdown{}
  223. }
  224. switch mode {
  225. case "idle":
  226. cpuBreakdownMap[key].Idle += pct
  227. case "system":
  228. cpuBreakdownMap[key].System += pct
  229. case "user":
  230. cpuBreakdownMap[key].User += pct
  231. default:
  232. cpuBreakdownMap[key].Other += pct
  233. }
  234. }
  235. }
  236. }
  237. return cpuBreakdownMap
  238. }
  239. func buildRAMUserPctMap(resNodeRAMUserPct []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  240. m := make(map[nodeIdentifierNoProviderID]float64)
  241. for _, result := range resNodeRAMUserPct {
  242. cluster, err := result.GetString("cluster_id")
  243. if err != nil {
  244. cluster = env.GetClusterID()
  245. }
  246. name, err := result.GetString("instance")
  247. if err != nil {
  248. log.Warningf("ClusterNodes: RAM user percent missing node")
  249. continue
  250. }
  251. pct := result.Values[0].Value
  252. key := nodeIdentifierNoProviderID{
  253. Cluster: cluster,
  254. Name: name,
  255. }
  256. m[key] = pct
  257. }
  258. return m
  259. }
  260. func buildRAMSystemPctMap(resNodeRAMSystemPct []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  261. m := make(map[nodeIdentifierNoProviderID]float64)
  262. for _, result := range resNodeRAMSystemPct {
  263. cluster, err := result.GetString("cluster_id")
  264. if err != nil {
  265. cluster = env.GetClusterID()
  266. }
  267. name, err := result.GetString("instance")
  268. if err != nil {
  269. log.Warningf("ClusterNodes: RAM system percent missing node")
  270. continue
  271. }
  272. pct := result.Values[0].Value
  273. key := nodeIdentifierNoProviderID{
  274. Cluster: cluster,
  275. Name: name,
  276. }
  277. m[key] = pct
  278. }
  279. return m
  280. }
  281. type activeData struct {
  282. start time.Time
  283. end time.Time
  284. minutes float64
  285. }
  286. func buildActiveDataMap(resActiveMins []*prom.QueryResult, resolution time.Duration, providerIDParser func(string) string) map[NodeIdentifier]activeData {
  287. m := make(map[NodeIdentifier]activeData)
  288. for _, result := range resActiveMins {
  289. cluster, err := result.GetString("cluster_id")
  290. if err != nil {
  291. cluster = env.GetClusterID()
  292. }
  293. name, err := result.GetString("node")
  294. if err != nil {
  295. log.Warningf("ClusterNodes: active mins missing node")
  296. continue
  297. }
  298. providerID, _ := result.GetString("provider_id")
  299. key := NodeIdentifier{
  300. Cluster: cluster,
  301. Name: name,
  302. ProviderID: providerIDParser(providerID),
  303. }
  304. if len(result.Values) == 0 {
  305. continue
  306. }
  307. s := time.Unix(int64(result.Values[0].Timestamp), 0)
  308. e := time.Unix(int64(result.Values[len(result.Values)-1].Timestamp), 0).Add(resolution)
  309. mins := e.Sub(s).Minutes()
  310. // TODO niko/assets if mins >= threshold, interpolate for missing data?
  311. m[key] = activeData{
  312. start: s,
  313. end: e,
  314. minutes: mins,
  315. }
  316. }
  317. return m
  318. }
  319. // Determine preemptibility with node labels
  320. // node id -> is preemptible?
  321. func buildPreemptibleMap(
  322. resIsSpot []*prom.QueryResult,
  323. providerIDParser func(string) string,
  324. ) map[NodeIdentifier]bool {
  325. m := make(map[NodeIdentifier]bool)
  326. for _, result := range resIsSpot {
  327. nodeName, err := result.GetString("node")
  328. if err != nil {
  329. continue
  330. }
  331. // GCP preemptible label
  332. pre := result.Values[0].Value
  333. cluster, err := result.GetString("cluster_id")
  334. if err != nil {
  335. cluster = env.GetClusterID()
  336. }
  337. providerID, _ := result.GetString("provider_id")
  338. key := NodeIdentifier{
  339. Cluster: cluster,
  340. Name: nodeName,
  341. ProviderID: providerIDParser(providerID),
  342. }
  343. // TODO(michaelmdresser): check this condition at merge time?
  344. // if node, ok := nodeMap[key]; pre > 0.0 && ok {
  345. // node.Preemptible = true
  346. // }
  347. m[key] = pre > 0.0
  348. // TODO AWS preemptible
  349. // TODO Azure preemptible
  350. }
  351. return m
  352. }
  353. func buildLabelsMap(
  354. resLabels []*prom.QueryResult,
  355. ) map[nodeIdentifierNoProviderID]map[string]string {
  356. m := make(map[nodeIdentifierNoProviderID]map[string]string)
  357. // Copy labels into node
  358. for _, result := range resLabels {
  359. cluster, err := result.GetString("cluster_id")
  360. if err != nil {
  361. cluster = env.GetClusterID()
  362. }
  363. node, err := result.GetString("kubernetes_node")
  364. if err != nil {
  365. log.DedupedWarningf(5, "ClusterNodes: label data missing node")
  366. continue
  367. }
  368. key := nodeIdentifierNoProviderID{
  369. Cluster: cluster,
  370. Name: node,
  371. }
  372. m[key] = make(map[string]string)
  373. for name, value := range result.Metric {
  374. if val, ok := value.(string); ok {
  375. m[key][name] = val
  376. }
  377. }
  378. }
  379. return m
  380. }
  381. // checkForKeyAndInitIfMissing inits a key in the provided nodemap if
  382. // it does not exist. Intended to be called ONLY by buildNodeMap
  383. func checkForKeyAndInitIfMissing(
  384. nodeMap map[NodeIdentifier]*Node,
  385. key NodeIdentifier,
  386. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  387. ) {
  388. if _, ok := nodeMap[key]; !ok {
  389. // default nodeType in case we don't have the mapping
  390. var nodeType string
  391. if t, ok := clusterAndNameToType[nodeIdentifierNoProviderID{
  392. Cluster: key.Cluster,
  393. Name: key.Name,
  394. }]; ok {
  395. nodeType = t
  396. } else {
  397. log.Warningf("ClusterNodes: Type does not exist for node identifier %s", key)
  398. }
  399. nodeMap[key] = &Node{
  400. Cluster: key.Cluster,
  401. Name: key.Name,
  402. NodeType: nodeType,
  403. ProviderID: key.ProviderID,
  404. CPUBreakdown: &ClusterCostsBreakdown{},
  405. RAMBreakdown: &ClusterCostsBreakdown{},
  406. }
  407. }
  408. }
  409. // buildNodeMap creates the main set of node data for ClusterNodes from
  410. // the data maps built from Prometheus queries. Some of the Prometheus
  411. // data has access to the provider_id field and some does not. To get
  412. // around this problem, we use the data that includes provider_id
  413. // to build up the definitive set of nodes and then use the data
  414. // with less-specific identifiers (i.e. without provider_id) to fill
  415. // in the remaining fields.
  416. //
  417. // For example, let's say we have nodes identified like so:
  418. // cluster name/node name/provider_id. For the sake of the example,
  419. // we will also limit data to CPU cost, CPU cores, and preemptibility.
  420. //
  421. // We have CPU cost data that looks like this:
  422. // cluster1/node1/prov_node1_A: $10
  423. // cluster1/node1/prov_node1_B: $8
  424. // cluster1/node2/prov_node2: $15
  425. //
  426. // We have Preemptible data that looks like this:
  427. // cluster1/node1/prov_node1_A: true
  428. // cluster1/node1/prov_node1_B: false
  429. // cluster1/node2/prov_node2_B: false
  430. //
  431. // We have CPU cores data that looks like this:
  432. // cluster1/node1: 4
  433. // cluster1/node2: 6
  434. //
  435. // This function first combines the data that is fully identified,
  436. // creating the following:
  437. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true)
  438. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false)
  439. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false)
  440. //
  441. // It then uses the less-specific data to extend the specific data,
  442. // making the following:
  443. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true), Cores(4)
  444. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false), Cores(4)
  445. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false), Cores(6)
  446. //
  447. // In the situation where provider_id doesn't exist for any metrics,
  448. // that is the same as all provider_ids being empty strings. If
  449. // provider_id doesn't exist at all, then we (without having to do
  450. // extra work) easily fall back on identifying nodes only by cluster name
  451. // and node name because the provider_id part of the key will always
  452. // be the empty string.
  453. //
  454. // It is worth nothing that, in this approach, if a node is not present
  455. // in the more specific data but is present in the less-specific data,
  456. // that data is never processed into the final node map. For example,
  457. // let's say the CPU cores map has the following entry:
  458. // cluster1/node8: 6
  459. // But none of the maps with provider_id (CPU cost, RAM cost, etc.)
  460. // have an identifier for cluster1/node8 (regardless of provider_id).
  461. // In this situation, the final node map will not have a cluster1/node8
  462. // entry. This could be fixed by iterating over all of the less specific
  463. // identifiers and, inside that iteration, all of the identifiers in
  464. // the node map, but this would introduce a roughly quadratic time
  465. // complexity.
  466. func buildNodeMap(
  467. cpuCostMap, ramCostMap, gpuCostMap map[NodeIdentifier]float64,
  468. cpuCoresMap, ramBytesMap, ramUserPctMap,
  469. ramSystemPctMap map[nodeIdentifierNoProviderID]float64,
  470. cpuBreakdownMap map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown,
  471. activeDataMap map[NodeIdentifier]activeData,
  472. preemptibleMap map[NodeIdentifier]bool,
  473. labelsMap map[nodeIdentifierNoProviderID]map[string]string,
  474. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  475. ) map[NodeIdentifier]*Node {
  476. nodeMap := make(map[NodeIdentifier]*Node)
  477. // Initialize the map with the most-specific data:
  478. for id, cost := range cpuCostMap {
  479. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  480. nodeMap[id].CPUCost = cost
  481. }
  482. for id, cost := range ramCostMap {
  483. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  484. nodeMap[id].RAMCost = cost
  485. }
  486. for id, cost := range gpuCostMap {
  487. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  488. nodeMap[id].GPUCost = cost
  489. }
  490. for id, preemptible := range preemptibleMap {
  491. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  492. nodeMap[id].Preemptible = preemptible
  493. }
  494. for id, activeData := range activeDataMap {
  495. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  496. nodeMap[id].Start = activeData.start
  497. nodeMap[id].End = activeData.end
  498. nodeMap[id].Minutes = activeData.minutes
  499. }
  500. // We now merge in data that doesn't have a provider id by looping over
  501. // all keys already added and inserting data according to their
  502. // cluster name/node name combos.
  503. for id, nodePtr := range nodeMap {
  504. clusterAndNameID := nodeIdentifierNoProviderID{
  505. Cluster: id.Cluster,
  506. Name: id.Name,
  507. }
  508. if cores, ok := cpuCoresMap[clusterAndNameID]; ok {
  509. nodePtr.CPUCores = cores
  510. if v, ok := partialCPUMap[nodePtr.NodeType]; ok {
  511. if cores > 0 {
  512. nodePtr.CPUCores = v
  513. adjustmentFactor := v / cores
  514. nodePtr.CPUCost = nodePtr.CPUCost * adjustmentFactor
  515. }
  516. }
  517. }
  518. if ramBytes, ok := ramBytesMap[clusterAndNameID]; ok {
  519. nodePtr.RAMBytes = ramBytes
  520. }
  521. if ramUserPct, ok := ramUserPctMap[clusterAndNameID]; ok {
  522. nodePtr.RAMBreakdown.User = ramUserPct
  523. }
  524. if ramSystemPct, ok := ramSystemPctMap[clusterAndNameID]; ok {
  525. nodePtr.RAMBreakdown.System = ramSystemPct
  526. }
  527. if cpuBreakdown, ok := cpuBreakdownMap[clusterAndNameID]; ok {
  528. nodePtr.CPUBreakdown = cpuBreakdown
  529. }
  530. if labels, ok := labelsMap[clusterAndNameID]; ok {
  531. nodePtr.Labels = labels
  532. }
  533. }
  534. return nodeMap
  535. }