Analysis Of SMP On Linux Kernel

Computer's processing capability grew rapidly and continuously in the past twenty years, but the new applications require more powerful computer with higher processing capability, especially along with the rapid popularization, Internet servers must have powerful parallel processing capability. SMP(Symmetrical MultiProcessing) is a rather matureparallel processing technology with pervasive application and high performance/pricerate, it's especially applicable in small parallel server, in addition, it's also a basetechnology in constructing large scale parallel server. Linux is a free and open source operating system. Thousands upon thousands computer practitioners have been appealed by its opening character to improve and perfect it. Because the history of linux parallel technology is short, and linux merely began to provide SMP support from version 2.0, so faultinesses are unavoidable. This thesis aims at researching and improving the SMP parallel processing mechanism for linux kernel. First, it introduces the development of present parallel processing technology and the history of linux parallel processing supporting. Second, though the research of SMP specification based on Intel processor platform, we comprehend the base of linux SMP parallel processing. Then, we analyze the SMP mutual exclusion of linux, point out the limitation of the algorism, and provide an effective improvement. Then we study the Linux scheduler for SMP system, analyze its capability and point out the limitation.Finally,we research the allocation algorism and reclamation algorism of physical pages, analyze its performance under SMP conditions, and bring forward a meliorative strategy.