Android, an open source system exploited by Google, has experienced a rapid development in the past a few years in the field of intelligent mobile because of its advantages-open source and excellent function. The numb...Android, an open source system exploited by Google, has experienced a rapid development in the past a few years in the field of intelligent mobile because of its advantages-open source and excellent function. The number of professionals and enthusiasts who research on Android is growing rapidly in the same time. Android, as an abstraction between software layer and hardware layer based on Linux kernel, can complete the optimization of system by modifying the kernel part. The purpose of this design is to master the processes of kernel-compiling and transplanting, and to learn the methods of memory scheduling algorithm and kernel menaory test. First of all, this thesis introduces the installation of Linux system, and then, it presents the method to build the environment for Android kernel compiling and the process of compiling. The key point of the design is to introduce the SLAB, SLOB, SLUB, SLQB allocators in memory scheduling, and carry on a research on optimization with these memory allocators. HTC Incredible S, as an experimental mobile phone whose Android kernel version is 2.6.35, is employed to deal with all these tests. A comparison of kernel codes before and after optimization has been made. The two kernel codes have been transplanted into the terminal of the experimental mobile phone, which will be respectively tested with its stability, memory performance and overall performance. Finally, it concludes that result of being transplanted the SLQB memory allocator is the optimal one of all.展开更多
Chip multiprocessors(CMPs) allow thread level parallelism,thus increasing performance.However,this comes with the cost of temperature problem.CMPs require more power,creating non uniform power map and hotspots.Aiming ...Chip multiprocessors(CMPs) allow thread level parallelism,thus increasing performance.However,this comes with the cost of temperature problem.CMPs require more power,creating non uniform power map and hotspots.Aiming at this problem,a thread scheduling algorithm,the greedy scheduling algorithm,was proposed to reduce the thermal emergencies and to improve the throughput.The greedy scheduling algorithm was implemented in the Linux kernel on Intel's Quad-Core system.The experimental results show that the greedy scheduling algorithm can reduce 9.6%-78.5% of the hardware dynamic thermal management(DTM) in various combinations of workloads,and has an average of 5.2% and up to 9.7% throughput higher than the Linux standard scheduler.展开更多
文摘Android, an open source system exploited by Google, has experienced a rapid development in the past a few years in the field of intelligent mobile because of its advantages-open source and excellent function. The number of professionals and enthusiasts who research on Android is growing rapidly in the same time. Android, as an abstraction between software layer and hardware layer based on Linux kernel, can complete the optimization of system by modifying the kernel part. The purpose of this design is to master the processes of kernel-compiling and transplanting, and to learn the methods of memory scheduling algorithm and kernel menaory test. First of all, this thesis introduces the installation of Linux system, and then, it presents the method to build the environment for Android kernel compiling and the process of compiling. The key point of the design is to introduce the SLAB, SLOB, SLUB, SLQB allocators in memory scheduling, and carry on a research on optimization with these memory allocators. HTC Incredible S, as an experimental mobile phone whose Android kernel version is 2.6.35, is employed to deal with all these tests. A comparison of kernel codes before and after optimization has been made. The two kernel codes have been transplanted into the terminal of the experimental mobile phone, which will be respectively tested with its stability, memory performance and overall performance. Finally, it concludes that result of being transplanted the SLQB memory allocator is the optimal one of all.
基金Projects(2009AA01Z124,2009AA01Z102) supported by the National High Technology Research and Development Program of ChinaProjects(60970036,61076025) supported by the National Natural Science Foundation of China
文摘Chip multiprocessors(CMPs) allow thread level parallelism,thus increasing performance.However,this comes with the cost of temperature problem.CMPs require more power,creating non uniform power map and hotspots.Aiming at this problem,a thread scheduling algorithm,the greedy scheduling algorithm,was proposed to reduce the thermal emergencies and to improve the throughput.The greedy scheduling algorithm was implemented in the Linux kernel on Intel's Quad-Core system.The experimental results show that the greedy scheduling algorithm can reduce 9.6%-78.5% of the hardware dynamic thermal management(DTM) in various combinations of workloads,and has an average of 5.2% and up to 9.7% throughput higher than the Linux standard scheduler.
