cluster_helpers.go 21 KB

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