摘要
网格是一种能够集成地理上分散资源的基础设施。它能将各种信息资源接成一个整体,向每个用户提供包括计算能力、数据存储能力以及各种应用工具等一体化的透明服务。网格资源是分布在Internet环境中的,资源本身具有异构性、动态性和自治性。网格任务在不同的资源上的性能表现不同,因此对于提高由多个任务构成的网格应用的整体性能而言,需要网格任务调度为应用中的每个任务指派合适的资源。在网格任务调度中,依赖任务调度问题已经引起了广泛的关注。网格依赖任务调度问题,由于对某一任务的资源指派将影响对其他任务的资源指派,因此,为了实现网格应用性能优化的调度目标,需要采取全局的调度策略。该调度策略是基于预知的应用和资源信息,在运行前制定全局调度计划。网格应用的各个任务将按照计划中的时间安排在指派资源上执行。由于网格资源是动态变化的且这种变化会随时发生,因此在应用的运行期间资源可能发生变化,这种变化将影响网格应用的最优性。为此,就需要网格依赖任务重调度,以便在资源发生变化时,对全局调度计划进行调整,以实现应用性能优化的目标。
以应用性能优化为目标的网格依赖任务重调度,需要采取全局优化的的重调度策略与资源变化触发的重调度触发方式,而这将面临重调度效率低与触发频繁等困难。为解决上述困难,本文从确定重调度任务范围、减少资源数量、提高备选资源稳定性、减少无用重调度四个方面着手,提出了基于资源动态性度量的网格依赖任务重调度机制。该机制以资源动态性度量模型为基础,以基于视图的资源组织、重调度触发机制以及重调度任务波及域计算为支撑,尽量利用动态性较弱的资源,合理缩小重调度任务范围,并在合适的时机触发网格依赖任务重调度过程,解决了网格依赖任务重调度效率低、触发频繁的问题,从而实现了以应用性能优化为目标的网格依赖任务重调度。本文主要完成了如下的工作：
(1)针对网格依赖任务重调度面临的效率低和触发频繁两个问题,本文研究基于资源动态性度量的网格依赖任务重调度机制(G-DERM),提出资源动态性度量模型。该模型对个体资源及整体资源环境的性能和性能变化周期进行度量。在资源动态性度量的基础,G-DERM通过在合适的时机触发网格依赖任务重调度过程、尽量利用动态性较弱的资源、合理缩小重调度任务范围,能够有效的提高网格依赖任务重调度的效率,降低重调度的触发频繁。
(2)针对如何减少备选资源数量和提高备选资源稳定性问题,本文研究基于视图机制的资源组织模型。该模型是一个资源的三层组织结构,是在以应用的资源需求和资源动态性度量结果对网格资源进行双重过滤的基础上构建起来的。该模型能够过滤性能相近的应用可用资源中的强动态性资源,提高重调度备选资源的稳定性,进而提高网格依赖任务重调度的效率并降低重调度触发频率。
(3)针对如何减少无用重调度问题,本文研究重调度触发机制,提出重调度的触发规则,建立触发规则的层次结构。该规则在网格资源动态性度量的基础上,分析资源变化对应用性能的影响,判断是否需要触发重调度,并确定重调度触发时刻,延时触发在任务执行时间估计准确性较低情况下的资源变化引发的重调度过程,减少无用重调度次数,降低网格依赖任务重调度触发频率。
(4)针对如何确定重调度任务范围问题,本文研究重调度任务波及域及计算算法。在度量资源环境动态性和估计任务完成时间的基础上,通过判断任务完成时间是否在资源环境的变化周期内,重调度过程中将不考虑完成时间不在该周期内的任务,即不考虑对网格应用性能优化支持较弱的任务；并且通过网格应用中任务间所存在的点波及、依赖波及以及连通波及关系计算重调度任务波及域,以在不影响网格应用优化效果的基础上,缩小任务范围,提高重调度的效率。
(5)针对重调度任务波及域内网格依赖任务重调度求解效率与优化效果问题,本文研究基于G-DERM的网格依赖任务重调度模型和算法。提出基于DAG的重调度模型及改进HEFT启发式算法,和基于T-RAG优化选取的重调度模型及免疫遗传算法。在保证效率的同时提高网格应用的优化效果。
(6)针对如何验证本文所提出的基于资源动态性度量的网格依赖任务重调度机制有效性问题,本文搭建G-DERM模拟实验环境,并进行一系列实验验证所提出的重调度触发机制、波及域计算、资源组织模型对提高网格依赖任务重调度的效率,降低重调度触发频率的支持作用。
Grid is a kind of infrastructure that could integrate geographically dispersed resources. It could connect all kinds of information resources as a whole, and provide each user transparent integration services, including computing power, data storage capacity as well as various applications. Grid resources are distributed on the dynamic Internet environment, with special natures of heterogeneous, dynamic and self-governing. On different grid resources, the task's performance is different. Thus, to achieve the overall performance of a grid application composed by a set of tasks, task scheduling is needed to assign the suitable resource for each task. In grid task scheduling problem, dependent tasks scheduling problem has been widely concerned. In dependent tasks scheduling problem, an assignment for one task may affect the other task's assignment. Therefore, to achieve the overall optimal performance or grid application, global optimization scheduling policy is needed, which relies on the anticipated information of the application and resources, and makes the total schedule before application starts to run according to the time arrangement and resource assignment in the schedule. Because of the dynamic nature of grid resource, resource's performance and availability will change very often and at any time. So during grid application running-time, the resource will change, and affect the optimum of the application's performance. Therefore, dependent tasks rescheduling is needed, to adjust the schedule for the application's optimal performance.
To optimize application performance, global-optimization rescheduling policy and resource-change-trigger rescheduling method are needed for grid dependent tasks rescheduling, which lead to two difficulties:low rescheduling efficiency and frequently trigger. To address the above two difficulties, the paper presents a grid dependent tasks rescheduling mechanism based on resource dynamic evaluation, beginning with the rescheduling task scope identification, resources reduction, resources stability promotion and useless rescheduling avoiding problems. With the foundation of resource dynamic evaluation, and supported by the view-based resources organization model, rescheduling trigger mechanism and rescheduling tasks spread domain computing, the mechanism could make full use of resources with weaker dynamic and reasonably narrow the rescheduling task scope and trigger the rescheduling process at the right time to solve the low rescheduling efficiency and frequently trigger. problem. This paper completes the following main tasks:
(1) To solve the difficulties of low rescheduling efficiency and frequently triggering faced by current rescheduling approaches, this paper studies grid dependent tasks rescheduling mechanism based on resource dynamic evaluation (G-DERM) and proposes resource dynamic evaluation model. Such model can evaluate the performance and changing cycle of single grid resource and resource environment. Based on resource dynamic evaluation, G-DERM can trigger the rescheduling process at the right time, make full use of dynamic resources with weaker dynamic and reasonably narrow the rescheduling task scope to solve the low rescheduling efficiency and frequently triggering problem.
(2) To solve the problems of reducing the number of resources and improving the stability of candidate resources, this paper studies the view-based resources organization model. Such model is a three-layer structure for organizing resources which is established based on application requirement as well as resource dynamic evaluation. Such model can filter out high dynamic resources with similar performance for certain application. Based on such model, the stability of candidate resources for rescheduling can be enhanced. Thus, the rescheduling efficiency can be promoted and triggering frequency can be slowed down.
(3) To solve the problem of avoiding useless rescheduling problem, this paper studies rescheduling triggering mechanism and proposes hierarchical rescheduling triggering rules. Through making use of the resource dynamic evaluation results and analyzing the resources changes'impact on application performance, these rules can determine whether to trigger rescheduling process, identify triggering time and delay triggering rescheduling process due to the estimation with low accuracy of task's execution time on resources. Thus, the number of useless rescheduling processes can be reduced and the triggering frequency of rescheduling processes can be slowed down.
(4) To solve the problem of determining the scope of rescheduling tasks, this paper studies the rescheduling tasks spread domain and its computing algorithm. Based on resource environment dynamic evaluation results and task finish time estimation, through judging whether the task finish time is in the resource environment change cycle, the rescheduling process will not consider the tasks whose finish time is beyond the resource environment change cycle. Rescheduling tasks spread domain is computed according to the tasks' point-relationship, dependence-relationship and connection-relationship. Thus, the tasks scope can be narrowed and the rescheduling efficiency can be promoted with litter affecting the optimization of grid application performance.
(5) To solve the problem of improving the rescheduling efficiency and optimization, this paper studies the G-DERM based grid dependent tasks rescheduling model and algorithms. This paper propose a DAG based rescheduling model and improved HEFT algorithm, as well as a T-RAG optimal selection based rescheduling model and immune genetic algorithm. Thus, the rescheduling efficiency and optimization performance can be ensured.
(6) To solve the problem of verifying the effectiveness of proposed resource dynamic evaluation based grid dependent tasks rescheduling mechanism, this paper establishes a G-DERM simulation environment and conducts a set of experimentations to verify the better performance of the proposed rescheduling triggering mechanism, rescheduling tasks spread computing algorithm, and resource organization model in improving the efficiency of rescheduling and slowing down the triggering frequency.
引文
1. Foster I, Kesselman C. The Grid:Blueprint for a Future Computing Infrastructure [M], San Francisco, USA:Morgan Kaufmann Publishers Inc.,1999.
2. Foster I, Kesselman C, Nick J, et al. The Physiology of the Grid:An Open Grid Services Architecture for Distributed Systems Integration [A], Global Grid Forum[C],2002.1-10.
3. Foster I, Kesselman C, Tuecke S. The Anatomy of the Grid:Enabling Scalable Virtual Organizations [J]. International Journal of High Performance Computing Applications, 2001,15(3):200-222.
4. Klaus Krauter, Rajkumar Buyya.A taxonomy and survey of grid resource management systems for distributed computing [J]. Software-Practice and Experience,2002,32: 135-164
5. Brunett S, Czajkowski K, Fitzgerald S, et al. Application Experiences with the Globus Toolkit[A],Proceedings of 7th IEEE Symp.on High Performance Distributed Computing[C],Chicago,USA:IEEE Press,1998:81-88.
6. Prudhomme T, Kesselman C, et al. NEESgrid:A distributed virtual laboratory for advanced earthquake experimentation and simulation:Scoping study. Technical report, 2001.
7. Allcock W, Chervenak A, Foster I,et al.The Data Grid:Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets[J].Journal of Network and Computer Applications,2001,23:187-200
8. Avellino G, Beco C,Cantalupo B,et al. The DataGrid Workload Management System: Challenges and Results [J] Journal of Grid Computing,2004,2(4):353-367
9. 胡春明,怀进鹏,孙海龙.基于Web服务的网格体系结构及其支撑环境研究,软件学报,2004,17(7)：1064-1073
10. Buyya R,Abramson D,and Giddy J.Economy Driven Resource Management Architecture for Computational Power Grids [A],International Conference on Parallel and Distributed Processing Techniques and Applications[C](PDPTA2000),Las Vegas,USA,2000.
11. Tuecke S, Czajkowski K, et al. Open grid services infrastructure (OGSI) Version 1.0, http://forge.gridforum.org/projects/ggf-editor/document/draft-ogsi-service-1/en/1,2003
12. Foster I, Roy A, Sander V. A quality of service architecture that combines resource reservation and application adaptation[A], Proc. of the 8th Int'l Workshop on Quality.of Service[C],2000,181-188.
13. D. Box. Service-Oriented Architecture and Programming (SOAP)-Part 1 & Part 2, MSDN TV archive,2003.
14. Service-Oriented Architecture (SOA) Definition. http://www.service-architecture.com /web-services/articles/service-oriented_architecture_soa_definition.html.
15. He H. What is Service-Oriented Architecture, http://webservices.xml.com/pub/a/ws/ 2003/09/30/soa.html,2003.
16. EI-Rewini H, Lewis T, Ali H. Task Scheduling in Parallel and Distributed Systems [M], Englewood Cliffs, New Jersey:Prentice Hall,1994.
17. Belkhale K and Banerjee P. Approximate algorithms for the partitionable independent task scheduling problem[A], International Conference on Parallel Processing [C],1999, 1:72-75.
18. Fujimoto N, Hagihara K. A comparison among grid scheduling algorithms for independent coarse-grained tasks [A], Proc. of the 2004 Symp. On Applications and the Internet-Workshops [C]. Washington:IEEE Computer Society Press,2004,674-680.
19. Noriyuki Fujimoto, Kenichi Hagihara. Near-Optimal Dynamic Task Scheduling of Independent Coarse-Grained Tasks onto a Computational Grid[A], International Conference on Parallel Processing[C](ICPP'03),2003,391-397.
20. Qiang-Sheng Hua, Zhi-Gang Chen, et al. A New Method for Independent Task Scheduling in Nonlinearly DAG Clustering[A], International Symposium on Parallel Architectures, Algorithms and Networks[C](ISPAN'04),2004,187-194.
21. Shi Wei, Zheng Wei-min. The Balanced Dynamic Critical Path Scheduling Algorithm of Dependent Task Graphs [J].Chinese Journal of Computers,2001,24:991-997.
22. Roslof J, Harjunkoski I, Bjorkqvist J,et al. An MIP P-based Reordering Algorithm for Complex Industrial Scheduling and Rescheduling[J].Computers and Chemical Engineering,2001,25(4):821-828.
23. Zhao Henan, Sakellariou Rizos. A Low-Cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems [A]. European Across Grids Conference[C],2004,21-31.
24. Ullman J. NP-Complete Schedulling Problems[J]. Journal of Computer and System Sciences,1975,10:384-394.
25. Andronikos T, Koziris N.Optimal Scheduling for UET-UCT Grids Into Fixed Number of Processors [A].In:Proceedings of 8th Euromicro Workshop on Parallel and Distributed Processing[C].IEEE Press,2000,237-243
.26.张伟哲,刘欣然等.信任驱动的网格作业调度算法,通信学报,2006,27(2)：73-79.
27.袁禄来,曾国荪,姜黎立等.网格环境下基于信任模型的动态调度[J],计算机学报,2006,29(7)：1117-1123.
28. Yuan Lu-lai,Zeng Guo-sun,Jiang Li-li,et al. Dynamic level scheduling based on trust model in Grid computing[J].Journal of Computers,2006,29(7):1117-1123.
29. He X,Sun X,Laszewski G. A QoS guided scheduling algorithm for grid computing[J], Journal of Computer Science and Technology,2003,18(4):442-451.
30. Matt Haynos网格观点：深入探讨调度程序,http://www-128.ibm.com/developerworks /cn/grid/gr-sked/.
31. Erik Elmroth and Johan Tordsson. A Grid Resource Broker Supporting Advance Reservations and Benchmark-Based Resource Selection[J]. Applied Parallel Computing of Lecture Notes in Computer Science.2006,3732:1061-1070
32. David Abramson,Rajkumar Buyya, and Jonathan Giddy. A computational economy for grid computing and its implementation in the Nimrod-G resource broker[J], Future Generation Computer Systems,2002,18(8):1061-1074
33. K. Kim and K. Nahrstedt. A resource broker model with integrated reservation scheme[A], Proc. IEEE Int. Conf. Multimedia[C],2000,859-862.
34. Buyya R, Chapin S, DiNucci D. Architectural models for resource management in the grid[A]. Proceedings of the lth IEEE/ACM International Workshop on Grid Computing[C],2000,18-35
35. Czajkowski K, and Foster I. A resource management architecture for metacomputing systems[A], Proc. of the Workshop on Job Scheduling Strategies for Parallel Processing[C],1997,62-82.
36. Czajkowski K, Foster I, and Kesselman C.Resource Co-Allocation in Computational Grids[A], Proc. of the 8th IEEE Int. Symp. High Performance Distributed Computing, 1999,219-228.
37. Foster I, Kesselman C, et al. A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation[A]. In 7th International Workshop on Quality of Service[C] (IWQoS), London, UK,1999,311-320.
38. Buyya R, Chapin S, DiNucci D. Architectural models for resource management in the Grid[A]. Proceedings of 1st IEEE/ACM International Workshop on Grid Computing[C] (Grid'00), December 2000,18-35.
39. T. Dimitrakos, D. Mac Randal, et al. Trust, security and contract management challenges for Grid-based application service provision[A].2nd International Conference on Trust Management[C], LNCS, Springer-Verlag,2004,115-123.
40. G. Avellino. The EU DataGrid Workload Management System:Towards the Second Major Release[A], Proceedings of the 2003 Computing in High Energy and Nuclear Physics Conference[C] (CHEP03), La Jolla, CA, USA, March 2003.
41. Burchard L O. The Virtual Resource Manager:An Architecture for SLA-aware Resource Management[A],4th Intl. IEEE/ACM Intl. Symposium on Cluster Computing and the Grid [C](CCGrid) Chicago, USA,2004,123-131.
42. P. Andreetto, S. Borgia, et al. Pratical approaches to Grid workload and resource management in the EGEE project[A]. Computing in High Energy and Nuclear Physics (CHEP04)[C],2004,207-215.
43. G. Avellino, S. Beco et al.The DataGrid Workload Management System:Challenges and Results[J].Journal of Grid Computing.2004,2(4):353-367
44. A.M.Dobber,G.M.Koole,et al. Dynamic load balancing for a grid application[A]. Proceedings of HiPC 2004[C], Springer-Verslag, December 2004,342-352..
45. S.C.Perry,J.S.Harper,D.J.Kerbyson,and G.R.Nudd. Theory and Operation of the Warwick Multiprocessor Scheduling System. Research Report CS-RR-363,Dept.of Computer Science,University of Warwick,1999.
46. A.Enis,V.Vijay, et al. Grid resource broker using application benchmarking [A]. Proceedings of Advances in Grid Computing-EGC 2005:European Grid Conference[C],2005,691-701.
47. T.R.Alfredo,T.George,D.Marios,S.Peter. Grid resource selection by application benchmarking for computational haemodynamics applications [A]. Proceedings of 5th International Conference(ICCS 2005)[C],2005,534-543.
48. Feitelson D G, Rudolph L, Schwiegelshohn U. Parallel job scheduling—A status report[A]. Proc. of the Job Scheduling Strategies for Parallel Processing[C]. LNCS 3277, Berlin:Springer-Verlag,2004,1-16.
49. Abawajy J H, Dandamudi S P. Parallel job scheduling on multicluster computing systems[A]. Proc. of the IEEE Int'l Conf. on Cluster Computing (CLUSTER 2003). [C]Oakland:IEEE Computer Press,2003,11-18.
50. Sabin G, Kettimuthu R, Rajan A, Sadayappan P. Scheduling of parallel jobs in a heterogeneous multisite environment[A]. Proc. of the Job Scheduling Strategies for Parallel Processing[C]. Berlin:Springer-Verlag,2003,87-104.
51. Ernemann C, Hamscher V, Yahyapour R. Benefits of global grid computing for job scheduling [A]. Proc. of the 5th IEEE/ACM Int'l Workshop on Grid Computing in Conjunction with SuperComputing[C]. Oakland:IEEE Computer Press,2004,374-379.
52. Lin WW, Qi DL, Li YJ, Wang ZY, Zhang ZL. Independent tasks scheduling on tree-based grid computing platforms[J]. Journal of Software,2006,17(11):2352-2361
53. Macey BS, Zomaya AY. A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs [A]. International Parallel Processing Symposium (IPPS'98) [C], Orlando, Florida,1998,204-214.
54. Olivier Beaumont, Vincent Boudet, Yves Robert. The Iso-Level Scheduling Heuristic for Heterogeneous Processors [A]. PDP[C],2002,335-342.
55. Armstrong R,Hensgen D,Kidd T. The Relative Performance of Various Mapping Algorithm is Independent of Sizable Variance in Run-time Predictions [A]., Proceedings of the 7th Heterogeneous Computing Workshop[C] (HCW'98).USA:IEEE Computer Society Press,1998,79-87.
56. Jelodar M S, Fakhraie S N, Montazeri F, et al. A Representation for Genetic Alogorithm Based Multiprocessor Task Scheduling[A]. IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC,Canada, July,2006,16-21.
57. Zhihong Xu,Xiangdan Hou,Jizhou Sun.Ant algorithm-based task scheduling in grid computing[A],In:proceedings of 2003-Canadian Conf on Electrical and Computer Engineering[C].USA:IEEE Computer Society Press,2003,2:1107-1110.
58. Viswanathan S,Veeravalli B.Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems [A].Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing(GRID'04)[C],USA:IEEE Computer Society Press,2004,163-170.
59. Hongtu Chen,Maheswaran M.Distributed Dynamic Scheduling of Composite Tasks on Grid Computing System[A], Proceedings of the International Parallel and Distributed Processing Symposium(IPDPS'02)[C],2002.88-97.
60. Maheswaran M, Ali S, Siegel H, et al. Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems [J]. Journal of Parallel and Distributed Computing.1999,59(2),:107-131.
61. Kebbal D, Talbi E, Geib J. Building of Scheduling Parallel Adaptive Applications in Heterogeneous Environments [A], Proceedings of the 1st IEEE International Workshop on Cluster Computing [C], Melbournet, Australia, IEEE Computer Society, December 1999,95-201.
62. EI-Rewini H, Lewis T, Ali H. Task Scheduling in Parallel and Distributed Systems [M]. Prentice Hall, Englewood Cliffs, New Jersey,1994.
63. Armstrong R, Hensgen D, Kidd T. The Relative Performance of Various Mapping Algorithms is Independent of Sizable Variances in Run-time Predictions [A], Proceedings of the 7th IEEE Heterogeneous Computing Workshop [C], Orlando, Florida, IEEE Computer Society, March 1998,79-87.
64. Zomaya A, Kazman R. Simulated Annealing Techniques [M]. Algorithm and Theory of Computing Handbook, CRC Press,1999.
65. Singh H, Youssef A. Mapping and Scheduling Heterogeneous Tasks Graphs Using Genetic Algorithm [A], Proceedings of the 5th IEEE Heterogeneous Computing Workshop [C], Hnolulu, Hawaii, IEEE Computer Society, April 1996,86-97.
66. Chen H, Flann N, Watson D. Parallel Genetic Simulated Annealing:A Massively Parallel SIMD Algorithm [J]. IEEE Transaction on Parallel and Distributed System,1998, 9(2):126-136.
67. Freund R, Gherrity M, Ambrosius S. Scheduling Resource in Multi-user, Heterogeneous Computing Environment with SmartNet [A]. In:Proceedings of the 7th IEEE Heterogeneous Computing Workshop [C], Orlando, Florida, IEEE Computer Society, March 1998,184-199.
68. Douglas Thain, Todd Tannenbaum, and Miron Livny. Distributed Computing in Practice: The Condor Experience[J].Concurrency and Computation:Practice and Experience, February 2005,17(2):323-356.
69. Tannenbaum T, Foster I, Livny M, et al. Condor-G:A Computation Management Agent for Multi-Institutional Grids [J]. Cluster computing,2002,5(3):237-246.
70. Imamagic E., Radic B., Dobrenic D.An approach to grid scheduling by using condor-G matchmaking mechanism[A].28th International Conference on Information Technology Interfaces[C],2006.:625-632
71. Feng H., Misra V., and Rubenstein D. PBS:a unified priority-based scheduler[J]. SIGMETRICS Performance Evaluation Review.2007,35(1):203-214.
72. Xiaohui Wei, Wilfred W. Li, et al. Integrating Local Job Scheduler-LSFTM with GfarmTM[J].Parallel and Distributed Processing and Applications.2005,3758:196-204.
73. Casas J, Clark D, et al. MIST:PVM with Transparent Migration and Checkpointing[J]. 1995.
74. GRAM-Basic Job Submission and Control Service, http://www.globus.org/grid_software/computation/gram.php.
75. Krysztof K, JareK N, Julinusz P. User Preference Driver Multi objective Resource Management in Grid Environments [A]. The 1st International Symposium on Cluster Computing and the Grid Brisbane [C],2001,114-122.
76. I.Foster, C.Kesselman. Globus:A Metacomputing Infrastructure Toolkit[J]. Intl J. Supercomputer Applications,1997,11 (2):115-128.
77. I. Foster. Globus Toolkit Version 4:Software for Service-Oriented Systems[A]. International Conference on Network and Parallel Computing(IFIP2006)[C], Springer-Verlag LNCS 3779 2006,2-13.
78. Spring N, Wolski R. Application Level Scheduling of Gene Sequence Comparison on Metacomputers[A].12th ACM International Conference on Supercomputing [C], Melbourne,1998,141-148.
79. Neil Spring, Rich Wolski. Application level scheduling of gene sequence comparison on metacomputers[A]. Proceedings of the 12th international conference on Supercomputing[C], Melbourne, Australia,1998
80. Berman F, Wolski R. Adaptive Computing on the Grid Using AppLeS[J]. IEEE Transactions on Parallel and Distributed Systems,2003,14(4):369-382.
81. Buyya, R, Abramson D, and Giddy J. Nimrod/G:An Architecture of a Resource Management and Scheduling System in a Global Computational Grid[A], HPC[C], Beijing, China, May 2000,283-289.
82. Abramson D, Giddy J and Kotler L. High Performance Parametric Modeling with Nimrod/G:Killer Application for the Global Grid[A], International Parallel and Distributed Processing Symposium (IPDPS)[C], Cancun, Mexico, May 2000,520-528.
83. D. Abramson, I. Foster, J. Giddy, A. Lewis, R. Sosic, R. Sutherst, N. White,The Nimrod Computational Workbench:A Case Study in Desktop Metacomputing [A], Australian Computer Science Conference (ACSC 97)[C], Macquarie University, Sydney, Feb 1997.
84. Zhiwei Xu, Huaming Liao, Bingchen Li, Wei Li. Vega Grid and CSCW:Two Approaches to Collaborative Computing[A],The Eighth International Conference on CSCW in Design[C], Xiamen, P.R. China,May 2004,376-382.
85. Hao Wang, Wei Li, Donghua Liu, et al. Operating System Level Support for Resource Sharing across Multiple Domains [A], The 8th International Conference on High Performance Computing in Asia Pacific Region(HPC Asia'05)[C], Beijing, China,2005.
86. Yili Gong, Fangpeng Dong, Wei Li, Zhiwei Xu. VEGA Infrastructure for Resource Discovery in Grids[J], Journal of Computer Science & Technology,2003,18(4):413-422.
87. Alexander Keller and Heiko Ludwig. The WSLA Framework:Specifying and Monitoring Service Level Agreements for Web Services[J].Journal of Network and Systems Management.2003,11(1):57-81.
88. Hao Wang, Zhiwei Xu, Yili Gong, Wei Li. Agora:Grid Community in Vega Grid[A], Proceedings of the 2nd International Workshop on Grid and Cooperative Computing (GCC2003)[C], Shanghai China,Dec.2003,475-482.
89. Topcuoglu H, Harir S, Wu M Y. Performance-effective and low-complexity task scheduling for heterogeneous computing [J]. IEEE Trans on Parallel and Distributed Systems,2002,13:260-274
90.陈廷伟.基于资源主动适应的网格依赖任务调度研究[D],沈阳：东北大学,2006.
91. Le Y C,Albert Y. Zomaya. Practical scheduling of bag-of-tasks applications on grids with dynamic resilience[J]. IEEE Transactions Cncomputers,2007,56(6):815-825.
92. Sakellariou R,Zhao H N. A low-cost rescheduling policy for efficient mapping of workflows on grid systems [J]. Scientific Programming,2004,12(4):253-262.
93. Imamagic E, Radic B, Dobrenic D. An approach to grid scheduling by using condor-G matchmaking mechanism[A],The 28th International Conference on Information Technology Interfaces (ITI2006)[C]. New York, USA:IEEE Press,2006:625-632.
94. Yu Z F, Shi W S. An adaptive rescheduling strategy for grid workflow applications [A].The 21st International Proceedings of Parallel and Distributed Processing Symposium(IPDPS 2007)[C]. New York, USA:IEEE Press,2007:1-8.
95. Aggarwal M, Kent R D, Ngom A. Genetric Algorithm based scheduler for computational grids[A]. Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05) [C].2005,18-26.
96. Hou ESH, Ansari N, Ren H. A genetic algorithm for multiprocessor scheduling [J]. IEEE Trans. on Parallel and Distributed Systems,1994,5(2):113-120.
97. Hu T C. Parallel Sequencing and Assemble line problems [J]. Operations Research,1994,9(6):146-154.
98. Adam T L, Chandy K M, Dickson J. A comparison of list scheduling for parallel processing systems [J]. Communications of the ACM,1974,17(12):685-690.
99. Sih G C, Lee E A. A compile-time scheduling heuristic for interconnection constrained heterogeneous processor architectures [J]. IEEE Trans. on Parallel and Distributed Systems,1993,4(2):75-87.
100. Wu M, Gajski D. Hypertool:A programming aid for message passing systems [J]. IEEE Trans. on Parallel and Distributed Systems,1990, 1(3):330-343.
101. Shi Wei, Zheng Wei-min. The Balanced Dynamic Critical Path Scheduling Algorithm of Dependent Task Graphs [J].Chinese Journal of Computers,2001,24:991-997.
102. Chung Y C, Ranka S. Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors [A], Proc. of the Supercomputing'92. Minneapolis [C]:IEEE Computer Society Press,1992.512-521.
103. Ahmad I, Kwok YK. On exploiting task duplication in parallel programs scheduling [J]. IEEE Trans. on Parallel and Distributed Systems,1998,9(9):872-892.
104. Yang T, Gerasoulis A. DSC:Scheduling parallel tasks on an unbounded number of processors [J]. IEEE Trans. on Parallel and Distributed Systems,1994,5(9):951-967.
105. Kwok Y K, Ahmad I. Dynamic critical-path scheduling:An effective technique for allocating task graphs onto multiprocessors [J]. IEEE Trans. on Parallel and Distributed Systems,1996,7(5):506-521.
106. Maheswaran M, Ali S, Siegel H J, et al. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems [A], Proc. of the 8th Heterogeneous Computing Workshop (HCW'99) [C], Washington:IEEE Computer Society Press,1999,30-44.
107. Ilias K, Savvas M, Kechadi T. Dynamic Task Scheduling in Computing Cluster Environments [A]. Proc. Of the ISPDC/HeteroPar[C],2004,372-379.
108. Yu-kwong Kwok and Ishfaq Ahmad. Static scheduling algorithms for allocating directing task graghs to miltiprocessors[J], ACM Surveys,1999,31(4):87-105.
109. Yu J and Buyya R. A taxonomy of workflow management systems for grid computing[J]. Journal of Grid Computing,2005,3(3):171-200.
110. T. Oinn, M. Addis, et al. A tool for the composition and enactment of bioinformatics workflows [J], Bioinformatics, London UK:Oxford University Press,2004,20 (17):3045-3054.
111. F. Berman, A. Chien, K. Cooper, J. Dongarra, et al. The GrADS Project:Software Support for High-Level Grid Application Development[J]. International Journal of High Performance Computing Applications, London, UK:SAGE Publications Inc. 2001,15(4):327-344.
112. R. Buyya and S. Venugopal. The Gridbus Toolkit for Service Oriented Grid and Utility Computing:An Overview and Status Report[A].1st IEEE International Workshop on Grid Economics and Business Models(GECON 2004)[C], Seoul, Korea, IEEE Computer Society Press, Los Alamitos, CA, USA, April 23 2004,19-36.
113. J. Cao, S. A. Jarvis, S. Saini, G. R. Nudd. GridFlow:Workflow Management for Grid Computing[A]. The 3rd International Symposium on Cluster Computing and the Grid (CCGrid)[C], Tokyo, Japan, IEEE Computer Society Press, Los Alamitos, May 12-15, 2003.
114. I. Taylor, M. Shields, and I. Wang. Resource Management of Triana P2P Services[J]. Grid Resource Management, Kluwer, Netherlands, June 2003.
115. S. McGough, L. Young, A. Afzal, S. Newhouse, and J. Darlington. Workflow Enactment in ICENI[A]. In UK e-Science All Hands Meeting[C], Nottingham, UK, IOP Publishing Ltd, Bristol, UK, Sep.2004,894-900.
116. K. Amin and G. von Laszewski. GridAnt:A Grid Workflow System. Manual, http://wwwunix.globus.org/cog/projects/gridant/gridant-manual.pdf, February 2003.
117. UNICORE Plus Final Report:Uniform Interface to Computing Resource. UNICORE Forum, http://www.unicore.org/documents/UNICOREPlus-Final-Report.pdf, December 2004.
118. T. Fahringer, A. Jugravu, et al. ASKALON:a tool set for cluster and Grid computing[J]. Concurrency and Computation:Practice and Experience, Wiley InterScience, 2005,17:143-169.
119. M. Wieczorek, R. Prodan, and T. Fahringer. Scheduling of scientific workflows in the askalon grid environment[J]. SIGMOD Record,2005,34(3):56-62.
120. Hou ESH, Ansari N, Ren H. A genetic algorithm for multiprocessor scheduling [J]. IEEE Trans. on Parallel and Distributed Systems,1994,5(2):113-120.
121.肖人彬,王磊.人工免疫系统：原理,模型,分析及展望[J],计算机学报2002,25(12)：1281-1293.
122. H Meshref,H VanLandingham. Artificial immune systems:application to autonomous agents[A]. IEEE International Conference on Systems, Man, and Cybernetics [C], 2000,61-66.
123. Aggarwal M, Kent R D, Ngom A. Genetric Algorithm based scheduler for computational grids [A]. Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05) [C],2005,205-213.