Distributed Storage And Load Balancing Algorithm On The Server

These years of Internet technology to flourish, all kinds of sophisticated components, tools, frameworks and more rich, various theories developed gradually. Technical challenges traditional enterprise applications deal mainly with is that the processing load is messy, ever-changing business logic,but technical challenges faced by large-scale web server is very high numbers of users to access and process vast amounts of data. In the face of such a large non-functional requirements, we not only need to ensure that the entire server system to provide high-performance services to users, but also need to ensure that the entire server system can provide a high-availability (the system to ensure proper operation and reliable use), telescopic (ensure that the system can readily expand and shrink) architecture.Faced with such a large number of users to access and store vast amounts of data, in practice, we resolve the constraints of read speed to the local cache and the small capacity by a distributed cache.we also use the distributed computing to solve parallel processing of multiple concurrent requests.This paper focuses on distributed storage and distributed processing technology. Analysis of he deployment of distributed data separation, to achieve different types of data stored on different memory,in order to achieve the appropriate storage requirements of different data. Study and summarize distributed deployment policy request tasks.Finally, this paper studied and compared the existing load balancing scheduling algorithm, and propose improvements based on the assessment of processing node processing capacity load balancing algorithm. The algorithm is based on dynamic load balancing algorithm, previously estimated processing capacity of processing nodes then dynamically allocating tasks according to the processing capability of each node.