Xuwang Teng
ABSTRACT
The author introduces the basic flow of building a network concurrent programming model, analyzes the common network service load types, and the limitations of common network concurrency models such as Apache and Nginx models in high concurrency scenarios. Finally presents an adaptive network concurrent service scheme in a single-machine scenario, analyzed its performance when faced with different types of network service load. The new model based on the IO multiplexing model, which can effectively utilize the multi-core CPU resources, and can be adaptively processing IO-intensive and CPU-intensive service requests, also can be customized with the custom load balancing strategy, so as to ensure the low average delay of the service request.
- Nedelcu C.Nginx HTTP Server.Birmingham.PacktPublishing, 2010:242--245.Google Scholar
- Kegel D.The C10K problem.2011.http://www.kegel.com/c10k.html.Google Scholar
- Ling ZhiYi.Liu ZheXing. I/O Performance Comparison of Apache and Nginx in High Concurrence Environment.2012.Google Scholar
- Brian Goetz. Thread Pools Help Ach ieve Optimum Resource Utiliza-tion[EB/OL]. http://www-900.ibm.com/developerW orks/cn/java/j-jtp0730/index_eng.shtm l, 2002-07.Google Scholar
Index Terms
- An Adaptive Network Concurrent Service Scheme in Single-machine Scenario
Recommendations
Adaptive Optimization for Petascale Heterogeneous CPU/GPU Computing
CLUSTER '10: Proceedings of the 2010 IEEE International Conference on Cluster ComputingIn this paper, we describe our experiment developing an implementation of the Linpack benchmark for TianHe-1, a petascale CPU/GPU supercomputer system, the largest GPU-accelerated system ever attempted before. An adaptive optimization framework is ...
An Adaptive Control Strategy for Managing Concurrent Service Requests in Service-Based Systems
COMPSACW '13: Proceedings of the 2013 IEEE 37th Annual Computer Software and Applications Conference WorkshopsService-Oriented Architecture (SOA) has attracted substantial research effort over the past decade. In service-based systems, where multiple services providing the same functionality are available, it is necessary to select the appropriate services to ...
Long-Lived Adaptive Collect with Applications
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer ScienceA distributed algorithm is adaptive if the worst case step complexity of its operations is bounded by a function of the number of processes that are concurrently active during the operation (rather than a function of N, the total number of processes, ...
Comments