English | 繁體
UM  > Faculty of Science and Technology
Residential Collegefalse
Status申請中 Pending
基于无服务器计算的高并发低时延云服务支撑方法
2024-12
YE KEJIANG1; LIN YANYING2; XU CHENGZHONG3
CountryChina
Subtype发明专利Invention
Abstract
  • This invention addresses the problem that services on the cloud are prone to timeouts in high-concurrency scenarios, which can lead to service-level agreement (SLA) violations. High Concurrency is an important concept in system design, which aims to enable the system to handle multiple requests in parallel. There are two main challenges for cloud services in high concurrency scenarios.
  • 1. chain reaction triggered by a single point of failure of the service, leading to a systematic failure of the cluster.
  • 2. data consistency issues arising from distributed data responses generated by highly concurrent requests. Therefore, it is of great importance to solve the above two problems caused by high concurrency.
KeywordServerless Low Latency High Throughput
Language中文Chinese
Document TypePatent
CollectionFaculty of Science and Technology
Affiliation1.Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences
2.Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences
3.University of Macau
Recommended Citation
GB/T 7714		 YE KEJIANG,LIN YANYING,XU CHENGZHONG. 基于无服务器计算的高并发低时延云服务支撑方法[P]. 2024-12-01.
APA YE KEJIANG., LIN YANYING., & XU CHENGZHONG 基于无服务器计算的高并发低时延云服务支撑方法.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[YE KEJIANG]'s Articles
[LIN YANYING]'s Articles
[XU CHENGZHONG]'s Articles
Baidu academic
Similar articles in Baidu academic
[YE KEJIANG]'s Articles
[LIN YANYING]'s Articles
[XU CHENGZHONG]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[YE KEJIANG]'s Articles
[LIN YANYING]'s Articles
[XU CHENGZHONG]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.