A Novel Cache Scheme for Cluster-Based Streaming Proxy Server

Author(s):  
Song Wu ◽  
Hai Jin ◽  
Jie Chu ◽  
Kaiqin Fan
Keyword(s):  
2014 ◽  
Vol 134 (8) ◽  
pp. 1104-1113
Author(s):  
Shinji Kitagami ◽  
Yosuke Kaneko ◽  
Hidetoshi Kambe ◽  
Shigeki Nankaku ◽  
Takuo Suganuma
Keyword(s):  

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 176
Author(s):  
Wei Zhu ◽  
Xiaoyang Zeng

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cache based on the decision tree algorithm, which can optimize the average memory access time of cache without modifying the cache coherent protocol. By monitoring the application running state, the cache associativity is periodically tuned to the optimal cache associativity, which is determined by the decision tree model. This paper implements the proposed decision tree-based adaptive reconfigurable cache in the GEM5 simulator and designs the key modules using Verilog HDL. The simulation results show that the proposed decision tree-based adaptive reconfigurable cache reduces the average memory access time compared with other adaptive algorithms.


2013 ◽  
Vol 284-287 ◽  
pp. 2855-2859
Author(s):  
Li Te Shen ◽  
Shaw Hwa Hwang ◽  
Chi Jung Huang ◽  
Cheng Yu Yeh

The performance improvement on SIP-based VoIP server is given in this paper. The signaling server “SIP Proxy Server” and media streaming server “Media Relay Server” are applied. Firstly, the performance of VoIP server is analyzed and evaluated in detail. Then the effective method is applied to improve the performance of VoIP server. In the analysis results of SIP Proxy Server, the CPU time for the registration and call-setup sessions need 3.241 ms and 7.985 ms respectively. Moreover, in the Media Relay Server system, when the packet size from 1 to 32 bytes, the maximum throughput of packet is about 82,000 and 16,000 per second for UDP and TCP respectively. The large the packet, the less throughput is tenable. There are three methods applied to improve the performance. The capacity by 31 times is achieved. The capacity with 3,524 calls for each Media Relay Server is achieved. The improved method proposed in this paper is reasonable.


2010 ◽  
Vol 15 (10) ◽  
pp. 113-120 ◽  
Author(s):  
Jun-Pyo Lee ◽  
Chul-Young Cho ◽  
Cheol-Hee Kwon ◽  
Jong-Soon Lee ◽  
Tae-Yeong Kim

2013 ◽  
Author(s):  
Sureshkumar V. Subramanian ◽  
Rudra Dutta
Keyword(s):  

Author(s):  
Seongho Park ◽  
Seungwon Lee ◽  
Yongwoon Park ◽  
Hwasei Lee ◽  
Yongju Kim ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document