随着云计算飞速发展,以Docker为代表的容器技术逐渐被重视.目前,3种常见的容器编排工具有Kubernetes、Docker Swarm和Rancher.然而,现有的容器编排工具在所有工作节点的总容量超标时,将会有响应时间长和资源占用较多等问题.因此,本文设...随着云计算飞速发展,以Docker为代表的容器技术逐渐被重视.目前,3种常见的容器编排工具有Kubernetes、Docker Swarm和Rancher.然而,现有的容器编排工具在所有工作节点的总容量超标时,将会有响应时间长和资源占用较多等问题.因此,本文设计LSD(least space unused)算法以及LRU-SD(least recently used and space unused)算法,并应用于3种编排工具中.当总容量超出上限时,则选择删除不工作的节点并且增加新的工作节点.做法上,LSD算法是删除剩余空间最少的工作节点,LRU-SD算法先考虑删除最久未使用的节点,当有多个符合要求的节点时,则删除剩余空间最少的工作节点.实验部分,分析与比较使用不同算法对3种容器编排工具的影响,包含响应时间、CPU和内存.实验结果发现,LSD算法、LRU-SD算法和LRU算法不仅能够提高编排工具的响应时间,还可以增加资源的使用率.同时,在提升CPU的使用率方面,LRU-SD算法的效果最好.展开更多
The interlocutors:Dr. R. R. Hartman?: Director of the Language Centre and Dictionary Research Centre at University of Exeter, U. K., Secretary of the European Association for Lexicography.Chen Kai: Leturer in the Fore...The interlocutors:Dr. R. R. Hartman?: Director of the Language Centre and Dictionary Research Centre at University of Exeter, U. K., Secretary of the European Association for Lexicography.Chen Kai: Leturer in the Foreign Language Department of Fujian Teachers’ University, Hono- rary Research Assistant at Exeter University.展开更多
Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ...Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ordinary solution techniques lead to instability near the limit points and also have problems in case of snap-through and snap-back. Thus they fail to predict the complete load-displacement response. The arc-length method serves the purpose well in principle, received wide acceptance in finite element analysis, and has been used extensively. However modifications to the basic idea are vital to meet the particular needs of the analysis. This paper reviews some of the recent developments of the method in the last two decades, with particular emphasis on nonlinear finite element analysis of reinforced concrete structures.展开更多
Specific features of tile access patterns can be applied in a cache replacement strategy to a limited distributed high-speed cache for the cloud-based networked geographic information services(NGISs),aiming to adapt t...Specific features of tile access patterns can be applied in a cache replacement strategy to a limited distributed high-speed cache for the cloud-based networked geographic information services(NGISs),aiming to adapt to changes in the access distribution of hotspots.By taking advantage of the spatiotemporal locality,the sequential features in tile access patterns,and the cache reading performance in the burst mode,this article proposes a tile sequence replacement method,which involves structuring a Least Recently Used(LRU)stack into three portions for the different functions in cache replacement and deriving an expression for the temporal locality and popularity of the relevant tile to facilitate the replacement process.Based on the spatial characteristics of both the tiles and the cache burst mode with regard to reading data,the proposed method generates multiple tile sequences to reflect spatiotemporal locality in tile access patterns.Then,we measure the caching value by a technique based on a weighted-based method.This technique draws on the recent access popularity and low caching costs of tile sequences,with the aim of balancing the temporal and spatial localities in tile access.It ranks tile sequences in a replacement queue to adapt to the changes in accessed hotspots while reducing the replacement frequency.Experimental results show that the proposed method effectively improves the hit rate and utilization rate for a limited distributed cache while achieving satisfactory response performance and high throughput for users in an NGIS.Therefore,it can be adapted to handle numerous data access requests in NGISs in a cloud-based environment.展开更多
文摘随着云计算飞速发展,以Docker为代表的容器技术逐渐被重视.目前,3种常见的容器编排工具有Kubernetes、Docker Swarm和Rancher.然而,现有的容器编排工具在所有工作节点的总容量超标时,将会有响应时间长和资源占用较多等问题.因此,本文设计LSD(least space unused)算法以及LRU-SD(least recently used and space unused)算法,并应用于3种编排工具中.当总容量超出上限时,则选择删除不工作的节点并且增加新的工作节点.做法上,LSD算法是删除剩余空间最少的工作节点,LRU-SD算法先考虑删除最久未使用的节点,当有多个符合要求的节点时,则删除剩余空间最少的工作节点.实验部分,分析与比较使用不同算法对3种容器编排工具的影响,包含响应时间、CPU和内存.实验结果发现,LSD算法、LRU-SD算法和LRU算法不仅能够提高编排工具的响应时间,还可以增加资源的使用率.同时,在提升CPU的使用率方面,LRU-SD算法的效果最好.
文摘The interlocutors:Dr. R. R. Hartman?: Director of the Language Centre and Dictionary Research Centre at University of Exeter, U. K., Secretary of the European Association for Lexicography.Chen Kai: Leturer in the Foreign Language Department of Fujian Teachers’ University, Hono- rary Research Assistant at Exeter University.
文摘Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ordinary solution techniques lead to instability near the limit points and also have problems in case of snap-through and snap-back. Thus they fail to predict the complete load-displacement response. The arc-length method serves the purpose well in principle, received wide acceptance in finite element analysis, and has been used extensively. However modifications to the basic idea are vital to meet the particular needs of the analysis. This paper reviews some of the recent developments of the method in the last two decades, with particular emphasis on nonlinear finite element analysis of reinforced concrete structures.
基金This work was supported by the National Natural Science Foundation of China[grant number 41371370]the National Basic Research Program of China[grant number 2012CB719906].
文摘Specific features of tile access patterns can be applied in a cache replacement strategy to a limited distributed high-speed cache for the cloud-based networked geographic information services(NGISs),aiming to adapt to changes in the access distribution of hotspots.By taking advantage of the spatiotemporal locality,the sequential features in tile access patterns,and the cache reading performance in the burst mode,this article proposes a tile sequence replacement method,which involves structuring a Least Recently Used(LRU)stack into three portions for the different functions in cache replacement and deriving an expression for the temporal locality and popularity of the relevant tile to facilitate the replacement process.Based on the spatial characteristics of both the tiles and the cache burst mode with regard to reading data,the proposed method generates multiple tile sequences to reflect spatiotemporal locality in tile access patterns.Then,we measure the caching value by a technique based on a weighted-based method.This technique draws on the recent access popularity and low caching costs of tile sequences,with the aim of balancing the temporal and spatial localities in tile access.It ranks tile sequences in a replacement queue to adapt to the changes in accessed hotspots while reducing the replacement frequency.Experimental results show that the proposed method effectively improves the hit rate and utilization rate for a limited distributed cache while achieving satisfactory response performance and high throughput for users in an NGIS.Therefore,it can be adapted to handle numerous data access requests in NGISs in a cloud-based environment.
