The adaptability and collaboration of the multi-core runtime system is studied to address the problems that the current multi-core runtime can easily lead to intensified competition for processor resources and the system scalability is inferior. An adaptive and collaborative scheduling model
named ACSM
is presented based upon the dynamic feedback-control principle by taking resource allocation
runtime control
and task execution as a holistic system. The ACSM dynamically reallocates and manages processor resources among and within workloads in both centralized and distributed manners. The superiorities of ACSM over the current multi-core runtime system are as follows. The ACSM maintains good programmability and portability
enhances efficiency and adaptability in processor resources allocation
and eliminates the need of explicitly specifying the number of cores. The experiment results show that ACSM greatly reduces the competition of processor resources and improves both the overall system performance and the usability of the current multi-core programming models. Comparisons with the scheduling algorithm that relies only on the original multi-core runtime show that applications of ACSM reduce the run time by about 50% or even more
especially when the system load increases.
关键词
Keywords
references
HILL M, MARTY M. Amdahl's law in the multicore era [J]. Computer, 2008, 41(7): 33-38.
YI Hui-Zhan, LIU Yong-Peng. An efficient architecture method for improving energy efficiency: parallel processing [J]. Chinese Journal of Computers, 2009, 32(12): 2475-2481.
CHAPMAN B, HUANG Lei. Enhancing OpenMP and its implementation for programming multicore systems [M]∥Parallel Computing: Architectures, Algorithms, and Applications. Amsterdam, Netherlands: IOS Press, 2008:3-18.
REINDERS J. Intel threading building blocks: outfitting C++ for multi-core processor parallelism [M]. Sebastopol, CA, USA: O'Reilly Media, 2007: 133-168.
FRIGO M, LEISERSON C E, RANDALL K H. The implementation of the Cilk-5 multithreaded language [C]∥Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, USA: ACM, 1998: 212-223.
LONG Guo-Ping, ZHANG Jun-Chao, FAN Dong-Rui. Architectural support and evaluation of Cilk language on many-core architectures [J]. Chinese Journal of Computers, 2008, 31(11): 1975-1985.
BIENIA C, KUMAR S, SINGH J P, et al. The PARSEC benchmark suite: characterization and architectural implications [C]∥Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques. New York, USA: ACM, 2008: 72-81.
AGRAWAL K, LEISERSON C E, SUKHA J. Executing task graphs using Work-Stealing [C]∥Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium(IPDPS). Piscataway, NJ, USA: IEEE, 2010: 1-12.
AGRAWAL K, HE Y, LEISERSON C E. Adaptive work stealing with parallelism feedback [C]∥Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming(PPoPP). New York, USA: ACM, 2007: 112-120.