基于计算智能的网格资源监测预报系统
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
资源的分配与任务的调度,是网格计算的核心功能,而资源性能无疑是最重要的影响因素。网格资源的性能信息主要通过两种方式来获取:网格资源监测与网格资源预报。本文工作主要围绕网格资源的监测与预报进行展开,讨论了系统架构的设计与实现,网格资源监测策略,网格资源建模预报,资源模型的优化等关键问题。主要包含以下几方面内容:
     (1)针对网格系统特性讨论了网格资源监测预报系统的设计原则,继而基于Web服务资源框架提出了系统架构,对其系统工作流程与系统信息管理进行定义。本系统开销较低,而且能够与网格计算系统实现无缝融合。
     (2)基于两类典型的计算智能方法——前馈人工神经网络与支持向量回归——对网格资源多步预报进行建模。实验证明这两类方法能够适用于网格资源建模,尤其是支持向量回归,在精度与效率上均表现出良好性能。
     (3)基于两类典型的计算智能方法——遗传算法与粒子群算法——对网格资源预报模型进行优化。实验证明,计算智能的优化方法性能优于改进后的传统搜索策略,尤其是本文提出的并行混合粒子群算法,在精度与效率上均表现出良好性能。并行混合粒子群优化Nu-支持向量回归模型能够满足在线优化与预报的要求,适用于网格资源监测预报系统。
Grid computing breaks the limitations that exist in traditional shared environment, and becomes a leading trend in distributed computing system. Grid computing aggregates distributed and heterogeneous resources across Internet, regardless of differences between resources such as hardware structure,operating system, organization and geographical location. Such resources including computing resources, storage resources, data resources and other resources are combined dynamically to form high performance computing ability for solving problems in large-scale applications. From the point of view in system architecture, resource allocation and job scheduling is the core function of Grid computing, while there is no doubt that resource performance is an influencing factor of great importance.
     There are mainly two methods for acquiring performance information of Grid resources: Grid resource monitoring and Grid resource prediction. Grid resource monitoring cares about the running state, distribution, load and malfunction of resources in Grid system, by means of monitoring mechanism; Grid resource prediction focuses on the variation trend and running track of resources in Grid system, by means of modeling and analyzing historical monitoring data. Historical information generated by monitoring and future variation generated by prediction are combined together: to feed Grid system for analyzing performance, eliminating bottleneck, diagnosing fault, maintaining dynamic load balancing; and to help Grid user minimizing cost on time, space and money while acquiring task results.
     This research focuses on Grid resource monitoring and prediction, with main efforts dedicated on key issues including design and implementation of system architecture, monitoring strategies and modeling methodologies of Grid resources, optimization for resource model, etc.
     Grid resource monitoring and prediction derives from the seamless fusion of Grid technologies, resource monitoring strategies and resource prediction methodologies. Our research starts from Grid technologies. Characteristics and architecture of Grid system are firstly analyzed, then basic conceptions and relationships among them are illustrated, including Web service/Grid service, OGSA/OGSI (Open Grid Service Architecture/Infrastructure), WSRF (Web Service Resource Framework), etc. Furthermore, several typical resource monitoring and prediction systems are studied and introduced, then the monitoring strategies and prediction methodologies are summarized with comparison on their advantages and disadvantages. Such analysis and discussions are foundation of our research.
     Design principles for Grid monitoring and prediction system are given according to characteristics of Grid system, then the system architecture is proposed based on the WSRF. In order to reduce the influence on Grid system which is brought by of monitoring and prediction, overall architecture falls into two subsystems: resource monitoring subsystem inside computing environment and resource prediction subsystem outside computing environment. A series of supporting services are set up by way of Grid service technology. These services are deployed on Grid nodes and maintained by Globus service container. All functions of the monitoring and prediction system are accomplished through dynamical collaboration of the supporting services.
     These supporting services include monitoring service, prediction service, optimizing service, and information service. Monitoring service runs on computing node, it manages local resource sensors and generates resource monitoring data. Prediction service runs on prediction node, it manages resource prediction model and generates resource prediction data. Optimizing service runs on optimizing node, it evaluates efficiency and accuracy of candidate prediction model, and returns evaluation results to prediction service. Information service runs on resource database node, it is responsible for storage, query and publication of monitoring and prediction information. The workflow and information management of system are illustrated in details, while the performance is evaluated based on structure analysis and overhead tests.
     ANN (Artificial Neural Network) is born with parallelization, nonlinearity, robustness, and evolving capability. It breaks the limitation of traditional modeling methods, and becomes an important research category of computational intelligence. Feed forward neural networks are employed in modeling Grid resource prediction of multi-step-ahead. BPNN (Back Propagation Neural Network) is good at nonlinear mapping, while RBFNN (Radial Basis Function Neural Network) is good at clustering. These two neural networks are chosen for their wide applicability in practical problems. Furthermore, GHNN (General Hybrid Neural Network) is proposed which hybridizes RBFNN and BPNN together. Resource models based on three methods are compared during experiments. Results on efficiency and accuracy indicate that GHNN achieves lower error than BPNN and RBFNN in the cost of little increase on training time, and it is suitable for modeling Grid resource prediction of not only one-step-ahead but also multi-step-ahead.
     As a promising solution to nonlinear regression problems, SVM (Support Vector Machine) has recently been winning popularity due to its remarkable characteristics such as good generalization performance, the absence of local minima and sparse representation of the solution, thus is expected to achieve better performance. We discussed the modeling issues of SVR (Support Vector Regression), including modeling steps, choice of kernel functions, solution to QP (Quadratic Programming) problems, etc. Epsilon-SVR and Nu-SVR are realized as two typical algorithms in SVM. Their performance are tested in experiments and compared with GHNN. There is a performance similarity between two SVR models with default parameters, and they achieve better performance than GHNN according to comparative results on efficiency and accuracy. SVR is validated as a proper method in modeling Grid resource prediction of both one-step-ahead and multi-step-ahead, thus is chosen in building prediction system.
     After choosing modeling method, we further discuss the optimization issues of Grid resource prediction model of multi-step-ahead. Traditional search strategy plays the roles of optimizing method in many practical applications. However, this method has high complexity on time and space, thus is unfeasible for online system. TSS (Two Stage Search) strategy is proposed based on improvements to original strategy using granularity control mechanism. The optimizing performance of TSS strategy is validated through experimental results. It can’t break the limitation of enumeration in despite of accuracy enhancement to prediction model. The optimizing time is over 60 seconds, which can’t meet the efficiency demand for online system. Therefore, better optimizing method is also required.
     GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) are two typical stochastic optimization methods in the category of evolutionary computation. These two methods are employed to optimize SVR prediction model, for the expectation of achieving higher performance. Parameter selection is taken under consideration and TSS is taken under comparison. Experimental results indicate that the efficiency and accuracy of both GA and PSO are better than TSS. PSO achieves lower error and less optimizing time than GA, and has less prematurity phenomenons.
     Due to the superior performance of PSO, a PH-PSO (Parallel Hybrid Particle Swarm Optimization) algorithm is proposed which hybridizes discrete PSO and continuous PSO together, for the purpose of combinational optimization to Nu-SVR prediction model, including feature selection as well as hyper-parameter selection. Comparative results indicate that the PH-PSO algorithm has high efficiency and good convergence. Furthermore, the Nu-SVR model optimized by PH-PSO can achieve high accuracy in Grid resource prediction of multi-step-ahead. Besides, the optimizing time has been remarkably reduced to less than 3 seconds. The combinational model of PH-PSO and Nu-SVR meets the accuracy and efficiency demand of online system, thus is suitable for building Grid resource monitoring and prediction system.
     The results of the dissertation will contribute to the building and advancing of Grid infrastructure. In the next steps, our research will go further in the following applications: monitoring and prediction of Grid tasks, classification and evaluation of Grid resources, classification and evaluation of Grid tasks, etc. It is believed that as important tools for modeling and optimizing, computational intelligence will play a more important role by the virtue of its potential in the field of Grid computing.
引文
[1] Globus project [EB/OL]. Available at: http://www.globus.org , 2009-03-01.
    [2] Caniou Y, Caron E, Desprez F, et al. High Performance GridRPC Middleware [G]. In: Gravvanis G A, Morrison J P, Arabnia H R, et al., editors, Recent developments in Grid Technology and Applications, Nova Science Publishers, 2008.
    [3] YarKhan A, Dongarra J, Seymour K. GridSolve: The Evolution of Network Enabled Solver [C]. In Proceedings of the Grid-Based Problem Solving Environments: IFIP TC2/WG 2.5 Working Conference on Grid-Based Problem Solving Environments (Prescott, AZ, July 2006), Springer, 2007: 215-226.
    [4] NetSolve Project [EB/OL]. Available at: http://icl.cs.utk.edu/netsolve/ , 2009-03-01.
    [5] Hidemoto N, Yoshio T, Satoshi M, et al. The Design and implementation of a Fault-Tolerant RPC system: Ninf-C [C]. In Proceedings of the HPC ASIA 2004, 2004: 9-18.
    [6] Tanaka Y, Nakada H, Sekiguchi S, et al. Ninf-G: A Reference Implementation of RPC based Programming Middleware for Grid Computing [J]. Grid Computing, 2003, 1(1): 41–51.
    [7] Ninf-G project [EB/OL]. Available at: http://ninf.apgrid.org/ , 2009-03-01.
    [8] Roy A, Foster I, Gropp W, et al. MPICH-GQ: Quality-of-Service for Message Passing Programs [C]. In Proceedings of the 2000 ACM/IEEE conference on Supercomputing (SC’00, Dallas, Texas, United States, November 4-10), 2000: No. 19.
    [9] Karonis N, Toonen B, Foster I. MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface [J]. Journal of Parallel and Distributed Computing (JPDC) , May 2003, 63(5): 551-563.
    [10] MPICH-G project [EB/OL]. Available at: http://www3.niu.edu/mpi , 2009-03-01.
    [11] Chapman C, Wilson P, Tannenbaum T, et al. Condor Services for the Global Grid: Interoperability between OGSA and Condor [C]. In Proceedings of the 2004 UK E-Science All Hands Meeting, (Nottingham, UK), UK Engineering and Physical Science Research Council, 2004: 870-877.
    [12] Thain D, Tannenbaum T, Livny M. Distributed Computing in Practice: The Condor Experience [J]. Concurrency and Computation: Practice and Experience, 2005, 17(2-4): 323-356.
    [13] Condor Project [EB/OL]. Available at: http://www.cs.wisc.edu/condor , 2009-03-01.
    [14] Llorente I M, Montero R S, Huedo E, et al. GridWay Interfaces for On-demand Access to EGEE [C]. In Proceedings of the 2007 EGEE Conference, October 2007, Budapest, Hungary.
    [15] Badia R M, Du D, Huedo E, et al. Integration of GRID superscalar and GridWayMetascheduler with the DRMAA OGF Standard [C]. In Proceedings of the EuroPar 2008, Gran Canaria, Spain, selected by Lecture Notes in Computer Science, 2008, 5168: 445-455.
    [16] Gridway project [EB/OL]. Available at: http://www.gridway.org/doku.php , 2009-03-01.
    [17] Ding Z H, Wei X H, Luo Y, et al. Customized Plug-in Modules in Metascheduler CSF4 for Life Sciences Applications [J]. New Generation Computing, 2007, 25(4): 373-394.
    [18] Wei X H, Ding Z H, Yuan S T, et al. CSF4: A WSRF Compliant Meta-Scheduler [C]. In Proceedings of the 2006 World Congress in Computer Science, Computer Engineering, and Applied Computing, (GCA'06, Las Vegas, USA), 2006: 61-67.
    [19] CSF project [EB/OL]. Available at: http://www.globus.org/grid_software/computation /csf.php , 2009-03-01. [20 ] Eric N, Greg L. Understanding SOA with Web Services [M]. Addison Wesley, July 2006.
    [21] Li M Z, Baker M. The Grid Core Technologies [M]. Wiley & Sons, Inc, May 2006.
    [22] Foster I, Kishimoto H, Savva A. The Open Grid Services Architecture, Version 1.5 [EB/OL]. Available at: http://www.ogf.org/documents/GFD.80.pdf , 2009-03-01.
    [23] Czajkowski K, Ferguson D F, Foster I, et al. The WS-Resource Framework, Version 1.0 [EB/OL]. Available at: http://www-106.ibm.com/developerworks/library/ws-resource /ws-wsrf.pdf , 2009-03-01.
    [24] Bittencourt L F, Madeira E R M. A performance-oriented adaptive scheduler for dependent tasks on grids [J]. Concurrency and Computation: Practice and Experience, June 2008, 20(9): 1029-1049.
    [25] Tanwir S, Battestilli L, Perros H, et al. Dynamic scheduling of network resources with advance reservations in optical grids [J]. International Journal of Network Management, April 2008, 18(2): 79-105.
    [26] Condor Hawkeye project [EB/OL]. Availuable at : http://www.cs.wisc.edu/condor/hawkeye/ , 2009-03-01.
    [27] Massie M L, Chun B N, Culler D E. The Ganglia Distributed Monitoring System: Design, Implementation, and Experience [J]. Parallel Computing, July 2004, 30(7): 817-840.
    [28] Wolf F, Mohr B. Hardware-Counter Based Automatic Performance Analysis of Parallel Programs [C]. In Proceedings of the Conference on Parallel Computing (ParCo’03, Dresden, Germany, September 3) , 2003: 753-760.
    [29] Vetter J S, Reed D A. Real-time Performance Monitoring, Adaptive Control, and Interactive Steering of Computational Grids [J]. The International Journal of High Performance Computing Applications, 2000, 14(4): 357-366.
    [30] Shaffer E, Reed D A, Whitmore S, et al. Virtue: Immersive Performance Visualisation of Parallel and Distributed Applications [J]. IEEE Computer, December 1999, 32(12): 44-51.
    [31] Waheed A, Smith W, George J, et al. An Infrastructure for Monitoring and Management in Computational Grids [C]. In Proceedings of the 5th Workshop on Languages, Compilers and Run-time Systems for Scalable Computers, selected by Lecture Notes In Computer Science, March 2000, 1915: 235-245.
    [32] The Globus Heartbeat Monitor Specification [EB/OL]. Availuable at: http://www-fp.globus.org/hbm/heartbeat spec.html , 2009-03-01.
    [33] Dinda P A. Design, Implementation, and Performance of an Extensible Toolkit for Resource Prediction in Distributed Systems [J]. IEEE Trans. Parallel Distrib. Syst., 2006, 17(2): 160-173.
    [34] Dinda P A, O’Hallaron D R. Host load prediction using linear models [J]. Cluster Computing, 2000, 3(4): 265-280.
    [35] Swany D M, Wolski R. Multivariate resource performance forecasting in the network weather service [C]. In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, Baltimore, Maryland, November 2002: 1-10.
    [36] Wolski R, Miller L, Obertelli G, et al. Performance Information Services for Computational Grids [G]. In: Nabrzyski J, Schopf J, and Weglarz J, editors, Resource Management for Grid Computing, Kluwer Publishers, Fall, 2003.
    [37] Caron E, Chis A, Desprez F, et al. Design of plug-in schedulers for a GRIDRPC environment [J]. Future Generation Computer Systems, 2008, 24(1): 46-57.
    [38] Caron E, Desprez F. DIET: A scalable toolbox to build network enabled servers on the grid [J]. International Journal of High Performance Computing Applications, 2006, 20(3): 335-352.
    [39] Wu M, Sun X H. Grid harvest service: a performance system of grid computing [J]. J. Parallel Distrib. Comput., 2006, 66(10): 1322-1337.
    [40]姚淑萍,胡昌振.基于负载预测的分布式拒绝服务攻击检测方法研究[J].科技导报, 2005, 23(9): 11-13.
    [41]张国玲,甘井中,黄立和,等.一种基于BP神经网络和小波变换的网络流量预测模型[J].玉林师范学院学报(自然科学版), 2008, 29(5): 134-136.
    [42]黄谦,肖侬,刘波.基于支持向量机的网格负载信息预测模型[J].计算机技术与发展, 2007, 17(6): 32-35.
    [43] Vandy B, Bruno G. Brokering strategies in computational grids using stochastic prediction models [J]. Parallel Computing, May 2007, 33(4-5): 238-249.
    [44] Eswaradass A, Sun X H, Wu M. A neural network based predictive mechanism for available bandwidth [C]. In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS05), 2005: 33a.
    [45] Vapnik V N. The Nature of Statistical Learning Theory [M]. 2nd ed, Springer-Verlag, NewYork, 1999.
    [46] Prem H, Raghavan N R S. A Support Vector Machine Based Approach for Forecasting of Network Weather Services [J]. J. Grid Comput., 2006, 4(1): 89-114.
    [47] Lee L T, Tao D F, Tsao C. An adaptive scheme for predicting the usage of grid resources [J]. Comput. Electr. Eng., Pergamon Press, Inc., Tarrytown, NY, USA, 2007, 33(1): 1-11.
    [48] Foster I T. Globus toolkit version 4: software for service-oriented systems [J]. Journal of Computer Science and Technology, 2006, 21 (4): 513-520.
    [49] WebMDS project [EB/OL]. Available at: http://www.globus.org/toolkit/docs/ 4.0/info/webmds/developer-index.html , 2009-03-01.
    [50]蒋宗礼.人工神经网络导论[M].北京:高等教育出版社, 2001.
    [51]许伟.分布式系统中的主机负载预测与动态负载均衡研究[D].硕士学位论文,中南大学, 2004.
    [52]薛正华,董小社,李炳毅,等.基于BP神经网络的集群负载预测器[J].华中科技大学学报(自然科学版)增刊, 2007, 35(2): 164-167.
    [53]刘杰,黄亚楼.基于BP神经网络的非线性网络流量预测[J].计算机应用, 2007, 27(7): 1770-1772.
    [54]吴文清,赵黎明,刘嘉焜.基于混沌理论的网络流量BP神经网络预测[J].计算机工程与应用, 2005, 17: 3-6.
    [55] Lu J J, Wang Z Q. Internet traffic data flow forecast by RBF neural network based on phase space reconstruction [J]. Transactions of Nanjing University of Aeronautics and Astronautics, 2006, 23(4): 316-322.
    [56]王俊松,高志伟.基于RBF神经网络的网络流量建模及预测[J].计算机工程与应用, 2008, 44(13): 6-11.
    [57] Luo Z. On the Convergence of the LMS Algorithm with Adaptive Learning Rate for Linear Feedforward Networks [J]. Neural Computation, 1991, 3: 226~245.
    [58]胡春明,怀进鹏,孙海龙.基于Web服务的网格体系结构及其支撑环境研究[J].软件学报, 2004, 15(7): 1064-1073.
    [59]俞坚,韩燕波.面向服务的计算—原理及应用[M].北京:清华大学出版社, 2006.
    [60] Bandwidth data set [EB/OL]. Available at: http://www.slac.stanford.edu/comp/net/iepm- bw.slac.stanford.edu/combinedata/ , 2009-03-01.
    [61] Host load data set [EB/OL]. Available at: http://cs.uchicago.edu/~lyang/Load/ , 2009-03-01.
    [62] Mariyam M, Joel S, Paul B, et al. A machine learning approach to TCP throughput prediction [C]. In Proceedings of the 2007 ACM SIGMETRICS international Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '07, San Diego, California, USA, June 12 - 16) , 2007: 97-108.
    [63] He Q, Dovrolis C, Ammar M. On the predictability of large transfer TCP throughput [C]. In: Proceedings of the SIGCOMM05 (Philadelphia, Pennsylvania, USA, August 21-26) , 2005, 35(4): 145-156.
    [64] Huang C J, Cheng C L, Chuang Y T, et al. Admission control schemes for proportional differentiated services enabled internet servers using machine learning techniques [J]. Expert Syst. Appl., 2006, 31(3): 458-471.
    [65] Huang C J, Chuang Y T, Lai W K, et al. Adaptive resource reservation schemes for proportional DiffServ enabled fourth-generation mobile communications system [J]. Comput. Commun., 2007, 30(7): 1613-1623.
    [66] Beverly R, Sollins K, Berger A. SVM learning of IP address structure for latency prediction [C]. In Proceedings of the 2006 SIGCOMM workshop on Mining network data (MineNet '06, Pisa, Italy), 2006: 299-304.
    [67] Karush W. Minima of functions of several variables with inequalities as side constraints [D]. Masters thesis, Dept. of Mathematics, Univ. of Chicago, 1939.
    [68] Kuhn H W, Tucker A W. Nonlinear programming [C]. In Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probabilistics (Berkeley), 1951: 481-492.
    [69] Smola A J, Sch?lkopf B. A tutorial on support vector regression [J]. Statistics and Computing, 2004, 14(3): 199-222.
    [70] Sch?lkopf B, Smola A J, Williamson R C, et al. New support vector algorithms [J]. Neural Computation, 2000, 12(5): 1207-1245.
    [71] Keerthi S S, Lin C J. Asymptotic behaviors of support vector machines with Gaussian kernel [J]. Neural Computation, 2003, 15(7): 1667-1689.
    [72] Bradley P S, Mangasarian O L. Massive data discrimination via linear support vector machines [J]. Optimization, Methods and Software, 2000, 13(1): 1-10.
    [73] Osuna E, Freund R, Girosi F. Training support vector machines: an application to face detection [C]. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 1997: 130-136.
    [74] Platt J C. Fast training of support vector machines using sequential minimal optimization [G]. In: Sch?lkopf B, Burges C J C, Smola A J, editors, Advances in Kernel Methods - Support Vector Learning. MIT Press, Cambridge, MA, USA, 1999: 185 - 208.
    [75] Chang C C, Lin C J. LIBSVM : a library for support vector machines [EB/OL]. Available at: http://www.csie.ntu.edu.tw/?cjlin/libsvm/ , 2009-03-01.
    [76] Joachims T. Making large-Scale SVM Learning Practical [G]. In: Sch?lkopf B, Burges C J C, Smola A J, editors, Advances in Kernel Methods - Support Vector Learning, MIT Press, Cambridge, MA, USA ,1999: 169– 184.
    [77] SVM_LIGHT project [EB/OL]. Available at: http://www-ai.cs.uni-dortmund.de/ SOFTWARE/SVM_LIGHT/svm_light_v3.html , 2009-03-01.
    [78] Chalimourda A, Sch?lkopf B, Smola A J. Experimentally optimal nu in support vector regression for different noise models and parameter settings [J]. Neural Networks, 2004, 17: 127-141.
    [79] Browne M W. Cross-validation methods [J]. Journal of Mathematical Psychology, 2000, 44(1): 108-132.
    [80] Che X L, Hu L. Parallel multidimensional step search algorithm for epsilon insensithe support vector regression in time series prediction [C]. In Proceedings of the 2008 IEEE International Joint Conference on Neural Networks (IJCNN 2008, HongKong, June 1-6), 2008: 595-601.
    [81] Fukunaga K, Hummels D M. Leave-one-out procedures for nonparametric error estimates [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, Apr 1989, 11(4): 421-423.
    [82] Hsu C W, Chang C C, Lin C J. A practical guide to support vector classification [EB/OL]. Department of Computer Science and Information Engineering, National Taiwan University, 2003, Available at: http://www.csie.ntu.edu.tw/~cjlin/papers/guide/guide.pdf , 2009-03-01.
    [83]云庆夏.进化算法[M].北京,北京冶金工业出版社,1997.
    [84] Gregorio T P, Carlos A, Coello C, et al. EMOPSO: A Multi-Objective Particle Swarm Optimizer with Emphasis on Efficiency [J]. LNCS 4403, 2007: 272-285.
    [85] Branke J, Mostaghim S. About Selecting the Personal Best in Multi-Objective Particle Swarm Optimization [G]. In: Runarsson T P, Beyer H G, Burke E, et al., editors, Parallel Problem Solving from Nature. LNCS 4193, Springer, 2006: 523-532.
    [86]李丙春,孙蕾.基于粒子群优化的神经网络预测模型[J].新疆大学学报(自然科学版), 2007, 24(4): 481-485.
    [87]常桂娟.改进粒子群算法在作业车间调度问题中的应用[J].四川师范大学学报(自然科学版), 2009, 32(1): 139-142.
    [88]吴景龙,杨淑霞,刘承水.基于遗传算法优化参数的支持向量机短期负荷预测方法[J].中南大学学报(自然科学版), 2009, 40(1): 180-184.
    [89]路志英,李艳英,陆洁,等.粒子群算法优化RBF-SVM沙尘暴预报模型参数[J].天津大学学报, 2008, 41(4): 413-418.
    [90] Holland J H. Adaptation in natural and artificial systems [M]. The University of Michigan Press, 1975.
    [91] Adewuya A A. New methods in genetic search with real-valued chromosomes [D]. Master’s thesis, Cambridge: Massachusetts Institute of Technology, 1996.
    [92] Kennedy J, Eberhart R C. Particle swarm optimization [C]. In Proceedings of IEEEInternational Conference on Neural Networks (Perth, Australia), 1995, 4: 1942-1948.
    [93] Shi Y, Eberhart R C. A modified particle swarm optimizer [C]. In Proceedings of the IEEE International Conference on Evolutionary Computation (Icec, Alaska), 1998: 69-73.
    [94] Elbeltagi E, Hegazy T, Grierson D E. Comparison among five evolutionary-based optimization algorithms [J]. Advanced Engineering Informatics, 2005, 19(1): 43-53.
    [95] Alper K, Reyyan Y, Süveyda Y, et al. Evolutionary Selection of Minimum Number of Features for Classification of Gene Expression Data Using Genetic Algorithms [C]. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, ACM, New York, NY, USA, 2007: 401-406.
    [96] Kennedy J, Eberhart R C. A Discrete Binary Version of the Particle Swarm Optimization [C]. In Proceedings of IEEE International Conference on Neural Networks (Perth, Australia), 1997, 5: 4104-4108.
    [97] Zhang Y Y, Sun W, Inoguchi Y. Predict task running time in grid environments based on CPU load predictions [J]. Future Generation Computer Systems, 2008, 24(6): 489-497.
    [98] Jin S L, Hu L, Guo D, et al. Research on Grid Resources' Clustering Methods [C]. In Proceedings of the 2nd IEEE International Conference on Convergence Information Technology (ICCIT’07, Gyeongju, Republic of Korea, November 23-25), 2007: 2034-2039.
    [99] Doulamis N, Doulamis A, Litke A, et al. Adjusted fair scheduling and non-linear workload prediction for QoS guarantees in grid computing [J]. Comput. Commun., 2007, 30(3): 499-515.
    [100]黄敬磊. GPU通用计算中的数据结构组织与应用研究[D].硕士论文,解放军信息工程大学, 2007.
    [101]曾文英,赵跃龙,宋玮,等.移动网格体系结构及其资源选择方法[J].计算机工程, 2008, 34(20): 93-95.
    [102]高岚岚.云计算与网格计算的深入比较研究[J].海峡科学, 2009, 2: 56-57.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700