Zaɓi Harshe

COLA: Haɗin Kai na Sarrafa Girma ta Atomatik don Ƙananan Ayyuka na Girgije

Bincike na COLA, sabon na'urar sarrafa girma ta atomatik don aikace-aikacen ƙananan ayyuka wanda ke inganta rabon VM a duniya don rage farashi yayin cika manufofin jinkirin ƙarshe-zuwa-ƙarshe.
apismarket.org | PDF Size: 1.6 MB
Kima: 4.5/5
Kimarku
Kun riga kun ƙididdige wannan takarda
Murfin Takardar PDF - COLA: Haɗin Kai na Sarrafa Girma ta Atomatik don Ƙananan Ayyuka na Girgije

1. Gabatarwa

Canjin daga tsarin gine-ginen guda ɗaya zuwa ƙananan ayyuka masu sauƙi a cikin aikace-aikacen girgije yana haifar da rikitarwa mai mahimmanci a cikin sarrafa albarkatu. Dole ne masu haɓakawa su yanke shawarar yawan albarkatun lissafi (misali, kwafin akwati, VMs) da za a raba wa kowane ƙaramin sabis. Wannan shawarar tana tasiri sosai ga duka farashin aiki na mai haɓakawa da kuma jinkirin ƙarshe-zuwa-ƙarshe da mai amfani da aikace-aikacen ke fuskanta. Hanyoyin sarrafa girma ta atomatik na gargajiya, kamar Horizontal Pod Autoscaling (HPA), suna daidaita kowane ƙaramin sabis da kansa bisa ma'auni na gida kamar amfani da CPU. Duk da haka, wannan hanyar ba ta da kyau saboda tana yin watsi da yanayin dogaro da juna na ƙananan ayyuka a cikin aikin aikace-aikace. An gabatar da COLA (Collective Autoscaler) a matsayin mafita wanda ke tara rarraba albarkatu a duk ƙananan ayyuka tare da manufa ta duniya: rage farashin kuɗi yayin tabbatar da cewa jinkirin ƙarshe-zuwa-ƙarshe na aikace-aikacen ya kasance ƙasa da wani manufa da aka ƙayyade.

2. Matsalar Sarrafa Girma Mai Zaman Kansa

Madaidaicin ma'auni na masana'antu na sarrafa girma ta atomatik yana aiki ta hanyar rarraba, kowane ƙaramin sabis. Kowane sabis yana haifar da ayyukan daidaitawa (ƙara/cire VMs ko gwangwani) lokacin da amfanin albarkatunsa (CPU, ƙwaƙwalwar ajiya) ya wuce kofa. Babban aibi shi ne cewa wannan ra'ayi na gida ya kasa yin la'akari da aikin duniya na aikace-aikacen. Inganta jinkiri na ƙaramin sabis ɗaya na iya yin tasiri kaɗan akan jimillar jinkirin da mai amfani ya gane idan wani sabis a cikin sarkar ya kasance cikas. Wannan yana haifar da rarraba albarkatu mara inganci—yawan tanadi wasu ayyuka yayin da ake ƙarancin tanadi ga mahimman cikas—wanda ke haifar da farashi mafi girma ba tare da cimma manufar ƙayyadaddun matakin sabis (SLO) na jinkiri da ake so ba.

3. COLA: Hanyar Haɗin Kai na Sarrafa Girma ta Atomatik

COLA tana sake fasalin matsalar sarrafa girma ta atomatik a matsayin matsala mai ƙuntatawa ta ingantawa. Tana maye gurbin masu sarrafa girma masu zaman kansu da yawa da mai sarrafawa guda ɗaya, mai cibiyar sadarwa wanda ke da hangen nesa na duniya akan topology da aikin ƙananan ayyuka na aikace-aikacen.

3.1. Tsarin Ingantawa na Asali

An tsara manufar kamar haka:

  • Manufa: Rage jimillar farashin lissafi.
  • Ƙuntatawa: Matsakaicin jinkirin ƙarshe-zuwa-ƙarshe na aikace-aikace ko jinkirin wutsiya ≤ Manufar Jinkiri.
  • Masu Canji na Shawara: Adadin VMs (ko kwafi) da aka raba wa kowane ƙaramin sabis $i$, wanda aka nuna shi da $n_i$.

Wannan matsala ce mai rikitarwa, mara layi ta ingantawa saboda alaƙar tsakanin $n_i$ da jinkirin ƙarshe-zuwa-ƙarshe ba ta kai tsaye ba kuma ta dogara da tsarin aiki da sadarwar tsakanin sabis.

3.2. Tsarin Bincike na Kashe Layi

Magance wannan ingantawa akan layi ba shi da amfani saboda lokacin da ake buƙata don tanadi da daidaitawar aiki. Saboda haka, COLA tana amfani da tsarin bincike na kashe layi:

  1. Aikace-aikacen Aiki: Aiwatar da nauyin aiki mai wakilci ga aikace-aikacen.
  2. Gano Cikas: Gano ƙaramin sabis mafi cunkoso (mafi girman haɓakar amfani da CPU a ƙarƙashin nauyi).
  3. Rarraba Albarkatu ta Matsalar Bandit: Ga sabis na cikas, ƙayyade mafi kyawun adadin VMs ta amfani da tsarin bandit mai hannu da yawa. Aikin "lada" yana daidaita haɓakar jinkiri da haɓakar farashi.
  4. Maimaitawa: Maimaita matakai na 2-3 don ƙaramin sabis na gaba mafi cunkoso har sai an cimma manufar jinkiri ta duniya.
  5. Samar da Manufa: Sakamakon shine manufar daidaitawa (taswira daga halayen aiki zuwa rarraba albarkatu) wanda za'a iya turawa akan layi.

COLA na iya shiga tsakanin nauyin aiki da aka sani kuma ta koma ga masu sarrafa girma ta atomatik na asali idan ta fuskanci tsarin aiki da ba a gani ba.

4. Cikakkun Bayanai na Fasaha & Tsarin Lissafi

Za a iya wakilta babbar matsalar ingantawa a taƙaice kamar haka:

$$\min_{\{n_i\}} \sum_{i=1}^{M} C_i(n_i)$$ $$\text{ƙarƙashin sharadi: } L_{e2e}(\{n_i\}, \lambda) \leq L_{target}$$ $$n_i \in \mathbb{Z}^+$$ Ina:

  • $M$: Adadin ƙananan ayyuka.
  • $n_i$: Adadin raka'a albarkatu (misali, VMs) don ƙaramin sabis $i$.
  • $C_i(n_i)$: Aikin farashi don ƙaramin sabis $i$ tare da raka'a $n_i$.
  • $L_{e2e}$: Aikin jinkirin ƙarshe-zuwa-ƙarshe, ya dogara da duk $n_i$ da ƙarfin nauyin aiki $\lambda$.
  • $L_{target}$: Manufar jinkirin SLO da ake so.
"Matsalar bandit" a mataki na 3 na binciken COLA ta ƙunshi ɗaukar kowane yuwuwar rarraba VM don sabis na cikas a matsayin "hannu". Ja da hannu yana dacewa da tanadin wannan tsari da auna sakamakon ciniki na farashi-jinkiri. Ana iya amfani da algorithms kamar Upper Confidence Bound (UCB) don bincika da amfani da sararin tsari yadda ya kamata.

5. Sakamakon Gwaji & Kimantawa

An kimanta COLA sosai da wasu masu sarrafa girma ta atomatik na asali (na tushen amfani da na ML) akan Google Kubernetes Engine (GKE).

5.1. Saitin Gwaji

  • Aikace-aikace: 5 aikace-aikacen ƙananan ayyuka na buɗe tushe (misali, Simple WebServer, BookInfo, Online Boutique).
  • Dandamali: GKE Standard (nodes masu sarrafa mai amfani) da GKE Autopilot (kayan aiki masu sarrafa mai bayarwa).
  • Layukan Asali: Daidaitaccen HPA (na tushen CPU), masu sarrafa girma ta atomatik na ML na ci gaba.
  • Nauyin Aiki: 63 nau'ikan tsarin aiki daban-daban.
  • Manufa: Cika ƙayyadaddun matsakaicin jinkiri ko wutsiya (misali, p95) SLO.

5.2. Ma'auni Mafi Muhimmanci na Aiki

Cimma SLO

53/63

Nauyin aiki inda COLA ta cimma manufar jinkiri.

Rage Farashin Matsakaici

19.3%

Idan aka kwatanta da mai sarrafa girma ta atomatik mafi arha na gaba.

Manufa Mafi Tasiri na Farashi

48/53

COLA ita ce mafi arha ga 48 daga cikin nauyin aiki 53 da suka yi nasara.

Mafi Kyawun Aiki akan Ƙananan Aikace-aikace

~90%

Ga ƙananan aikace-aikace inda bincike mai zurfi ya yiwu, COLA ta samo mafi kyawun tsari a cikin ~90% na lokuta.

5.3. Taƙaitaccen Sakamako

Sakamakon ya nuna babbar fa'idar COLA. Ta ci gaba da cimma manufar jinkirin SLO da ake so inda wasu suka kasa, kuma ta yi hakan da farashi mai rahusa sosai. Kudin ceton ya kasance da gaske har "kudin horarwa" na gudanar da binciken kashe layi na COLA an dawo da shi cikin ƴan kwanaki na aiki. A kan GKE Autopilot, fa'idodin COLA sun fi bayyana, yayin da ta yi nasarar kewaya abstraction na mai bayarwa don rage farashi.

Bayanin Chati (Tunani): Za a iya nuna chati na sanduna mai nuna "Farashin Kowane Buƙatu Mai Nasara" ko "Jimillar Farashin Gungu" akan Y-axis, tare da masu sarrafa girma ta atomatik daban-daban (COLA, HPA, ML-A) akan X-axis. Sandar COLA za ta kasance ƙasa sosai. Wani chati na biyu zai iya nuna "Ƙimar Keta SLO na Jinkiri," inda sandar COLA ta kusanci sifili yayin da wasu ke nuna ƙimar keta mafi girma.

6. Tsarin Bincike & Misalin Hali

Hangen Nesa na Manazarcin: Ragewa ta Matakai Hudu

Fahimta ta Asali: Babban nasarar takardar ba sabon algorithm ne mai ban sha'awa ba, amma canji mai mahimmanci a cikin hangen nesa: ɗaukar dukan aikace-aikacen ƙananan ayyuka a matsayin tsarin guda ɗaya da za a inganta, ba tarin sassa masu zaman kansu ba. Wannan yayi kama da canjin da aka samu a hangen nesa na kwamfuta ta hanyar samfura kamar CycleGAN (Zhu et al., 2017), wanda ya wuce fassarar hoto biyu ta hanyar la'akari da daidaiton zagaye na duk yankin canji. COLA tana amfani da irin wannan "ka'idar daidaiton duniya" ga sarrafa albarkatu.

Kwararar Ma'ana: Hujjar tana da sauƙi mai jan hankali: 1) Mafi kyawun gida (daidaitawa kowane sabis) ya haɗa zuwa rashin inganci na duniya. 2) Saboda haka, yi amfani da manufa ta duniya (farashi) tare da ƙuntatawa ta duniya (jinkirin ƙarshe-zuwa-ƙarshe). 3) Tunda magance wannan akan layi yana da wuƙa sosai, magance shi ta hanyar bincike kashe layi kuma a turawa manufar. Kyawun yana cikin amfani da matsalar bandit don sanya binciken don mafi kyawun rarraba cikas ya zama mai inganci, dabarar da bincike mai yawa a cikin ƙarfafa koyo don ingantawar tsarin (misali, aiki daga RISELab na UC Berkeley) ke goyan bayan.

Ƙarfi & Aibobi: Ƙarfi: Sakamakon gwaji yana da kyau sosai—rage farashi na 19.3% adadi ne na matakin ɗakin zartarwa. Hanyar kashe layi tana da hankali, tana guje wa rashin kwanciyar hankali na lokacin aiki. Tsarin ba shi da alaƙa da dandamali. Aibobi: Achilles heel shine dogaro ga nauyin aiki na wakilci na kashe layi. A cikin aikace-aikace masu saurin ci gaba ko ƙarƙashin abubuwan zirga-zirgar "baƙar fata," manufar da aka riga aka lissafta na iya zama tsoho ko bala'i. Komawar takardar zuwa masu sarrafa girma ta atomatik na asali bandeji ne, ba magani ba, ga wannan matsalar ƙarfi. Bugu da ƙari, rikitarwar bincike mai yiwuwa tana da ƙarancin ma'auni tare da adadin ƙananan ayyuka, mai yuwuwa ta iyakance amfani da shi a cikin aikace-aikace masu girma sosai, masu rikitarwa.

Fahimta Mai Aiki: Ga masu gine-ginen girgije, saƙon yana bayyana: daina saita ƙofofin CPU da kansu. Saka hannun jari a cikin gina ko karɓar lura da aikin duniya da injin yanke shawara na tsakiya. Fara da hanyar haɗin gwiwa: yi amfani da falsafar COLA don ayyana mahimman sarƙoƙin sabis kuma a yi amfani da daidaitawar haɗin kai a can, yayin barin sabis masu zaman kansu marasa mahimmanci akan HPA na gargajiya. ROI, kamar yadda aka nuna, na iya zama sauri. Ya kamata masu bayar da sabis na girgije su lura; kayan aiki kamar GKE Autopilot suna buƙatar irin waɗannan yadudduka masu hankali na kaɗa don gaske cika alkawarin kayan aiki "masu sarrafawa".

7. Hangen Nesa na Aikace-aikace & Hanyoyin Gaba

Ka'idojin da ke bayan COLA suna da fa'ida mai faɗi fiye da daidaitawar VM na asali:

  • Haɗin Kai na Albarkatu Da Yawa & Daidaitawa Daban-daban: Siffofin gaba na iya yanke shawara tare kan girman VM (ingantaccen ƙwaƙwalwar ajiya da na lissafi), rarraba GPU, har ma da sanyawa a cikin yankuna masu wadatarwa ko masu bayar da sabis na girgije don farashi da juriya.
  • Haɗin Kai tare da Meshes na Sabis: Haɗa COLA tare da mesh na sabis (kamar Istio) zai samar da telemetry mai wadata (binciken matakin buƙatu, zane-zane na dogaro) har ma da ba da damar sarrafa kai tsaye kan hanyar zirga-zirga da karya da'ira a matsayin wani ɓangare na ingantawa.
  • Daidaitawa akan Layi & Meta-Koyo: Babban iyakar bincike shine shawo kan iyakancewar kashe layi. Dabarun daga meta-koyo na iya ba da damar COLA ta daidaita manufarta akan layi da sauri bisa ra'ayi na ainihi, ko don bincika sabbin tsare-tsare cikin aminci a lokutan ƙarancin zirga-zirga.
  • Manufofin Lissafi na Kore: Manufar ingantawa za a iya faɗaɗa ta don rage sawun carbon ko amfani da makamashi, daidaitawa da shirye-shiryen lissafi mai dorewa, ta hanyar haɗa bayanai daga tushe kamar aikin Sawun Carbon na Girgije.
  • Kasuwar Manufofi: Don tsarin aikace-aikace na gama-gari (misali, kasuwanci ta e-commerce, watsa shirye-shiryen kafofin watsa labarai), za a iya raba ko sayar da manufofin COLA da aka riga aka inganta, yana rage buƙatar gudanar da horo na mutum ɗaya.

8. Nassoshi

  1. Sachidananda, V., & Sivaraman, A. (2022). COLA: Collective Autoscaling for Cloud Microservices. arXiv preprint arXiv:2112.14845v3.
  2. Zhu, J., Park, T., Isola, P., & Efros, A. A. (2017). Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks. Proceedings of the IEEE International Conference on Computer Vision (ICCV).
  3. Burns, B., Grant, B., Oppenheimer, D., Brewer, E., & Wilkes, J. (2016). Borg, Omega, and Kubernetes. Queue, 14(1), 70–93.
  4. Hoffman, M., Shahriari, B., & Aslanides, J. (2020). Addressing Function Approximation Error in Actor-Critic Methods. Proceedings of the 37th International Conference on Machine Learning (ICML). (Misalin RL na ci gaba mai dacewa don daidaitawa akan layi).
  5. Cloud Carbon Footprint. (n.d.). An open source tool to measure and visualize the carbon footprint of cloud usage. Retrieved from https://www.cloudcarbonfootprint.org/.
  6. Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., & Wilkes, J. (2015). Large-scale cluster management at Google with Borg. Proceedings of the European Conference on Computer Systems (EuroSys).