為了使本技術領域的人員更好地理解本申請案中的技術方案，下面將結合本申請案實施例中的附圖，對本申請案實施例中的技術方案進行清楚、完整地描述，顯然，所描述的實施例僅僅是本申請案一部分實施例，而不是全部的實施例。基於本申請案中的實施例，本領域普通技術人員在沒有作出進步性勞動前提下所獲得的所有其他實施例，都應當屬於本申請案保護的範圍。
本申請案實施例提供了一種服務更新方法及裝置、系統，基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
圖1為本申請案實施例提供的服務更新的應用場景示意圖，如圖1所示，在圖1中涉及多個待服務更新的服務節點，該服務節點為網際網路服務或雲端計算服務的託管者，可以是物理機、虛擬容器、或伺服器軟體等，在子更新資料初次分發階段，即首次將由服務更新資料分割得到的多個子更新資料分發給多個服務節點的過程，每個子更新資料被分發到至少一個服務節點中；隨之進入子更新資料的擴散階段，隨著子更新資料的不斷擴散，每個子更新資料所在的服務節點的數量越來越多，每個服務節點儲存的子更新資料的個數也越來越多，任一服務節點收集所有子更新資料後，合併得到完整的服務更新資料，並利用該服務更新資料完成本機服務更新。其中，在需要對產品功能和服務進行更新部署時，先更新待服務更新的所有服務節點上的相關軟體或配置，在服務更新過程中，具有跨機房、分散式去中心化、容錯機制、系統無關、硬體無關的特點，充分利用服務節點之間、機房之間的網路資源和計算資源，保證子更新資料快速、高效、安全、可靠地在多服務節點中擴散。最終，每個待服務更新的服務節點均合併得到一份完整的服務更新資料，從而實現多服務節點的服務更新。
圖2為本申請案實施例提供的服務更新方法的第一種流程示意圖，圖2中的方法能夠由圖1中的服務節點100執行，適用於網際網路服務和雲端計算服務的服務更新部署，如圖2所示，該方法至少包括以下步驟：
S201，在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，其中，該多個子更新資料為預先由服務更新資料分割後得到的，第一服務節點為待服務更新的多個服務節點中的任一服務節點，由於任一服務節點不僅參與子更新資料的擴散，且自身也需要進行服務更新，因此，在子更新資料由一個服務節點擴散到其他服務節點的過程中，傳輸的子更新資料是服務更新資料分割後得到的資料子塊的資料副本。其中，第一服務節點獲取到的多個子更新資料可以來自第一服務節點以外的部分服務節點，也可以是來自第一服務節點以外的全部服務節點。
S202，將獲取到的多個子更新資料進行合併，得到用於服務更新的服務更新資料，具體的，獲取到所有的子更新資料後，將多個子更新資料還原成分割前的服務更新資料。
S203，根據合併得到的服務更新資料，對第一服務節點進行服務更新，具體的，在由多個子更新資料合併得到完整的服務更新資料後，如果本次服務更新為原應用服務的升級，則利用該服務更新資料替代與待升級服務相關的原服務資料，如果本次服務更新為新增應用服務，則將該服務更新資料添加至原服務資料，再重啟本服務節點服務。
例如，針對支付寶應用中新增的“發紅包賺賞金”功能，需要將實現“發紅包賺賞金”應用服務的服務更新資料分割為多個子更新資料，再採用步驟S201至S203使得各提供該應用服務的服務節點獲取到所有子更新資料並合併為服務更新資料，各服務節點利用該服務更新資料更新本地應用服務，進而對客戶端提供相應的應用服務。
本申請案實施例中，基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
其中，如圖3所示，在S201在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料之前，還包括：
S204，接收服務更新請求，其中，該服務更新請求攜帶有由服務更新資料分割得到的所有子更新資料的資料標識；具體的，每個子更新資料對應於一個資料標識，例如，可以將資料序號作為子更新資料的資料標識，以服務更新資料被分割成m個子更新資料為例，首個子更新資料的資料標識為1，最後一個自更新資料的資料標識為m。
對應的，上述S201在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，具體包括：
S2011，在待服務更新的多個服務節點中，根據接收到的服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各資料標識對應的子更新資料。
在具體實施時，如圖4a所示，在待服務更新的N個服務節點中，將服務更新資料上傳至任一服務節點(如，服務節點k)，該服務節點接收到服務更新資料後，將服務更新資料分割為多個子更新資料(如，分割為m個子更新資料)；在待服務更新的多個服務節點中，如圖4b所示，選取目標數量的服務節點作為首發服務節點(如，首發服務節點的數量為x，)，將多個子更新資料分發給多個首發服務節點(如，將m個子更新資料分發給x個首發服務節點)，此時，針對每個首發服務節點，該首發服務節點至少接收到一個子更新資料，針對每個子更新資料，該子更新資料至少在一個首發服務節點上存在，此過程為子更新資料初次分發階段，其中，如果第一服務節點屬於首發服務節點，則接收服務節點k的服務更新請求；如果第一服務節點不屬於首發服務節點，則接收服務節點k或任一首發服務節點的服務更新請求。隨之進入子更新資料的擴散階段，如圖4c所示，各子更新資料在多個服務節點之間進行擴散，最終，每個服務節點獲取到所有子更新資料，如圖4d所示，將獲取到的多個子更新資料進行合併，得到用於服務更新的服務更新資料。
具體的，針對第一服務節點屬於首發服務節點的情況，上述S204接收服務更新請求，具體包括：
接收初次分發的至少一個子更新資料和更新資料分割資訊，其中，該更新資料分割資訊包括：由服務更新資料分割得到的所有子更新資料的資料標識，且每個子更新資料均被分發到至少一個服務節點。
其中，如果第一服務節點參與子更新資料初次分發階段，第一服務節點接收到的服務更新請求中可以同時攜帶至少一個子更新資料和更新資料分割資訊，第一服務節點接收到初次分發的至少一個子更新資料後，參與後續的子更新資料的擴散階段，將本地已儲存的子更新資料傳輸至需要該子更新資料的服務節點，以及從其他服務節點中獲取本地不存在的子更新資料。
針對第一服務節點不屬於首發服務節點的情況，第一服務節點直接進入子更新資料的擴散階段，第一服務節點接收到的服務更新請求中可以只攜帶更新資料分割資訊，根據該更新資料分割資訊向其他服務節點獲取本地不存在的子更新資料，同時獲取到子更新資料後，如果接收到子更新資料獲取請求，則將本地已儲存的子更新資料傳輸至需要該子更新資料的服務節點。
進一步的，考慮到初次分發時可能存在資料丟包、或者服務節點未將接收到的子更新資料擴散到其他服務節點時出現異常，導致子更新資料無法正常擴散到所有服務節點，為了確保各待服務更新的服務節點均能夠獲取到所有子更新資料，基於此，由服務更新資料分割得到的每個子更新資料均被分發到至少兩個服務節點，即將同一子更新資料分發給兩個首發服務節點。
具體的，在子更新資料初次分發階段，即將多個子更新資料分發給多個首發服務節點的過程中，將同一子更新資料分發給至少兩個首發服務節點，此時，在待服務更新的多個服務節點中，每個子更新資料儲存於至少兩個服務節點中，這樣即使某一服務節點出現異常，仍可以從另一服務節點中獲取子更新資料，保證了各子更新資料均能夠正常擴散到所有服務節點，進而確保各待服務更新的服務節點均能夠獲取到所有子更新資料，提高了服務更新資料發佈成功率。
其中，如圖5所示，上述S2011在待服務更新的多個服務節點中，根據接收到的服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各資料標識對應的子更新資料，具體包括：
S20111，分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，其中，該子更新資料儲存資訊包括：服務節點上已儲存的子更新資料的資料標識。
S20112，針對服務更新請求中每個資料標識，判斷第一服務節點是否存在與該資料標識對應的子更新資料；具體的，按照預設順序，逐一查詢本地是否存在各資料標識對應的子更新資料，如果不存在，則向已儲存有該子更新資料的服務節點獲取。
若否，則執行S20113，根據各子更新資料儲存資訊和本地不存在的子更新資料對應的目標資料標識，選取一個服務節點作為目標服務節點，以及從該目標服務節點中獲取目標資料標識對應的子更新資料。
其中，第一服務節點獲取到除自身以外的各服務節點的子更新資料儲存資訊後，可以確定各子更新資料分佈在哪些服務節點中，進而有針對性地從目標服務節點中獲取本地不存在的子更新資料，直到本機存放區有所有資料標識對應的子更新資料，具體的，第一服務接節點可以同時從至少兩個不同的服務節點中獲取不同的資料標識對應的子更新資料，並且，所有服務節點能夠同時獲取各自所需的子更新資料，將資料處理負載和資料傳輸負載分配到所有服務節點上，大大節省了服務更新資料獲取時間，提高了多服務節點的服務更新效率和成功率。
進一步的，考慮到在確定目標服務節點的過程中，如果待服務更新的服務節點的數量比較多，那麼獲取到的子更新資料儲存資訊的數量也較多，為了提高目標服務節點確定效率，基於此，上述S20113根據各子更新資料儲存資訊和本地不存在的子更新資料對應的目標資料標識，選取一個服務節點作為目標服務節點，具體包括：
根據各子更新資料儲存資訊，確定子更新資料分佈資訊，其中，該子更新資料分佈資訊包括：服務更新請求中各資料標識對應的子更新資料所在的服務節點的資訊。
根據子更新資料分佈資訊和本地不存在的子更新資料對應的目標資料標識，選取一個服務節點作為目標服務節點。
具體的，在接收到除自身以外的多個服務節點的子更新資料儲存資訊後，先對接收到的多個子更新資料儲存資訊進行匯總，得到子更新資料分佈資訊，在子更新資料分佈資訊中，直接查詢到各資料標識與儲存該資料標識對應的子更新資料的服務節點的資訊之間的對應關係，例如，資料標識1—服務節點A\B\C，即服務節點A、服務節點B、服務節點C中儲存有資料標識1對應的子更新資料，如果需要獲取資料標識1對應的子更新資料，此時可以從服務節點A、服務節點B、服務節點C中選擇一個作為目標服務節點，這樣一目了然得知目標資料標識對應的子更新資料分佈在哪些服務節點中，快速定位到目標服務節點。
進一步的，為了更加充分利用各服務節點的計算資源和網路資源，避免出現某個服務節點負載率很高，而其他服務節點負載率很低的情況，達到多服務節點的負載均衡的效果，基於此，上述根據子更新資料分佈資訊和本地不存在的子更新資料對應的目標資料標識，選取一個服務節點作為目標服務節點，具體包括：
基於子更新資料分佈資訊，將已儲存目標資料標識對應的子更新資料的多個服務節點作為備選服務節點，其中，該目標資料標識為本地不存在的子更新資料對應的資料標識。
根據各備選服務節點的負載率，將負載率最低的備選服務節點確定為目標服務節點。
具體的，在選取目標服務節點的過程中，參考備選服務節點的負載情況，在多個服務節點都存在目標資料標識對應的子更新資料的情況下，將負載率最低的備選服務節點確定為目標服務節點，這樣能夠實現更加充分利用各服務節點的計算資源和網路資源，達到多服務節點的負載均衡的效果，進而更進一步地提高多服務節點的服務更新效率。
具體的，在從目標服務節點中獲取目標資料標識對應的子更新資料之後，還包括：
若子更新資料獲取失敗，則按照負載率由低至高的順序重新選擇下一個目標服務節點，並從重新選擇的目標服務節點中獲取目標資料標識對應的子更新資料。
其中，針對只有一個服務節點儲存有目標資料標識對應的子更新資料的情況，需要等待該目標服務節點恢復後，繼續從該目標服務節點中獲取所需的子更新資料。為了避免該情況的發生，在具體實施時，在子更新資料初次分發階段，將同一子更新資料分發給至少兩個首發服務節點，可以保證至少兩個服務節點儲存有目標資料標識對應的子更新資料；另外，即使在子更新資料初次分發階段，將同一子更新資料只分發給一個首發服務節點，而隨著子更新資料的不斷擴散，也能夠保證至少兩個服務節點儲存有目標資料標識對應的子更新資料，提供了資料獲取失敗冗餘機制，提高了服務更新資料發佈成功率。
針對至少兩個服務節點儲存有目標資料標識對應的子更新資料的情況，第一服務節點從某一目標服務節點獲取子更新資料失敗後，則變更服務節點重新獲取子更新資料，具體的，在服務更新過程中，若子更新資料獲取失敗，則說明目標服務節點出現異常，此時，第一服務節點重新選取下一個目標服務節點。
另外，當出現異常的目標服務節點恢復正常後，該目標服務節點繼續執行：分別獲取本服務節點以外的多個服務節點的子更新資料儲存資訊；針對服務更新請求中每個資料標識，判斷本地是否存在與該資料標識對應的子更新資料；若否，則根據最新版本的各子更新資料儲存資訊和該資料標識，選取一個服務節點作為目標服務節點，以及從該目標服務節點中獲取資料標識對應的子更新資料，直到獲取到所有子更新資料。
其中，針對獲取子更新資料儲存資訊的過程可以通過如下兩種方式獲得，具體為：
第一種方式：每個服務節點的子更新資料存在更新時，主動向其他服務節點廣播更新後的子更新資料儲存資訊，具體的，上述 S20111分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，具體包括：
接收第一服務節點以外的多個服務節點廣播的子更新資料儲存資訊，其中，該子更新資料儲存資訊為第一服務節點以外的多個服務節點在獲取到新的子更新資料且更新本地的子更新資料儲存資訊後得到的。
第二種方式：每個服務節點接收到其他服務節點的子資料儲存資訊獲取請求後，才向相應的服務節點發送最新版本的子更新資料儲存資訊，具體的，上述S20111分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，具體包括：
向第一服務節點以外的各服務節點發送子資料儲存資訊獲取請求；
接收第一服務節點以外的各服務節點發送的本地最新版本的子更新資料儲存資訊，其中，該子更新資料儲存資訊為第一服務節點以外的各服務節點回應於子資料儲存資訊獲取請求發送的。
其中，針對合併子更新資料的過程，具體的，上述S202將獲取到的多個子更新資料進行合併，得到用於服務更新的服務更新資料，具體包括：
按照資料標識由小到大的順序，對獲取到的多個子更新資料進行排序；
根據排序結果，將各子更新資料組合得到用於服務更新的服務更新資料。
其中，針對每個服務節點而言，該服務節點不僅向其他服務節點獲取子更新資料，還需要基於其他服務節點的子更新資料獲取請求，向相應的服務節點發送子更新資料，基於此，上述方法還包括：
接收第一服務節點以外的各服務節點發送的子更新資料獲取請求；
將與接收到的獲取請求對應的子更新資料發送至相應的服務節點，以使接收到該子更新資料的服務節點判斷本地是否儲存有所有子更新資料，如果是，則進行本機服務更新，即第一服務節點也參與子更新資料的擴散。
其中，針對每個服務節點而言，該服務節點不僅向其他服務節點獲取子更新資料儲存資訊，還需要向其他服務節點發送本地最新版本的子更新資料儲存資訊，基於此，上述方法還包括：
將本地最新版本的子更新資料儲存資訊發送至相應的服務節點，以使接收到該子更新資料儲存資訊的服務節點確定目標服務節點，並從該目標服務節點獲取子更新資料。
具體的，針對發送子更新資料儲存資訊的過程可以通過如下兩種方式實現，具體為：
第一種方式：第一服務節點的子更新資料存在更新時，主動向其他服務節點廣播更新後的子更新資料儲存資訊，具體的，上述將本地最新版本的子更新資料儲存資訊發送至相應的服務節點，具體包括：
在獲取到新的子更新資料後，更新本地的子更新資料儲存資訊；
將更新後的子更新資料儲存資訊廣播至第一服務節點以外的多個服務節點。
第二種方式：第一服務節點接收到其他服務節點的子資料儲存資訊獲取請求後，才向該服務節點發送最新版本的子更新資料儲存資訊，具體的，上述將本地最新版本的子更新資料儲存資訊發送至相應的服務節點，具體包括：
接收第一服務節點以外的任一服務節點發送子資料儲存資訊獲取請求；
將本地最新版本的子更新資料儲存資訊傳輸至發送子資料儲存資訊獲取請求的服務節點。
本申請案實施例中的服務更新方法，在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料；將獲取到的多個子更新資料進行合併，得到服務更新資料；根據合併得到的服務更新資料，對第一服務節點進行服務更新。基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
對應上述圖2至圖5描述的服務更新方法，基於相同的技術構思，本申請案實施例還提供了一種服務更新裝置，圖6為本申請案實施例提供的服務更新裝置的第一種模組組成示意圖，該裝置用於執行圖2至圖5描述的服務更新方法，如圖6所示，該裝置包括：
子資料獲取模組601，用於在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，其中，所述多個子更新資料為預先由服務更新資料分割後得到的；
更新資料生成模組602，用於將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料；
服務更新模組603，用於根據合併得到的所述服務更新資料，對所述第一服務節點進行服務更新。
可選地，如圖7所示，上述裝置還包括：
更新請求接收模組604，用於在從第一服務節點以外的多個服務節點中獲取多個子更新資料之前，接收服務更新請求，其中，所述服務更新請求攜帶有由服務更新資料分割得到的所有子更新資料的資料標識；
所述子資料獲取模組601，具體用於：
根據所述服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各所述資料標識對應的子更新資料。
可選地，所述更新請求接收模組604，具體用於：
接收初次分發的至少一個子更新資料和更新資料分割資訊，其中，所述更新資料分割資訊包括：由服務更新資料分割得到的所有子更新資料的資料標識，且每個子更新資料均被分發到至少一個服務節點。
可選地，由服務更新資料分割得到的每個子更新資料均被分發到至少兩個服務節點。
可選地，所述子資料獲取模組601，進一步具體用於：
分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，其中，所述子更新資料儲存資訊包括：服務節點上已儲存的子更新資料的資料標識；
針對所述服務更新請求中每個資料標識，判斷所述第一服務節點是否存在與該資料標識對應的子更新資料；
若否，則根據各所述子更新資料儲存資訊和所述資料標識，選取一個服務節點作為目標服務節點，以及從所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，所述子資料獲取模組601，更進一步具體用於：
根據各所述子更新資料儲存資訊，確定子更新資料分佈資訊，其中，所述子更新資料分佈資訊包括：所述服務更新請求中各資料標識對應的子更新資料所在的服務節點的資訊；
根據所述子更新資料分佈資訊和所述資料標識，選取一個服務節點作為目標服務節點。
可選地，所述子資料獲取模組601，再進一步具體用於：
基於所述子更新資料分佈資訊，將已儲存所述資料標識對應的子更新資料的多個服務節點作為備選服務節點；
根據各所述備選服務節點的負載率，將負載率最低的備選服務節點確定為目標服務節點。
可選地，上述子資料獲取模組601，還具體用於：
在從所述目標服務節點中獲取所述資料標識對應的子更新資料之後，若子更新資料獲取失敗，則按照負載率由低至高的順序重新選擇下一個目標服務節點，並從重新選擇的所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，所述子資料獲取模組601，更進一步具體用於：
接收第一服務節點以外的多個服務節點廣播的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的多個服務節點在獲取到新的子更新資料且更新本地的子更新資料儲存資訊後得到的。
可選地，所述子資料獲取模組601，更進一步具體用於：
向第一服務節點以外的各服務節點發送子資料儲存資訊獲取請求；
接收第一服務節點以外的各服務節點發送的本地最新版本的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的各服務節點回應於所述子資料儲存資訊獲取請求發送的。
可選地，所述更新資料生成模組602，具體用於：
按照資料標識由小到大的順序，對所述多個子更新資料進行排序；
根據排序結果，將各所述子更新資料組合得到所述服務更新資料。
可選地，上述裝置還包括：
子更新資料發送模組605，用於接收第一服務節點以外的各服務節點發送的子更新資料獲取請求；將與所述獲取請求對應的子更新資料發送至相應的服務節點。
可選地，上述裝置還包括：
儲存資訊發送模組606，用於將本地最新版本的子更新資料儲存資訊發送至相應的服務節點。
本申請案實施例中的服務更新裝置，在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料；將獲取到的多個子更新資料進行合併，得到服務更新資料；根據合併得到的服務更新資料，對第一服務節點進行服務更新。基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
本發明實施例提供的服務更新裝置能夠實現上述服務更新方法對應的實施例中的各個過程，為避免重複，這裡不再贅述。
進一步地，對應上述圖2至圖5所示的方法，基於相同的技術構思，本申請案實施例還提供了一種服務更新系統，如圖8所示，該系統包括：待服務更新的多個服務節點100，兩兩服務節點100之間通信連接，每個服務節點100設置有上述服務更新裝置；其中，由服務更新資料分割得到的多個子更新資料(即資料子塊1至m)在服務節點100之間擴散，以使各服務節點100均獲取到所有子更新資料。
具體的，任一待服務更新的第一服務節點，用於在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，其中，所述多個子更新資料為預先由服務更新資料分割後得到的；將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料；根據合併得到的所述服務更新資料，對所述第一服務節點進行服務更新。
進一步的，所述第一服務節點，還用於：
接收服務更新請求，其中，所述服務更新請求攜帶有由服務更新資料分割得到的所有子更新資料的資料標識；
根據所述服務更新請求，分別獲取與各所述資料標識對應的子更新資料。
進一步的，所述多個服務節點中任一服務節點(即上述服務節點k)，用於：
接收服務更新資料和資料分割指示；
根據所述資料分割指示，將所述服務更新資料分割為多個子更新資料；
從多個待服務更新的服務節點中，選取目標數量的多個初始分配節點，其中，該初始分配節點相當於上述首發服務節點；
向所述多個初始分配節點發送服務更新請求，其中，所述服務更新請求攜帶有初次分發的至少一個子更新資料和更新資料分割資訊，每個子更新資料被分發給至少一個已選取的初始分配節點。
進一步的，每個子更新資料被分發給至少兩個已選取的初始分配節點。
本申請案實施例中的服務更新系統，針對任一服務節點，在待服務更新的多個服務節點中，從本服務節點以外的多個服務節點中獲取多個子更新資料；將獲取到的多個子更新資料進行合併，得到服務更新資料；根據合併得到的服務更新資料，對第一服務節點進行服務更新。基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
本發明實施例提供的服務更新系統能夠實現上述服務更新方法對應的實施例中的各個過程，為避免重複，這裡不再贅述。
進一步地，對應上述圖2至圖5所示的方法，基於相同的技術構思，本申請案實施例還提供了一種服務更新設備，該設備用於執行上述的服務更新方法，如圖9所示。
服務更新設備可因配置或性能不同而產生比較大的差異，可以包括一個或一個以上的處理器901和記憶體902，記憶體902中可以儲存有一個或一個以上儲存應用程式或資料。其中，記憶體902可以是短暫儲存或持久儲存。儲存在記憶體902的應用程式可以包括一個或一個以上模組(圖示未示出)，每個模組可以包括對服務更新設備中的一系列電腦可執行指令。更進一步地，處理器901可以設置為與記憶體902通信，在服務更新設備上執行記憶體902中的一系列電腦可執行指令。服務更新設備還可以包括一個或一個以上電源903，一個或一個以上有線或無線網路介面904，一個或一個以上輸入輸出介面905，一個或一個以上鍵盤906等。
在一個具體的實施例中，服務更新設備包括有記憶體，以及一個或一個以上的程式，其中一個或者一個以上程式儲存於記憶體中，且一個或者一個以上程式可以包括一個或一個以上模組，且每個模組可以包括對服務更新設備中的一系列電腦可執行指令，且經配置以由一個或者一個以上處理器執行該一個或者一個以上套裝程式含用於進行以下電腦可執行指令：
在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，其中，所述多個子更新資料為預先由服務更新資料分割後得到的；
將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料；
根據合併得到的所述服務更新資料，對所述第一服務節點進行服務更新。
可選地，電腦可執行指令在被執行時，還包含用於進行以下電腦可執行指令：在從第一服務節點以外的多個服務節點中獲取多個子更新資料之前，還包括：
接收服務更新請求，其中，所述服務更新請求攜帶有由服務更新資料分割得到的所有子更新資料的資料標識；
所述從第一服務節點以外的多個服務節點中獲取多個子更新資料，包括：
根據所述服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各所述資料標識對應的子更新資料。
可選地，電腦可執行指令在被執行時，所述接收服務更新請求，包括：
接收初次分發的至少一個子更新資料和更新資料分割資訊，其中，所述更新資料分割資訊包括：由服務更新資料分割得到的所有子更新資料的資料標識，且每個子更新資料均被分發到至少一個服務節點。
可選地，電腦可執行指令在被執行時，由服務更新資料分割得到的每個子更新資料均被分發到至少兩個服務節點。
可選地，電腦可執行指令在被執行時，所述根據所述服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各所述資料標識對應的子更新資料，包括：
分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，其中，所述子更新資料儲存資訊包括：服務節點上已儲存的子更新資料的資料標識；
針對所述服務更新請求中每個資料標識，判斷所述第一服務節點是否存在與該資料標識對應的子更新資料；
若否，則根據各所述子更新資料儲存資訊和所述資料標識，選取一個服務節點作為目標服務節點，以及從所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，電腦可執行指令在被執行時，所述根據各所述子更新資料儲存資訊和所述資料標識，選取一個服務節點作為目標服務節點，包括：
根據各所述子更新資料儲存資訊，確定子更新資料分佈資訊，其中，所述子更新資料分佈資訊包括：所述服務更新請求中各資料標識對應的子更新資料所在的服務節點的資訊；
根據所述子更新資料分佈資訊和所述資料標識，選取一個服務節點作為目標服務節點。
可選地，電腦可執行指令在被執行時，所述根據所述子更新資料分佈資訊和所述資料標識，選取一個服務節點作為目標服務節點，包括：
基於所述子更新資料分佈資訊，將已儲存所述資料標識對應的子更新資料的多個服務節點作為備選服務節點；
根據各所述備選服務節點的負載率，將負載率最低的備選服務節點確定為目標服務節點。
可選地，電腦可執行指令在被執行時，在從所述目標服務節點中獲取所述資料標識對應的子更新資料之後，還包括：
若子更新資料獲取失敗，則按照負載率由低至高的順序重新選擇下一個目標服務節點，並從重新選擇的所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，電腦可執行指令在被執行時，所述分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，包括：
接收第一服務節點以外的多個服務節點廣播的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的多個服務節點在獲取到新的子更新資料且更新本地的子更新資料儲存資訊後得到的。
可選地，電腦可執行指令在被執行時，所述分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，包括：
向第一服務節點以外的各服務節點發送子資料儲存資訊獲取請求；
接收第一服務節點以外的各服務節點發送的本地最新版本的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的各服務節點回應於所述子資料儲存資訊獲取請求發送的。
可選地，電腦可執行指令在被執行時，所述將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料，包括：
按照資料標識由小到大的順序，對所述多個子更新資料進行排序；
根據排序結果，將各所述子更新資料組合得到所述服務更新資料。
可選地，電腦可執行指令在被執行時，還包含用於進行以下電腦可執行指令：
接收第一服務節點以外的各服務節點發送的子更新資料獲取請求；
將與所述獲取請求對應的子更新資料發送至相應的服務節點。
可選地，電腦可執行指令在被執行時，還包含用於進行以下電腦可執行指令：
將本地最新版本的子更新資料儲存資訊發送至相應的服務節點。
本申請案實施例中的服務更新設備，在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料；將獲取到的多個子更新資料進行合併，得到服務更新資料；根據合併得到的服務更新資料，對第一服務節點進行服務更新。可見，通過本申請案實施例中的服務更新設備，基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
進一步地，對應上述圖2至圖5所示的方法，基於相同的技術構思，本申請案實施例還提供了一種儲存媒體，用於儲存電腦可執行指令，一種具體的實施例中，該儲存媒體可以為USB隨身碟、光碟、硬碟等，該儲存媒體儲存的電腦可執行指令在被處理器執行時，能實現以下流程：
在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料，其中，所述多個子更新資料為預先由服務更新資料分割後得到的；
將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料；
根據合併得到的所述服務更新資料，對所述第一服務節點進行服務更新。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，還實現以下流程：在從第一服務節點以外的多個服務節點中獲取多個子更新資料之前，還包括：
接收服務更新請求，其中，所述服務更新請求攜帶有由服務更新資料分割得到的所有子更新資料的資料標識；
所述從第一服務節點以外的多個服務節點中獲取多個子更新資料，包括：
根據所述服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各所述資料標識對應的子更新資料。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述接收服務更新請求，包括：
接收初次分發的至少一個子更新資料和更新資料分割資訊，其中，所述更新資料分割資訊包括：由服務更新資料分割得到的所有子更新資料的資料標識，且每個子更新資料均被分發到至少一個服務節點。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，由服務更新資料分割得到的每個子更新資料均被分發到至少兩個服務節點。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述根據所述服務更新請求，從第一服務節點以外的多個服務節點中分別獲取與各所述資料標識對應的子更新資料，包括：
分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，其中，所述子更新資料儲存資訊包括：服務節點上已儲存的子更新資料的資料標識；
針對所述服務更新請求中每個資料標識，判斷所述第一服務節點是否存在與該資料標識對應的子更新資料；
若否，則根據各所述子更新資料儲存資訊和所述資料標識，選取一個服務節點作為目標服務節點，以及從所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述根據各所述子更新資料儲存資訊和所述資料標識，選取一個服務節點作為目標服務節點，包括：
根據各所述子更新資料儲存資訊，確定子更新資料分佈資訊，其中，所述子更新資料分佈資訊包括：所述服務更新請求中各資料標識對應的子更新資料所在的服務節點的資訊；
根據所述子更新資料分佈資訊和所述資料標識，選取一個服務節點作為目標服務節點。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述根據所述子更新資料分佈資訊和所述資料標識，選取一個服務節點作為目標服務節點，包括：
基於所述子更新資料分佈資訊，將已儲存所述資料標識對應的子更新資料的多個服務節點作為備選服務節點；
根據各所述備選服務節點的負載率，將負載率最低的備選服務節點確定為目標服務節點。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，在從所述目標服務節點中獲取所述資料標識對應的子更新資料之後，還包括：
若子更新資料獲取失敗，則按照負載率由低至高的順序重新選擇下一個目標服務節點，並從重新選擇的所述目標服務節點中獲取所述資料標識對應的子更新資料。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，包括：
接收第一服務節點以外的多個服務節點廣播的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的多個服務節點在獲取到新的子更新資料且更新本地的子更新資料儲存資訊後得到的。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述分別獲取第一服務節點以外的多個服務節點的子更新資料儲存資訊，包括：
向第一服務節點以外的各服務節點發送子資料儲存資訊獲取請求；
接收第一服務節點以外的各服務節點發送的本地最新版本的子更新資料儲存資訊，其中，所述子更新資料儲存資訊為第一服務節點以外的各服務節點回應於所述子資料儲存資訊獲取請求發送的。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，所述將獲取到的所述多個子更新資料進行合併，得到所述服務更新資料，包括：
按照資料標識由小到大的順序，對所述多個子更新資料進行排序；
根據排序結果，將各所述子更新資料組合得到所述服務更新資料。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，還實現以下流程：
接收第一服務節點以外的各服務節點發送的子更新資料獲取請求；
將與所述獲取請求對應的子更新資料發送至相應的服務節點。
可選地，該儲存媒體儲存的電腦可執行指令在被處理器執行時，還實現以下流程：
將本地最新版本的子更新資料儲存資訊發送至相應的服務節點。
本申請案實施例中的儲存媒體儲存的電腦可執行指令在被處理器執行時，在待服務更新的多個服務節點中，從第一服務節點以外的多個服務節點中獲取多個子更新資料；將獲取到的多個子更新資料進行合併，得到服務更新資料；根據合併得到的服務更新資料，對第一服務節點進行服務更新。可見，通過本申請案實施例中的儲存媒體，基於預先將用於服務節點進行服務更新的服務更新資料分割為多個子更新資料，多個待服務更新的服務節點共用參與各子更新資料的擴散，任一服務節點用於服務更新的資料是從其他關聯服務節點中收集所有子更新資料後再合併得到的，有效利用多個服務節點的計算資源和網路資源，提高了多服務節點的服務更新效率，實現快速、高效、安全地對各服務節點進行服務更新。
在20世紀90年代，對於一個技術的改進可以很明顯地區分是硬體上的改進(例如，對二極體、電晶體、開關等電路結構的改進)還是軟體上的改進(對於方法流程的改進)。然而，隨著技術的發展，當今的很多方法流程的改進已經可以視為硬體電路結構的直接改進。設計人員幾乎都通過將改進的方法流程程式設計到硬體電路中來得到相應的硬體電路結構。因此，不能說一個方法流程的改進就不能用硬體實體模組來實現。例如，可程式設計邏輯裝置(Programmable Logic Device，PLD)(例如現場可程式設計閘陣列(Field Programmable Gate Array，FPGA))就是這樣一種積體電路，其邏輯功能由使用者對裝置程式設計來確定。由設計人員自行程式設計來把一個數位系統“集成”在一片PLD上，而不需要請晶片製造廠商來設計和製作專用的積體電路晶片。而且，如今，取代手工地製作積體電路晶片，這種程式設計也多半改用“邏輯編譯器(logic compiler)”軟體來實現，它與程式開發撰寫時所用的軟體編譯器相類似，而要編譯之前的原始代碼也得用特定的程式設計語言來撰寫，此稱之為硬體描述語言(Hardware Description Language，HDL)，而HDL也並非僅有一種，而是有許多種，如ABEL(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description Language)、Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby Hardware Description Language)等，目前最普遍使用的是VHDL(Very-High-Speed Integrated Circuit Hardware Description Language)與Verilog。本領域技術人員也應該清楚，只需要將方法流程用上述幾種硬體描述語言稍作邏輯程式設計並程式設計到積體電路中，就可以很容易得到實現該邏輯方法流程的硬體電路。
控制器可以按任何適當的方式實現，例如，控制器可以採取例如微處理器或處理器以及儲存可由該(微)處理器執行的電腦可讀程式碼(例如軟體或韌體)的電腦可讀媒體、邏輯閘、開關、專用積體電路(Application Specific Integrated Circuit，ASIC)、可程式設計邏輯控制器和嵌入微控制器的形式，控制器的例子包括但不限於以下微控制器：ARC 625D、Atmel AT91SAM、Microchip PIC18F26K20 以及Silicone Labs C8051F320，記憶體控制器還可以被實現為記憶體的控制邏輯的一部分。本領域技術人員也知道，除了以純電腦可讀程式碼方式實現控制器以外，完全可以通過將方法步驟進行邏輯程式設計來使得控制器以邏輯閘、開關、專用積體電路、可程式設計邏輯控制器和嵌入微控制器等的形式來實現相同功能。因此這種控制器可以被認為是一種硬體部件，而對其內包括的用於實現各種功能的裝置也可以視為硬體部件內的結構。或者甚至，可以將用於實現各種功能的裝置視為既可以是實現方法的軟體模組又可以是硬體部件內的結構。
上述實施例闡明的系統、裝置、模組或單元，具體可以由電腦晶片或實體實現，或者由具有某種功能的產品來實現。一種典型的實現設備為電腦。具體的，電腦例如可以為個人電腦、膝上型電腦、蜂巢式電話、相機電話、智慧型電話、個人數位助理、媒體播放機、導航設備、電子郵件設備、遊戲控制台、平板電腦、可穿戴設備或者這些設備中的任何設備的組合。
為了描述的方便，描述以上裝置時以功能分為各種單元分別描述。當然，在實施本申請案時可以把各單元的功能在同一個或多個軟體和/或硬體中實現。
本領域內的技術人員應明白，本申請案的實施例可提供為方法、系統、或電腦程式產品。因此，本申請案可採用完全硬體實施例、完全軟體實施例、或結合軟體和硬體方面的實施例的形式。而且，本申請案可採用在一個或多個其中包含有電腦可用程式碼的電腦可用儲存媒體(包括但不限於磁碟記憶體、CD-ROM、光學記憶體等)上實施的電腦程式產品的形式。
本申請案是參照根據本申請案實施例的方法、設備(系統)、和電腦程式產品的流程圖和/或方塊圖來描述的。應理解可由電腦程式指令實現流程圖和/或方塊圖中的每一流程和/或方塊、以及流程圖和/或方塊圖中的流程和/或方塊的結合。可提供這些電腦程式指令到通用電腦、專用電腦、嵌入式處理機或其他可程式設計資料處理設備的處理器以產生一個機器，使得通過電腦或其他可程式設計資料處理設備的處理器執行的指令產生用於實現在流程圖一個流程或多個流程和/或方塊圖一個方塊或多個方塊中指定的功能的裝置。
這些電腦程式指令也可儲存在能引導電腦或其他可程式設計資料處理設備以特定方式工作的電腦可讀記憶體中，使得儲存在該電腦可讀記憶體中的指令產生包括指令裝置的製造品，該指令裝置實現在流程圖一個流程或多個流程和/或方塊圖一個方塊或多個方塊中指定的功能。
這些電腦程式指令也可裝載到電腦或其他可程式設計資料處理設備上，使得在電腦或其他可程式設計設備上執行一系列操作步驟以產生電腦實現的處理，從而在電腦或其他可程式設計設備上執行的指令提供用於實現在流程圖一個流程或多個流程和/或方塊圖一個方塊或多個方塊中指定的功能的步驟。
在一個典型的配置中，計算設備包括一個或多個處理器(CPU)、輸入/輸出介面、網路介面和記憶體。
記憶體可能包括電腦可讀媒體中的非永久性記憶體，隨機存取記憶體(RAM)和/或非易失性記憶體等形式，如唯讀記憶體(ROM)或快閃記憶體(flash RAM)。記憶體是電腦可讀媒體的示例。
電腦可讀媒體包括永久性和非永久性、可移動和非可移動媒體可以由任何方法或技術來實現資訊儲存。資訊可以是電腦可讀指令、資料結構、程式的模組或其他資料。電腦的儲存媒體的例子包括，但不限於相變記憶體(PRAM)、靜態隨機存取記憶體(SRAM)、動態隨機存取記憶體(DRAM)、其他類型的隨機存取記憶體(RAM)、唯讀記憶體(ROM)、電可擦除可程式設計唯讀記憶體(EEPROM)、快閃記憶體或其他記憶體技術、唯讀光碟唯讀記憶體(CD-ROM)、數位多功能光碟(DVD)或其他光學儲存、磁盒式磁帶，磁帶磁磁片儲存或其他磁性存放裝置或任何其他非傳輸媒體，可用於儲存可以被計算設備訪問的資訊。按照本文中的界定，電腦可讀媒體不包括暫存電腦可讀媒體(transitory media)，如調變的資料信號和載波。
還需要說明的是，術語“包括”、“包含”或者其任何其他變體意在涵蓋非排他性的包含，從而使得包括一系列要素的過程、方法、商品或者設備不僅包括那些要素，而且還包括沒有明確列出的其他要素，或者是還包括為這種過程、方法、商品或者設備所固有的要素。在沒有更多限制的情況下，由語句“包括一個……”限定的要素，並不排除在包括所述要素的過程、方法、商品或者設備中還存在另外的相同要素。
本領域技術人員應明白，本申請案的實施例可提供為方法、系統或電腦程式產品。因此，本申請案可採用完全硬體實施例、完全軟體實施例或結合軟體和硬體方面的實施例的形式。而且，本申請案可採用在一個或多個其中包含有電腦可用程式碼的電腦可用儲存媒體(包括但不限於磁碟記憶體、CD-ROM、光學記憶體等)上實施的電腦程式產品的形式。
本申請案可以在由電腦執行的電腦可執行指令的一般上下文中描述，例如程式模組。一般地，程式模組包括執行特定任務或實現特定抽象資料類型的常式、程式、物件、組件、資料結構等等。也可以在分散式運算環境中實踐本申請案，在這些分散式運算環境中，由通過通信網路而被連接的遠端處理設備來執行任務。在分散式運算環境中，程式模組可以位於包括存放裝置在內的本地和遠端電腦儲存媒體中。
本說明書中的各個實施例均採用遞進的方式描述，各個實施例之間相同相似的部分互相參見即可，每個實施例重點說明的都是與其他實施例的不同之處。尤其，對於系統實施例而言，由於其基本相似於方法實施例，所以描述的比較簡單，相關之處參見方法實施例的部分說明即可。
以上所述僅為本申請案的實施例而已，並不用於限制本申請案。對於本領域技術人員來說，本申請案可以有各種更改和變化。凡在本申請案的精神和原理之內所作的任何修改、等同替換、改進等，均應包含在本申請案的申請專利範圍之內。In order to enable those skilled in the art to better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the drawings in the embodiments of the present application. Obviously, The described embodiments are only a part of the embodiments of the present application, but not all the embodiments. Based on the embodiments in this application, all other embodiments obtained by a person of ordinary skill in the art without making progressive labor shall fall within the scope of protection of this application.
Embodiments of the present application provide a service update method, device, and system, based on dividing service update data for service update performed by a service node into multiple sub-update data in advance, and multiple service nodes to be updated share the participation in each sub-update Diffusion of data, the data used by any service node for service update is collected from other related service nodes and then merged, which effectively uses the computing resources and network resources of multiple service nodes and improves multiple services. The service update efficiency of the nodes realizes fast, efficient and safe service update to each service node.
FIG. 1 is a schematic diagram of an application scenario of service update provided by an embodiment of the present application. As shown in FIG. 1, FIG. 1 involves multiple service nodes to be updated. The service node is an Internet service or a cloud computing service. The custodian can be a physical machine, virtual container, or server software, etc. In the initial distribution stage of the sub-update data, that is, the process of distributing multiple sub-update data divided by the service update data to multiple service nodes for the first time, each sub-update The data is distributed to at least one service node; then it enters the diffusion stage of the sub-update data. As the sub-update data continues to spread, the number of service nodes where each sub-update data is located is increasing, and each service node stores The number of sub-update data is also increasing. After any service node collects all sub-update data, it merges to obtain complete service update data, and uses the service update data to complete the local service update. Among them, when the product functions and services need to be updated and deployed, first update the relevant software or configuration on all service nodes to be updated. In the process of service update, it has a cross-computer room, decentralized decentralization, fault tolerance mechanism, system Irrelevant and hardware-independent features, make full use of network resources and computing resources between service nodes and computer rooms to ensure that sub-update data is quickly, efficiently, safely and reliably spread among multiple service nodes. In the end, each service node to be serviced is merged to obtain a complete service update data, so as to realize the service update of multiple service nodes.
FIG. 2 is a first schematic flowchart of a service update method provided by an embodiment of the application. The method in FIG. 2 can be executed by the service node 100 in FIG. 1 and is applicable to service update deployment of Internet services and cloud computing services. As shown in Figure 2, the method includes at least the following steps:
S201, among a plurality of service nodes to be updated, obtain a plurality of sub-update data from a plurality of service nodes other than the first service node, wherein the plurality of sub-update data are obtained by dividing the service update data in advance. A service node is any service node among multiple service nodes to be updated. Since any service node not only participates in the diffusion of sub-update data, but also needs to perform service update itself, therefore, a sub-update data In the process of spreading to other service nodes, the transmitted sub-update data is the data copy of the data sub-block obtained after the service update data is divided. Wherein, the plurality of sub-update materials acquired by the first service node may be from some service nodes other than the first service node, or may be from all service nodes other than the first service node.
S202: Combine the obtained multiple sub-update data to obtain service update data for service update. Specifically, after obtaining all the sub-update data, restore the multiple sub-update data to the service update data before division.
S203. Perform service update on the first service node according to the service update data obtained by merging. Specifically, after the multiple service update data are merged to obtain the complete service update data, if the service update is an upgrade of the original application service, then Use the service update data to replace the original service data related to the service to be upgraded. If this service update is a new application service, add the service update data to the original service data, and then restart the service node service.
For example, for the newly added "redemption to earn bounty" function in the Alipay application, it is necessary to divide the service update data that realizes the "reduce to earn bounty" application service into multiple sub-update data, and then use steps S201 to S203 to make each provide the application The service node of the service obtains all the sub-update data and merges them into service update data. Each service node uses the service update data to update the local application service, and then provides the corresponding application service to the client.
In the embodiment of the present application, the service update data used for service update by the service node is divided into multiple sub-update data in advance, and multiple service nodes to be updated share the participation in the diffusion of each sub-update data. Any service node uses The service update data is obtained by collecting all the sub-update data from other related service nodes and then merging them. It effectively uses the computing resources and network resources of multiple service nodes and improves the service update efficiency of multiple service nodes. Efficiently and safely update services to each service node.
Wherein, as shown in FIG. 3, before obtaining multiple sub-update materials from multiple service nodes other than the first service node among multiple service nodes to be updated, S201 further includes:
S204. Receive a service update request, where the service update request carries the data identifiers of all the sub-update data divided by the service update data; specifically, each sub-update data corresponds to a data identifier, for example, the data serial number can be used as For the data identification of the sub-update data, taking the service update data divided into m sub-update data as an example, the data ID of the first sub-update data is 1, and the data ID of the last self-update data is m.
Correspondingly, the above S201 obtains multiple sub-update data from multiple service nodes other than the first service node among multiple service nodes to be updated, which specifically includes:
In S2011, among the multiple service nodes to be updated, according to the received service update request, sub-update data corresponding to each data identifier are respectively obtained from multiple service nodes other than the first service node.
In specific implementation, as shown in FIG. 4a, among the N service nodes to be updated, the service update data is uploaded to any service node (eg, service node k). After the service node receives the service update data, Divide the service update data into multiple sub-update data (eg, split into m sub-update data); among the multiple service nodes to be updated, as shown in FIG. 4b, select the target number of service nodes as the first service node (such as , The number of first service nodes is x,), Distribute multiple sub-update materials to multiple initial service nodes (eg, Distribute m sub-update materials to x first service nodes), at this time, For each initial service node, The first service node receives at least one sub-update data, Update information for each sub, The sub-update data exists on at least one initial service node, This process is the initial distribution of sub-update materials, among them, If the first service node belongs to the first service node, Receiving service update request of service node k; If the first service node does not belong to the first service node, Then, a service update request of the service node k or any first service node is received. Then it enters the diffusion stage of the sub-update data, As shown in Figure 4c, Each sub-update data is spread among multiple service nodes, finally, Each service node obtains all sub-update data, As shown in Figure 4d, Merge multiple obtained sub-update data, Get service update information for service update.
specific, For the case where the first service node belongs to the first service node, The above S204 receives the service update request, This includes:
Receive at least one sub-update data and update data split information distributed for the first time, among them, The updated data segmentation information includes: The data identifiers of all the sub-update data obtained by the service update data segmentation, And each sub-update material is distributed to at least one service node.
among them, If the first service node participates in the initial distribution of sub-update data, The service update request received by the first service node may simultaneously carry at least one sub-update data and update data segmentation information, After the first service node receives at least one sub-update data distributed for the first time, Participate in the subsequent sub-update data diffusion stage, Transmit the locally stored sub-update data to the service node that needs the sub-update data, And obtain sub-update information that does not exist locally from other service nodes.
For the case that the first service node does not belong to the first service node, The first service node directly enters the diffusion stage of the sub-update data, The service update request received by the first service node may only carry update data segmentation information, According to the update data segmentation information, obtain sub-update data that does not exist locally from other service nodes, After obtaining the sub-update information at the same time, If a sub-update information acquisition request is received, Then, the sub-update data stored locally is transmitted to the service node that needs the sub-update data.
further, Considering that there may be data loss during the initial distribution, Or the service node fails to spread the received sub-update data to other service nodes, As a result, the sub-update data cannot be properly spread to all service nodes, In order to ensure that each service node to be updated can obtain all sub-update data, Based on, Each sub-update data divided by the service update data is distributed to at least two service nodes, That is, the same sub-update information is distributed to two first-serving service nodes.
specific, During the initial distribution of sub-update materials, In the process of distributing multiple sub-update materials to multiple first service nodes, Distribute the same sub-update data to at least two first service nodes, at this time, Among multiple service nodes to be updated, Each sub-update data is stored in at least two service nodes, In this way, even if a certain service node is abnormal, You can still get sub-update data from another service node, Ensure that all sub-update data can be diffused to all service nodes normally, In order to ensure that each service node to be updated can obtain all sub-update data, Increased the success rate of service update information release.
among them, As shown in Figure 5, The above S2011 is among multiple service nodes to be updated, According to the received service update request, Obtain sub-update data corresponding to each data identifier from multiple service nodes other than the first service node, This includes:
S20111, Obtain sub-update data storage information of multiple service nodes other than the first service node, among them, The sub-update data storage information includes: The data identifier of the sub-update data stored on the service node.
S20112, For each data identifier in the service update request, Determine whether the first service node has sub-update data corresponding to the data identifier; specific, In the preset order, Inquire one by one whether the sub-update data corresponding to each data identifier exists locally, If it does not exist, Then obtain it from the service node that has stored the sub-update data.
If not, Then execute S20113, According to the stored information of each sub-update data and the target data identifier corresponding to the sub-update data that does not exist locally, Select a service node as the target service node, And obtaining the sub-update data corresponding to the target data identifier from the target service node.
among them, After the first service node obtains the sub-update data storage information of each service node except itself, It can be determined in which service nodes each sub-update data is distributed, And then obtain sub-update information that does not exist locally from the target service node in a targeted manner, Until there is sub-update data corresponding to all data identifiers in the local storage area, specific, The first service access node may simultaneously obtain sub-update data corresponding to different data identifiers from at least two different service nodes, and, All service nodes can simultaneously obtain the required sub-update information, Distribute data processing load and data transmission load to all service nodes, Greatly save the time for obtaining service update information, Improve the service update efficiency and success rate of multi-service nodes.
further, Considering that in determining the target service node, If there are more service nodes to be updated, Then the amount of stored information of the sub-update data obtained is also greater, In order to improve the efficiency of target service node determination, Based on, The above S20113 stores information according to each sub-update data and the target data identifier corresponding to the sub-update data that does not exist locally, Select a service node as the target service node, This includes:
According to each sub-update data storage information, Determine the sub-update data distribution information, among them, The sub-update data distribution information includes: The information of the service node where the sub-update data corresponding to each data identifier in the service update request is located.
According to the distribution information of the sub-update data and the target data identifier corresponding to the sub-update data that does not exist locally, Select a service node as the target service node.
specific, After receiving the sub-update data storage information of multiple service nodes other than itself, First summarize the received information of multiple sub-update data storage, Obtain the sub-update data distribution information, In the sub-update data distribution information, Directly find the correspondence between each data identifier and the information of the service node that stores the sub-update data corresponding to the data identifier, E.g, Document ID 1—Service node A\B\C, I.e. service node A, Service Node B, The service node C stores the sub-update data corresponding to the data identifier 1, If you need to obtain the sub-update data corresponding to the data identifier 1, At this time, from the service node A, Service Node B, Select one of service nodes C as the target service node, At a glance, it can be known at which service nodes the sub-update data corresponding to the target data identifier is distributed, Quickly locate the target service node.
further, In order to make full use of the computing resources and network resources of each service node, To avoid the high load rate of a certain service node, And the load rate of other service nodes is very low, To achieve the effect of load balancing of multiple service nodes, Based on, The above target data identifier corresponding to the distribution information of the sub-update data and the sub-update data that does not exist locally, Select a service node as the target service node, This includes:
Based on the sub-update data distribution information, Multiple service nodes that have stored the sub-update data corresponding to the target data identifier as candidate service nodes, among them, The target material identifier is a material identifier corresponding to a sub-update material that does not exist locally.
According to the load rate of each candidate service node, The candidate service node with the lowest load rate is determined as the target service node.
specific, In the process of selecting the target service node, Refer to the load of the alternative service node, In the case where multiple service nodes have sub-update data corresponding to the target data identifier, The candidate service node with the lowest load rate is determined as the target service node, This can make full use of the computing resources and network resources of each service node, To achieve the effect of load balancing of multiple service nodes, Furthermore, the service update efficiency of multiple service nodes is further improved.
specific, After obtaining the sub-update data corresponding to the target data identifier from the target service node, Also includes:
If the sub update data acquisition fails, Then re-select the next target service node in order from low to high load rate, And obtain the sub-update data corresponding to the target material identifier from the newly selected target service node.
among them, For the case where only one service node stores the sub-update data corresponding to the target data identifier, After waiting for the target service node to recover, Continue to obtain the required sub-update data from the target service node. In order to avoid this situation, In the specific implementation, During the initial distribution of sub-update materials, Distribute the same sub-update data to at least two first service nodes, It can be ensured that at least two service nodes store the sub-update data corresponding to the target data identifier; In addition, Even during the initial distribution of sub-updates, Distribute the same sub-update information to only one starting service node, And as the sub-update information continues to spread, It can also ensure that at least two service nodes store the sub-update data corresponding to the target data identifier, Provide redundant mechanism for data acquisition failure, Increased the success rate of service update information release.
For the case where at least two service nodes store sub-update data corresponding to the target data identifier, After the first service node fails to obtain the sub-update information from a target service node, Then change the service node to obtain sub-update data again, specific, During the service update process, If the sub update data acquisition fails, It means that the target service node is abnormal, at this time, The first service node reselects the next target service node.
In addition, When the abnormal target service node returns to normal, The target service node continues to execute: Obtain sub-update data storage information of multiple service nodes other than this service node respectively; For each data identifier in the service update request, Determine whether there is a sub-update data corresponding to the data identifier locally; If not, According to the latest version of each sub-update data storage information and the data identification, Select a service node as the target service node, And obtaining the sub-update data corresponding to the data identifier from the target service node, Until all sub-update information is obtained.
among them, The process of storing information for obtaining sub-update data can be obtained in the following two ways, Specifically:
The first way: When there is an update of the sub-update data of each service node, Actively broadcast updated sub-update data storage information to other service nodes, specific, The above S20111 respectively obtains sub-update data storage information of multiple service nodes other than the first service node, This includes:
Receiving sub-update data storage information broadcast by multiple service nodes other than the first service node, among them, The sub-update data storage information is obtained by multiple service nodes other than the first service node after acquiring new sub-update data and updating local sub-update data storage information.
The second way: After each service node receives a request to obtain information about the storage of sub-data from other service nodes, Before sending the latest version of the sub-update data storage information to the corresponding service node, specific, The above S20111 respectively obtains sub-update data storage information of multiple service nodes other than the first service node, This includes:
Send a request for acquiring sub-data storage information to each service node other than the first service node;
Receive local latest version of sub-update data storage information sent by service nodes other than the first service node, among them, The sub-update data storage information is sent by each service node other than the first service node in response to the sub-data storage information acquisition request.
among them, For the process of merging sub-update data, specific, The above S202 combines the acquired multiple sub-update materials, Get service update information for service update, This includes:
According to the order of the information mark from small to large, Sort the obtained multiple sub-update data;
According to the sorting results, Combine each sub-update data to obtain service update data for service update.
among them, For each service node, The service node not only obtains sub-update information from other service nodes, It also needs to obtain sub-update information acquisition requests based on other service nodes, Send sub-update information to the corresponding service node, Based on, The above method also includes:
Receiving sub-update data acquisition requests sent by service nodes other than the first service node;
Send the sub-update data corresponding to the received acquisition request to the corresponding service node, So that the service node receiving the sub-update data judges whether all sub-update data are stored locally, if, Then update the local service, That is, the first service node also participates in the proliferation of sub-update data.
among them, For each service node, The service node not only obtains sub-update data storage information from other service nodes, It is also necessary to send the latest local version of the sub-update data storage information to other service nodes, Based on, The above method also includes:
Send the local latest version of the sub-update data storage information to the corresponding service node, So that the service node that receives the sub-update data storage information determines the target service node, And obtain sub-update data from the target service node.
specific, The process of storing information for sending sub-update data can be achieved in the following two ways, Specifically:
The first way: When there is an update of the sub-update data of the first service node, Actively broadcast updated sub-update data storage information to other service nodes, specific, The above sends the local latest version of the sub-update data storage information to the corresponding service node, This includes:
After obtaining new sub-update information, Update local sub-update data storage information;
Broadcast the updated sub-update data storage information to multiple service nodes other than the first service node.
The second way: After the first service node receives the request to obtain the sub-data storage information from other service nodes, Before sending the latest version of the sub-update data storage information to the service node, specific, The above sends the local latest version of the sub-update data storage information to the corresponding service node, This includes:
Receiving a request to obtain sub-data storage information from any service node other than the first service node;
The local latest version of the sub-update data storage information is transmitted to the service node that sends the sub-data storage information acquisition request.
The service update method in the embodiment of this application, Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node; Merge multiple obtained sub-update data, Get service update information; According to the updated service information obtained from the merger, Perform service update on the first service node. Based on pre-dividing the service update data used by the service node for service update into multiple sub-update data, Multiple service nodes to be updated are shared to participate in the diffusion of each sub-update data, The data used for service update by any service node is obtained by collecting all sub-update data from other related service nodes and then merging them. Effective use of computing resources and network resources of multiple service nodes, Improve the service update efficiency of multiple service nodes, Fast, Efficient, Safely update services to each service node.
Corresponding to the service update method described above in FIGS. 2 to 5, Based on the same technical concept, The embodiment of the present application also provides a service update device, FIG. 6 is a schematic diagram of the composition of a first module of a service update device provided by an embodiment of the application, The device is used to execute the service update method described in FIGS. 2 to 5, As shown in Figure 6, The device includes:
Sub-data acquisition module 601, Used in multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node, among them, The multiple sub-update data is obtained by dividing the service update data in advance;
Update data generation module 602, For merging the obtained multiple sub-update materials, Obtain the service update information;
Service Update Module 603, Used to update the information based on the merged service, Performing service update on the first service node.
Optionally, As shown in Figure 7, The above device also includes:
Update request receiving module 604, Before acquiring multiple sub-update data from multiple service nodes other than the first service node, Receive service update requests, among them, The service update request carries the data identifiers of all the sub-update data obtained by dividing the service update data;
The sub-data acquisition module 601, Specifically used for:
According to the service update request, Obtain sub-update data corresponding to each of the material identifiers from multiple service nodes other than the first service node.
Optionally, The update request receiving module 604, Specifically used for:
Receive at least one sub-update data and update data split information distributed for the first time, among them, The updated data segmentation information includes: The data identifiers of all the sub-update data obtained by the service update data segmentation, And each sub-update material is distributed to at least one service node.
Optionally, Each sub-update data obtained by dividing the service update data is distributed to at least two service nodes.
Optionally, The sub-data acquisition module 601, Further specific use:
Obtain sub-update data storage information of multiple service nodes other than the first service node, among them, The sub-update data storage information includes: The data identifier of the sub-update data stored on the service node;
For each data identifier in the service update request, Judging whether the first service node has sub-update data corresponding to the data identifier;
If not, Then according to each of the sub-update data storage information and the data identification, Select a service node as the target service node, And obtaining the sub-update data corresponding to the data identifier from the target service node.
Optionally, The sub-data acquisition module 601, More specifically for:
According to each of the sub-update data storage information, Determine the sub-update data distribution information, among them, The distribution information of the sub-update data includes: Information of the service node where the sub-update data corresponding to each data identifier in the service update request is located;
According to the sub-update data distribution information and the data identification, Select a service node as the target service node.
Optionally, The sub-data acquisition module 601, Further specific use:
Based on the sub-update data distribution information, Multiple service nodes that have stored the sub-update data corresponding to the data identifier as candidate service nodes;
According to the load rate of each candidate service node, The candidate service node with the lowest load rate is determined as the target service node.
Optionally, The above sub-data acquisition module 601, Also specifically used for:
After obtaining the sub-update data corresponding to the data identifier from the target service node, If the sub update data acquisition fails, Then re-select the next target service node in order from low to high load rate, And obtain the sub-update data corresponding to the data identifier from the newly selected target service node.
Optionally, The sub-data acquisition module 601, More specifically for:
Receiving sub-update data storage information broadcast by multiple service nodes other than the first service node, among them, The sub-update data storage information is obtained by multiple service nodes other than the first service node after acquiring new sub-update data and updating local sub-update data storage information.
Optionally, The sub-data acquisition module 601, More specifically for:
Send a request for acquiring sub-data storage information to each service node other than the first service node;
Receive local latest version of sub-update data storage information sent by service nodes other than the first service node, among them, The sub-update data storage information is sent by each service node other than the first service node in response to the sub-data storage information acquisition request.
Optionally, The update data generation module 602, Specifically used for:
According to the order of the information mark from small to large, Sort the plurality of sub-update data;
According to the sorting results, Combining each of the sub-update data to obtain the service update data.
Optionally, The above device also includes:
Sub update data sending module 605, Used to receive sub-update data acquisition requests sent by service nodes other than the first service node; Sending the sub-update data corresponding to the acquisition request to the corresponding service node.
Optionally, The above device also includes:
Storage information sending module 606, It is used to send the local latest version of sub-update data storage information to the corresponding service node.
The service updating device in the embodiment of the present application, Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node; Merge multiple obtained sub-update data, Get service update information; According to the updated service information obtained from the merger, Perform service update on the first service node. Based on pre-dividing the service update data used by the service node for service update into multiple sub-update data, Multiple service nodes to be updated are shared to participate in the diffusion of each sub-update data, The data used for service update by any service node is obtained by collecting all sub-update data from other related service nodes and then merging them. Effective use of computing resources and network resources of multiple service nodes, Improve the service update efficiency of multiple service nodes, Fast, Efficient, Safely update services to each service node.
The service update apparatus provided by the embodiment of the present invention can implement various processes in the embodiments corresponding to the above service update method, To avoid repetition, I will not repeat them here.
further, Corresponding to the methods shown in Figures 2 to 5 above, Based on the same technical concept, The embodiment of the present application also provides a service update system, As shown in Figure 8, The system includes: Multiple service nodes 100 to be updated, The communication connection between the two service nodes 100, Each service node 100 is provided with the above service update device; among them, A plurality of sub-update data (ie, data sub-blocks 1 to m) obtained by dividing the service update data spread among the service nodes 100, In order that each service node 100 obtains all sub-update data.
specific, Any first service node to be updated, Used in multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node, among them, The multiple sub-update data is obtained by dividing the service update data in advance; Merge the obtained multiple sub-update materials, Obtain the service update information; According to the updated service information obtained from the merger, Performing service update on the first service node.
further, The first service node, Also used for:
Receive service update requests, among them, The service update request carries the data identifiers of all the sub-update data obtained by dividing the service update data;
According to the service update request, Obtain sub-update data corresponding to each of the data identifiers respectively.
further, Any one of the plurality of service nodes (that is, the above service node k), Used for:
Receive service update data and data segmentation instructions;
According to the data segmentation instructions, Dividing the service update data into multiple sub-update data;
From multiple service nodes to be updated, Select a target number of multiple initial distribution nodes, among them, The initial distribution node is equivalent to the above-mentioned first service node;
Send a service update request to the plurality of initial distribution nodes, among them, The service update request carries at least one sub-update data and update data segmentation information distributed for the first time, Each sub-update material is distributed to at least one selected initial distribution node.
further, Each sub-update material is distributed to at least two selected initial distribution nodes.
The service update system in the embodiment of this application, For any service node, Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than this service node; Merge multiple obtained sub-update data, Get service update information; According to the updated service information obtained from the merger, Perform service update on the first service node. Based on pre-dividing the service update data used by the service node for service update into multiple sub-update data, Multiple service nodes to be updated are shared to participate in the diffusion of each sub-update data, The data used for service update by any service node is obtained by collecting all sub-update data from other related service nodes and then merging them. Effective use of computing resources and network resources of multiple service nodes, Improve the service update efficiency of multiple service nodes, Fast, Efficient, Safely update services to each service node.
The service update system provided by the embodiment of the present invention can implement various processes in the embodiments corresponding to the above service update method, To avoid repetition, I will not repeat them here.
further, Corresponding to the methods shown in Figures 2 to 5 above, Based on the same technical concept, The embodiment of the present application also provides a service updating device, The device is used to perform the above service update method, As shown in Figure 9.
Service update devices can have relatively large differences due to different configurations or performance, May include one or more processors 901 and memory 902, One or more storage applications or data may be stored in the memory 902. among them, The memory 902 may be short-term storage or persistent storage. The application stored in the memory 902 may include one or more modules (not shown), Each module may include a series of computer-executable instructions in the service update device. go a step further, The processor 901 may be set to communicate with the memory 902, A series of computer executable instructions in the memory 902 are executed on the service update device. The service update device may also include one or more power sources 903, One or more wired or wireless network interfaces 904, One or more input and output interfaces 905, One or more keyboards 906, etc.
In a specific embodiment, Service update equipment includes memory, And one or more programs, One or more programs are stored in memory, And one or more programs can include one or more modules, And each module can include a series of computer executable instructions for the service update device, And is configured to be executed by one or more processors. The one or more packaged programs contain the following computer executable instructions:
Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node, among them, The multiple sub-update data is obtained by dividing the service update data in advance;
Merge the obtained multiple sub-update materials, Obtain the service update information;
According to the updated service information obtained from the merger, Performing service update on the first service node.
Optionally, When computer executable instructions are executed, It also contains executable instructions for the following computers: Before obtaining multiple sub-update data from multiple service nodes other than the first service node, Also includes:
Receive service update requests, among them, The service update request carries the data identifiers of all the sub-update data obtained by dividing the service update data;
Acquiring multiple sub-update data from multiple service nodes other than the first service node, include:
According to the service update request, Obtain sub-update data corresponding to each of the material identifiers from multiple service nodes other than the first service node.
Optionally, When computer executable instructions are executed, Receiving the service update request, include:
Receive at least one sub-update data and update data split information distributed for the first time, among them, The updated data segmentation information includes: The data identifiers of all the sub-update data obtained by the service update data segmentation, And each sub-update material is distributed to at least one service node.
Optionally, When computer executable instructions are executed, Each sub-update data obtained by dividing the service update data is distributed to at least two service nodes.
Optionally, When computer executable instructions are executed, According to the service update request, Acquiring sub-update data corresponding to each of the data identifiers from multiple service nodes other than the first service node, include:
Obtain sub-update data storage information of multiple service nodes other than the first service node, among them, The sub-update data storage information includes: The data identifier of the sub-update data stored on the service node;
For each data identifier in the service update request, Judging whether the first service node has sub-update data corresponding to the data identifier;
If not, Then according to each of the sub-update data storage information and the data identification, Select a service node as the target service node, And obtaining the sub-update data corresponding to the data identifier from the target service node.
Optionally, When computer executable instructions are executed, The updated data storage information and the data identification according to each of the sub, Select a service node as the target service node, include:
According to each of the sub-update data storage information, Determine the sub-update data distribution information, among them, The distribution information of the sub-update data includes: Information of the service node where the sub-update data corresponding to each data identifier in the service update request is located;
According to the sub-update data distribution information and the data identification, Select a service node as the target service node.
Optionally, When computer executable instructions are executed, Updating the data distribution information and the data identification according to the sub, Select a service node as the target service node, include:
Based on the sub-update data distribution information, Multiple service nodes that have stored the sub-update data corresponding to the data identifier as candidate service nodes;
According to the load rate of each candidate service node, The candidate service node with the lowest load rate is determined as the target service node.
Optionally, When computer executable instructions are executed, After obtaining the sub-update data corresponding to the data identifier from the target service node, Also includes:
If the sub update data acquisition fails, Then re-select the next target service node in order from low to high load rate, And obtain the sub-update data corresponding to the data identifier from the newly selected target service node.
Optionally, When computer executable instructions are executed, Acquiring respectively the sub-update data storage information of multiple service nodes other than the first service node, include:
Receiving sub-update data storage information broadcast by multiple service nodes other than the first service node, among them, The sub-update data storage information is obtained by multiple service nodes other than the first service node after acquiring new sub-update data and updating local sub-update data storage information.
Optionally, When computer executable instructions are executed, Acquiring respectively the sub-update data storage information of multiple service nodes other than the first service node, include:
Send a request for acquiring sub-data storage information to each service node other than the first service node;
Receive local latest version of sub-update data storage information sent by service nodes other than the first service node, among them, The sub-update data storage information is sent by each service node other than the first service node in response to the sub-data storage information acquisition request.
Optionally, When computer executable instructions are executed, Merging the obtained multiple sub-update materials, Get the service update information, include:
According to the order of the information mark from small to large, Sort the plurality of sub-update data;
According to the sorting results, Combining each of the sub-update data to obtain the service update data.
Optionally, When computer executable instructions are executed, It also contains executable instructions for the following computers:
Receiving sub-update data acquisition requests sent by service nodes other than the first service node;
Sending the sub-update data corresponding to the acquisition request to the corresponding service node.
Optionally, When computer executable instructions are executed, It also contains executable instructions for the following computers:
Send the local latest version of the sub-update data storage information to the corresponding service node.
The service updating device in the embodiment of the present application, Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node; Merge multiple obtained sub-update data, Get service update information; According to the updated service information obtained from the merger, Perform service update on the first service node. visible, Through the service update device in the embodiment of the present application, Based on pre-dividing the service update data used by the service node for service update into multiple sub-update data, Multiple service nodes to be updated are shared to participate in the diffusion of each sub-update data, The data used for service update by any service node is obtained by collecting all sub-update data from other related service nodes and then merging them. Effective use of computing resources and network resources of multiple service nodes, Improve the service update efficiency of multiple service nodes, Fast, Efficient, Safely update services to each service node.
further, Corresponding to the methods shown in Figures 2 to 5 above, Based on the same technical concept, An embodiment of the present application also provides a storage medium, Used to store computer executable instructions, In a specific embodiment, The storage medium can be a USB flash drive, CD, Hard drives, etc., When the computer executable instructions stored in the storage medium are executed by the processor, Can achieve the following process:
Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node, among them, The multiple sub-update data is obtained by dividing the service update data in advance;
Merge the obtained multiple sub-update materials, Obtain the service update information;
According to the updated service information obtained from the merger, Performing service update on the first service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, The following process is also implemented: Before obtaining multiple sub-update data from multiple service nodes other than the first service node, Also includes:
Receive service update requests, among them, The service update request carries the data identifiers of all the sub-update data obtained by dividing the service update data;
Acquiring multiple sub-update data from multiple service nodes other than the first service node, include:
According to the service update request, Obtain sub-update data corresponding to each of the material identifiers from multiple service nodes other than the first service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Receiving the service update request, include:
Receive at least one sub-update data and update data split information distributed for the first time, among them, The updated data segmentation information includes: The data identifiers of all the sub-update data obtained by the service update data segmentation, And each sub-update material is distributed to at least one service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Each sub-update data obtained by dividing the service update data is distributed to at least two service nodes.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, According to the service update request, Acquiring sub-update data corresponding to each of the data identifiers from multiple service nodes other than the first service node, include:
Obtain sub-update data storage information of multiple service nodes other than the first service node, among them, The sub-update data storage information includes: The data identifier of the sub-update data stored on the service node;
For each data identifier in the service update request, Judging whether the first service node has sub-update data corresponding to the data identifier;
If not, Then according to each of the sub-update data storage information and the data identification, Select a service node as the target service node, And obtaining the sub-update data corresponding to the data identifier from the target service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, The updated data storage information and the data identification according to each of the sub, Select a service node as the target service node, include:
According to each of the sub-update data storage information, Determine the sub-update data distribution information, among them, The distribution information of the sub-update data includes: Information of the service node where the sub-update data corresponding to each data identifier in the service update request is located;
According to the sub-update data distribution information and the data identification, Select a service node as the target service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Updating the data distribution information and the data identification according to the sub, Select a service node as the target service node, include:
Based on the sub-update data distribution information, Multiple service nodes that have stored the sub-update data corresponding to the data identifier as candidate service nodes;
According to the load rate of each candidate service node, The candidate service node with the lowest load rate is determined as the target service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, After obtaining the sub-update data corresponding to the data identifier from the target service node, Also includes:
If the sub update data acquisition fails, Then re-select the next target service node in order from low to high load rate, And obtain the sub-update data corresponding to the data identifier from the newly selected target service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Acquiring respectively the sub-update data storage information of multiple service nodes other than the first service node, include:
Receiving sub-update data storage information broadcast by multiple service nodes other than the first service node, among them, The sub-update data storage information is obtained by multiple service nodes other than the first service node after acquiring new sub-update data and updating local sub-update data storage information.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Acquiring respectively the sub-update data storage information of multiple service nodes other than the first service node, include:
Send a request for acquiring sub-data storage information to each service node other than the first service node;
Receive local latest version of sub-update data storage information sent by service nodes other than the first service node, among them, The sub-update data storage information is sent by each service node other than the first service node in response to the sub-data storage information acquisition request.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, Merging the obtained multiple sub-update materials, Get the service update information, include:
According to the order of the information mark from small to large, Sort the plurality of sub-update data;
According to the sorting results, Combining each of the sub-update data to obtain the service update data.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, The following process is also implemented:
Receiving sub-update data acquisition requests sent by service nodes other than the first service node;
Sending the sub-update data corresponding to the acquisition request to the corresponding service node.
Optionally, When the computer executable instructions stored in the storage medium are executed by the processor, The following process is also implemented:
Send the local latest version of the sub-update data storage information to the corresponding service node.
When the computer executable instructions stored in the storage medium in the embodiment of the present application are executed by the processor, Among multiple service nodes to be updated, Obtain multiple sub-update data from multiple service nodes other than the first service node; Merge multiple obtained sub-update data, Get service update information; According to the updated service information obtained from the merger, Perform service update on the first service node. visible, Through the storage media in the embodiments of the present application, Based on pre-dividing the service update data used by the service node for service update into multiple sub-update data, Multiple service nodes to be updated are shared to participate in the diffusion of each sub-update data, The data used for service update by any service node is obtained by collecting all sub-update data from other related service nodes and then merging them. Effective use of computing resources and network resources of multiple service nodes, Improve the service update efficiency of multiple service nodes, Fast, Efficient, Safely update services to each service node.
In the 1990s, Improvements in a technology can be clearly distinguished as improvements in hardware (for example, For diodes, Transistor, The improvement of circuit structures such as switches) is also an improvement in software (improvement of method flow). however, with the development of technology, Many of today's method and process improvements can already be regarded as direct improvements in the hardware circuit structure. Designers almost get the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. therefore, It cannot be said that the improvement of a method and process cannot be achieved with hardware physical modules. E.g, Programmable Logic Device (Programmable Logic Device, PLD) (eg Field Programmable Gate Array, FPGA)) is such an integrated circuit, Its logical function is determined by the user programming the device. Designed by the designer to "integrate" a digital system on a PLD, There is no need to ask chip manufacturers to design and manufacture dedicated integrated circuit chips. and, now, Instead of manually making integrated circuit chips, This kind of programming is also mostly implemented with "logic compiler" software. It is similar to the software compiler used in program development, And the original code to be compiled must also be written in a specific programming language, This is called the hardware description language (Hardware Description Language, HDL), And HDL is not the only one, But there are many kinds, Such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc., Currently the most commonly used are VHDL (Very-High-Speed Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also be clear, Only need to use the above hardware description languages for logic programming and programming into integrated circuits. It is easy to get the hardware circuit that implements this logic method flow.
The controller can be implemented in any suitable way, E.g, The controller may be, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (such as software or firmware) executable by the (micro) processor, Logic gate, switch, Application Specific Integrated Circuit (Application Specific Integrated Circuit, ASIC), Programmable logic controllers and embedded microcontrollers, Examples of controllers include but are not limited to the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320, The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that In addition to implementing the controller in pure computer readable code, It is entirely possible to program the method steps by logic programming to make the controller switch, Dedicated integrated circuit, Logic controllers and embedded microcontrollers can be programmed to achieve the same function. So this controller can be considered as a hardware component, The devices included therein for realizing various functions can also be regarded as structures within the hardware components. Or even, The device for realizing various functions can be regarded as both a software module of an implementation method and a structure in a hardware component.
The system described in the above embodiment, Device, Module or unit, It can be realized by computer chip or entity, Or it can be realized by a product with a certain function. A typical implementation device is a computer. specific, The computer may be, for example, a personal computer, Laptop, Cellular phone, Camera phone, Smart phone, Personal digital assistant, Media player, Navigation equipment, Email device, Game console, tablet, Wearable devices or any combination of these devices.
For the convenience of description, When describing the above devices, the functions are divided into various units and described separately. of course, When implementing this application, the functions of each unit may be implemented in one or more software and/or hardware.
Those skilled in the art should understand that Examples of this application can be provided as methods, system, Or computer program products. therefore, This application can use complete hardware embodiments, Complete software embodiment, Or a combination of software and hardware embodiments. and, This application may use one or more computer-usable storage media (including but not limited to disk memory, CD-ROM, The form of computer program products implemented on optical memory, etc.).
This application refers to the method according to the embodiment of this application, Equipment (system), And computer program product flow charts and/or block diagrams. It should be understood that each flow and/or block in the flowchart and/or block diagram can be implemented by computer program instructions, And a combination of processes and/or blocks in flowcharts and/or block diagrams. These computer program instructions can be provided to general-purpose computers, Dedicated computer, Embedded processor or other programmable data processing equipment processor to produce a machine, A device that causes instructions executed by a processor of a computer or other programmable data processing device to generate a function specified in a block or blocks in a flowchart or a flow and/or a block diagram.
These computer program instructions can also be stored in computer readable memory that can guide the computer or other programmable data processing equipment to work in a specific way. Causing the instructions stored in the computer-readable memory to produce a manufactured product including an instruction device, The instruction device implements the functions specified in one block or multiple blocks in one flow or multiple flows in the flowchart and/or one block in the block diagram.
These computer program instructions can also be loaded onto a computer or other programmable data processing equipment, Allows a series of operating steps to be performed on a computer or other programmable device to produce computer-implemented processing, The instructions executed on the computer or other programmable equipment thus provide steps for implementing the functions specified in one block or multiple blocks of one flow or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.
In a typical configuration, The computing device includes one or more processors (CPU), Input/output interface, Network interface and memory.
Memory may include non-permanent memory in computer-readable media, Forms of random access memory (RAM) and/or non-volatile memory, Such as read only memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer-readable media includes permanent and non-permanent, Removable and non-removable media can be stored by any method or technology. Information can be computer readable instructions, Data structure, Program modules or other data. Examples of computer storage media include, But not limited to phase change memory (PRAM), Static random access memory (SRAM), Dynamic Random Access Memory (DRAM), Other types of random access memory (RAM), Read only memory (ROM), Electrically erasable and programmable read-only memory (EEPROM), Flash memory or other memory technology, CD-ROM, CD-ROM, Digital Versatile Disc (DVD) or other optical storage, Magnetic cassette tape, Magnetic tape storage or other magnetic storage devices or any other non-transmission media, It can be used to store information that can be accessed by computing devices. According to the definition in this article, Computer-readable media does not include temporary computer-readable media (transitory media), Such as modulated data signals and carrier waves.
It should also be noted that The term "including", "Contains" or any other variation thereof is intended to cover non-exclusive inclusions, So that the process including a series of elements, method, Goods or equipment includes not only those elements, And also includes other elements that are not explicitly listed, Or is it also included for this process, method, Elements inherent in goods or equipment. Without more restrictions, Elements defined by the sentence "include a..." Does not exclude the process of including the elements, method, There are other identical elements in goods or equipment.
Those skilled in the art should understand that Examples of this application can be provided as methods, System or computer program products. therefore, This application can use complete hardware embodiments, A complete software embodiment or a form of embodiment combining software and hardware. and, This application may use one or more computer-usable storage media (including but not limited to disk memory, CD-ROM, The form of computer program products implemented on optical memory, etc.).
This application can be described in the general context of computer-executable instructions executed by a computer, For example, program modules. normally, Program modules include routines that perform specific tasks or implement specific abstract data types, Program, object, Components, Data structure, etc. You can also practice this application in a distributed computing environment, In these distributed computing environments, The tasks are executed by remote processing devices connected through the communication network. In a distributed computing environment, Program modules can be located in local and remote computer storage media including storage devices.
Each embodiment in this specification is described in a progressive manner, The same or similar parts between the various embodiments may refer to each other, Each embodiment focuses on the differences from other embodiments. especially, For the system embodiment, Since it is basically similar to the method embodiment, So the description is relatively simple, For the relevant parts, please refer to the description of the method embodiments.
The above are only examples of this application, It is not used to limit this application. For those skilled in the art, This application can have various changes and changes. Any modification made within the spirit and principle of this application, Equivalent replacement, Improvement etc., All should be included in the scope of patent applications in this application.
