基于地震资料处理的计算网格技术的研究
|
摘要
网格技术是一种力图把整个Internet整合成一台超级虚拟计算机计算平台的支撑技术。网格计算做为高性能计算的一个重要分支,为解决科学和工程领域一些大规模计算问题提供了理想的平台。基于地震资料处理的计算网格的研究将大大降低目前配置地震资料处理计算环境的门槛,为地震资料处理的推广和应用提供新的平台。在本论文中主要做了以下几方面的工作。
1.本文针对地震资料处理的特点采用最新的网格技术首次设计出了适应地震资料处理的计算网格平台体系结构。该体系结构由资源监控模块、作业调度管理、数据管理等六个模块组成。在传统网格结构的基础上针对地震资料处理的特点增加了port模块、数据管理模块和进程迁移功能
2.在网格资源监控模块的研究中本文对网格底层资源监控系统的理论和体系结构进行了剖析,并针对目前网格监控所存在的问题,提出了一种基于GMA规范的网格监控模型和动态调整监控间隔的方法,由于该模型采用带中间件的三层体系结构,有效地解决了消费者直接访问被监控对象所带来的安全问题,并对异构资源的互访提供支持,通过数据组织、分层结构及函数接口向用户提供了统一的资源对象接口,解决了异构系统的问题。同时为降低系统开销,提高系统的性能采取了动态调整监控间隔的方法和趋势预测机制。
3.计算网格资源的分布性、异构性、自治性及动态性特点,决定了网格资源调度的复杂性。本文研究了适合大规模任务处理的网格资源调度系统,目的是在应用程序和网格资源之间做出合理分配,使这些应用获得最佳性能。提出了一个基于树状层次拓扑结构的分级式调度模型,这种调度模型不仅具有高度可扩展性,而且能够较好地适应网格资源动态变化的特性。同时为有效地平衡系统负载,缩短任务的最小完成时间,提高调度效率提出了Dmm算法。
4.由于地震资料处理的海量数据特点,本文还进行了管理海量数据的数据网格的研究。针对网格环境中数据传输的速度和稳定性都无法得到保障的“瓶颈”问题。本文分析了网格数据管理及其Replica技术,研究了网格数据传输机制。提出了融Replica技术和数据传输为一体的基于多Replica的数据传输模型MRT,并加以定义,明确了MRT模型的组成、元素间的映射关系和工作流程等,并基于启发式方法,提出了启发式动态任务分配算法,最后对算法进行了复杂度分析
5.为解决网格计算中资源故障发生较频繁的情况保证网格的高可用性和高可靠性。本文还对网格计算中的进程迁移和检查点技术做了深入的研究,提出了基于检查点的进程迁移模型(Process Migration Model based on Checkpoint, PMMC)。PMMC模型有效地平衡了节点负载,提高了节点的利用率和吞吐量。最后分析了进程迁移算法,提出一种进程迁移算法的策略
6.最后本文在自己搭建的网格平台上重点分析了三维叠前深度偏移的各种算法,旨在将自动并行化技术应用于网格这种超强计算能力中,使得工程实践中已经积累的大量串行应用程序能够在网格环境中高效并行执行。通过阅读大量的三维叠前深度偏移串行程序,分析并归纳出其并行化特征,指出:Kirchhoff积分法叠前深度偏移中,旅行时的计算适合采用按炮点并行计算,成像输出适合基于炮检距的自动并行化;分步傅立叶法叠前深度偏移适合按单炮记录进行并行。在分析三维叠前深度偏移串行程序自动并行化特征的基础上,提出一个自动并行化模型,并介绍模型中各模块所采用的关键技术。针对模型中的数据及循环分布这一难题,论文将其分为无通信及有通信两种情况分别进行分析。无通信情况下,分别针对数组与循环、同名数组间、异名数组间三种情况,提出三个算法,解决对应情况下的数据及循环分布问题;有通信情况下,将该问题抽象成一个数学模型(APDG图的划分)。
Grid is a kind of support technology which try to turn the entire Internet into a super virtual computer and super computing platforms. As an important branch of high-performance computing, grid computing provides an ideal platform for some large-scale computing problems in science and engineering fields. The research of computing grid based on seismic data processing will greatly reduce the cost of conputing environment configuration which is used in the seismic data processing, and provide new platform for seismic data processing. In this paper, our studies are mainly as follows:
1. According to the characteristics of seismic data processing, this paper uses the latest grid technology to design the grid computing platform and data grid platform architecture suitable for seismic data processing for the first time. This architecture is composed of six modules including the resource monitoring module, job scheduling management, data management and so on. According to the characteristics of seismic data processing, it adds port module,data managing module and process migration fuction, on the basis of traditional grid structure.
2.In the study of grid resource monitoring module, the paper analyses the theory and architecture of grid resources monitoring system. And according to the problems of current grid monitoring, this paper also provides a grid monitoring module and a method for dynamic adjustment of monitoring interval based on GMA specification. This module can effectively solve the safe problems caused by the consumer visiting the monitored object directly, because of its adopting three layer architecture with middleware. It also supports the interoperability of heterogeneous resoures by providing uniform resource object interface for users through data organizing, hierarchy structure and function interface, and so solves the heterogeneous system problems. At the same time in order to reduce system cost and improve system performance, it also uses a dynamic monitoring interval method and trend forecasting mechanism.
3. Scheduling of grid resource is complicated because of distributed, heterogenous, autonomous and dynamic characters of computing grid resources. This paper studies the Grid Resource Scheduling System suited for large-scale tasks. The aim is that we could get the best application performance through making a reasonable allocation between applications and grid resource.A hierarchical scheduling model based on tree structure topology is put forward, which not only have a high scalability, but also can preferably adapt to the dynamic characteristic of grid resource. At the same time, in order to balance the load of system and shorten the smallest time for completing the tasks and improve scheduling efficiency, A Divided Min-Min algorithm is proposed.
4. Because of mass data in seismic data processing, we also make research on data grid. According to the "bottleneck" problems of the speed and stability of data transmission in grid environment, we analyze the grid data management and Replica technology, studie the transmission mechanism of grid data. The paper combines Replica technology with data transmission, and defines a data transmission module MRT based on multi-Replica which includes the composition of the MRT model, mapping relationship between elements and work flow, etc.The paper also puts forward a heuristic allocation algorithm for dynamic tasks based on heuristic method and ultimately analyzes the complexity of the algorithm.
5. In order to settle the resource trouble that happened frequently in grid computing and ensure high usability and reliability, this paper makes a further study on process migration and checkpoint technology of grid computing and raises Process Migration Model based on Checkpoint, PMMC. PMMC can balance the node load effectively, enhanc the utilization and . throughput. At last the paper analyzes the process migration algorithm, and proposes a strategy of it.
6.At last, the paper primarily analyzes various algorithms of 3D pre-stack depth migration on our grid platform. The purpose is to apply the automatic parallel technology to grid computing, and make many serial applications accumulated in engineering practice efficiently implemented in parallel on the platform . By analyzing a lot of 3D pre-stack depth migration serial programs, the characteristics of parallel are summarized, which points out that in Kirchhoff integral method for pre-stack depth migration, computation of travel time should use parallel method on shotpoint, imaging output is suitable for the automatic parallelization based on offset, and Fourier step-by-step method for pre-stack depth migration could parallel on shot records.
An automatic parallelization model based on the migration processing program is proposed on the analysis of automatic parallelization of serial procedures of 3D pre-stack depth migration. In order to resolve the problems of data and loops distribution, this paper partition it into parts according as whether the processors communicate with others after distribution. When it does not relate to communications, we put forward three algorithms, which respectively resolve the problems of alignment between arrays and loops, arrays with the same name, and arrays which with different names. As for the other situation, we implement the problems through extracting APDG (Automatic Parallel Distribution Graph) from the multilayer nesting loops, which is subject to the restriction that the edges connected between different subsets after distribution are least.
1.本文针对地震资料处理的特点采用最新的网格技术首次设计出了适应地震资料处理的计算网格平台体系结构。该体系结构由资源监控模块、作业调度管理、数据管理等六个模块组成。在传统网格结构的基础上针对地震资料处理的特点增加了port模块、数据管理模块和进程迁移功能
2.在网格资源监控模块的研究中本文对网格底层资源监控系统的理论和体系结构进行了剖析,并针对目前网格监控所存在的问题,提出了一种基于GMA规范的网格监控模型和动态调整监控间隔的方法,由于该模型采用带中间件的三层体系结构,有效地解决了消费者直接访问被监控对象所带来的安全问题,并对异构资源的互访提供支持,通过数据组织、分层结构及函数接口向用户提供了统一的资源对象接口,解决了异构系统的问题。同时为降低系统开销,提高系统的性能采取了动态调整监控间隔的方法和趋势预测机制。
3.计算网格资源的分布性、异构性、自治性及动态性特点,决定了网格资源调度的复杂性。本文研究了适合大规模任务处理的网格资源调度系统,目的是在应用程序和网格资源之间做出合理分配,使这些应用获得最佳性能。提出了一个基于树状层次拓扑结构的分级式调度模型,这种调度模型不仅具有高度可扩展性,而且能够较好地适应网格资源动态变化的特性。同时为有效地平衡系统负载,缩短任务的最小完成时间,提高调度效率提出了Dmm算法。
4.由于地震资料处理的海量数据特点,本文还进行了管理海量数据的数据网格的研究。针对网格环境中数据传输的速度和稳定性都无法得到保障的“瓶颈”问题。本文分析了网格数据管理及其Replica技术,研究了网格数据传输机制。提出了融Replica技术和数据传输为一体的基于多Replica的数据传输模型MRT,并加以定义,明确了MRT模型的组成、元素间的映射关系和工作流程等,并基于启发式方法,提出了启发式动态任务分配算法,最后对算法进行了复杂度分析
5.为解决网格计算中资源故障发生较频繁的情况保证网格的高可用性和高可靠性。本文还对网格计算中的进程迁移和检查点技术做了深入的研究,提出了基于检查点的进程迁移模型(Process Migration Model based on Checkpoint, PMMC)。PMMC模型有效地平衡了节点负载,提高了节点的利用率和吞吐量。最后分析了进程迁移算法,提出一种进程迁移算法的策略
6.最后本文在自己搭建的网格平台上重点分析了三维叠前深度偏移的各种算法,旨在将自动并行化技术应用于网格这种超强计算能力中,使得工程实践中已经积累的大量串行应用程序能够在网格环境中高效并行执行。通过阅读大量的三维叠前深度偏移串行程序,分析并归纳出其并行化特征,指出:Kirchhoff积分法叠前深度偏移中,旅行时的计算适合采用按炮点并行计算,成像输出适合基于炮检距的自动并行化;分步傅立叶法叠前深度偏移适合按单炮记录进行并行。在分析三维叠前深度偏移串行程序自动并行化特征的基础上,提出一个自动并行化模型,并介绍模型中各模块所采用的关键技术。针对模型中的数据及循环分布这一难题,论文将其分为无通信及有通信两种情况分别进行分析。无通信情况下,分别针对数组与循环、同名数组间、异名数组间三种情况,提出三个算法,解决对应情况下的数据及循环分布问题;有通信情况下,将该问题抽象成一个数学模型(APDG图的划分)。
Grid is a kind of support technology which try to turn the entire Internet into a super virtual computer and super computing platforms. As an important branch of high-performance computing, grid computing provides an ideal platform for some large-scale computing problems in science and engineering fields. The research of computing grid based on seismic data processing will greatly reduce the cost of conputing environment configuration which is used in the seismic data processing, and provide new platform for seismic data processing. In this paper, our studies are mainly as follows:
1. According to the characteristics of seismic data processing, this paper uses the latest grid technology to design the grid computing platform and data grid platform architecture suitable for seismic data processing for the first time. This architecture is composed of six modules including the resource monitoring module, job scheduling management, data management and so on. According to the characteristics of seismic data processing, it adds port module,data managing module and process migration fuction, on the basis of traditional grid structure.
2.In the study of grid resource monitoring module, the paper analyses the theory and architecture of grid resources monitoring system. And according to the problems of current grid monitoring, this paper also provides a grid monitoring module and a method for dynamic adjustment of monitoring interval based on GMA specification. This module can effectively solve the safe problems caused by the consumer visiting the monitored object directly, because of its adopting three layer architecture with middleware. It also supports the interoperability of heterogeneous resoures by providing uniform resource object interface for users through data organizing, hierarchy structure and function interface, and so solves the heterogeneous system problems. At the same time in order to reduce system cost and improve system performance, it also uses a dynamic monitoring interval method and trend forecasting mechanism.
3. Scheduling of grid resource is complicated because of distributed, heterogenous, autonomous and dynamic characters of computing grid resources. This paper studies the Grid Resource Scheduling System suited for large-scale tasks. The aim is that we could get the best application performance through making a reasonable allocation between applications and grid resource.A hierarchical scheduling model based on tree structure topology is put forward, which not only have a high scalability, but also can preferably adapt to the dynamic characteristic of grid resource. At the same time, in order to balance the load of system and shorten the smallest time for completing the tasks and improve scheduling efficiency, A Divided Min-Min algorithm is proposed.
4. Because of mass data in seismic data processing, we also make research on data grid. According to the "bottleneck" problems of the speed and stability of data transmission in grid environment, we analyze the grid data management and Replica technology, studie the transmission mechanism of grid data. The paper combines Replica technology with data transmission, and defines a data transmission module MRT based on multi-Replica which includes the composition of the MRT model, mapping relationship between elements and work flow, etc.The paper also puts forward a heuristic allocation algorithm for dynamic tasks based on heuristic method and ultimately analyzes the complexity of the algorithm.
5. In order to settle the resource trouble that happened frequently in grid computing and ensure high usability and reliability, this paper makes a further study on process migration and checkpoint technology of grid computing and raises Process Migration Model based on Checkpoint, PMMC. PMMC can balance the node load effectively, enhanc the utilization and . throughput. At last the paper analyzes the process migration algorithm, and proposes a strategy of it.
6.At last, the paper primarily analyzes various algorithms of 3D pre-stack depth migration on our grid platform. The purpose is to apply the automatic parallel technology to grid computing, and make many serial applications accumulated in engineering practice efficiently implemented in parallel on the platform . By analyzing a lot of 3D pre-stack depth migration serial programs, the characteristics of parallel are summarized, which points out that in Kirchhoff integral method for pre-stack depth migration, computation of travel time should use parallel method on shotpoint, imaging output is suitable for the automatic parallelization based on offset, and Fourier step-by-step method for pre-stack depth migration could parallel on shot records.
An automatic parallelization model based on the migration processing program is proposed on the analysis of automatic parallelization of serial procedures of 3D pre-stack depth migration. In order to resolve the problems of data and loops distribution, this paper partition it into parts according as whether the processors communicate with others after distribution. When it does not relate to communications, we put forward three algorithms, which respectively resolve the problems of alignment between arrays and loops, arrays with the same name, and arrays which with different names. As for the other situation, we implement the problems through extracting APDG (Automatic Parallel Distribution Graph) from the multilayer nesting loops, which is subject to the restriction that the edges connected between different subsets after distribution are least.
引文
[1]都志辉,陈渝,刘鹏.网格计算.北京:清华大学出版社,2002
[2]薛宏全,廖建明,周小兵.基于移动代理的网格资源发现与监控模型研究.计算机应用,2004,24(6) :54-57
[3] Foster, Kesselman编著.金海,袁平鹏,石柯译.网格计算(第2版).北京:电子工业出版社,2004
[4]查礼,徐志伟,林国璋等.基于LDAP的网格监控系统.计算机研究与发展,2002,39(8):930-936
[5]潘景山,王英龙,张睿超等.基于LDAP和代理的网格环境下网络性能监控系统.大连理工大学学报,2004(10):103-106
[6]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社,2004
[7]语义Web和语义网格概述, http://bbs.w3china.org/dispbbs.asp?boardID=57&ID=14070
[8] A.Brown and D.A.Patterson. Embracing failure: A case for Recovery-Oriented Computing(ROC).In High Performance Transaction Processing Symposium, Asilomar, CA, 2001
[9] G. Fedak, C. Germain, V. Neri, F. Cappello. Xtrem Web: A Generic Global Computing System. In proceedings of the 1st IEEE/ACM Int’l Conf. On Cluster Computing and the Grid, Brisbane, Australia,IEEE Computer Society, 2001
[10] SF Express Project. http://www.cacr.caltech.edu/SFExpress/
[11] Sharon Brunett , Steven Fitzgerald. Metacomputing Supports Large-Scale Distributed Simulations, 1998, http://www.cacr.caltech.edu/SFExpress /pubs/sc98/sc98.html.
[12]李庆华,郭志鑫.一种面向工作站网络的系统负载预测方法.华中科技大学学报(自然科学版).2002,30(6) :49-51
[13] Dinda,David.R.O'Hallaron. Realistic CPU Workloads Through Host Load Trace Playback.LCR, 2000:246-259.or http://www.cs.cmu.edu/~pdinda/LoadTraces
[14]王丽,李敬有,王岩.面向工作站群机系统的网络负载预测.齐齐哈尔大学学报,2000,16(3) :63-65
[15] Monitoring event,“Discovery and Monitoring Event Description (DAMED-WG)”, http://www-didc.lbl.gov/damed
[16] PID Tutorial, http://www.engin.umich.edu/group/ctm/PID/PID.html
[17] P. A. Dinda and D. R. O'Hallaron. An Evaluation of Linear Models for Host Load Prediction. Proceedings of the 8th IEEE International Symposium on High-Performance Distributed Computing (HPDC-8), Redondo Beach, CA, 1999
[18] P. A. Dinda and D. R. O'Hallaron. The Statistical Properties of Host Load. Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR 98), Pittsburgh, PA, 1998
[19] Dail, H.J. A Modular Framework for Adaptive Scheduling in Grid Application Development Environments. Computer Science, 2001
[20] R. Wolski. Dynamically Forecasting Network Performance Using the Network Weather Service. Journal of Cluster Computing, 1998
[21] R. Wolski, N. Spring, J. Hayes. Predicting the CPU availability of Time-shared Unix Systems. Proceedings of 8th IEEE High Performance Distributed Computing Conference (HPDC-8), 1999
[22] R. Wolski. N. Spring, J. Hayes. The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Journal of Future Generation Computing Systems, 1998
[23] R. Wolski, N. Spring, C. Peterson. Implementing a Performance Forecasting System for Metacomputing: The Network Weather Service. Proceedings of SC97,1998
[24] M. Harchol-Balter and A. Downey. Exploiting Process Lifetime Distributions for Dynamic Load Balancing. Proceedings of ACM Sigmetrics' 96 Conference on Measurement and Modeling of Computer Systems, 1996
[25] David de Roure, Mark A. Baker, Nicholas R. Jennings et al. The evolution of the Grid. Grid Computing - Making the Global Infrastructure a Reality, 2003
[26] I.Foster, C.Kesselman. The Grid:Blueprint for a Future Computing Infrastructure.Morgan Kaufmann: San Francisco,CA,1999
[27] Gordon Good. RFC2849: LDAP Data Interchange Format(LDIF).2000
[28] Wengyik Yeong,Tim Howes,Steve Kille. RFC2251:Lightweight Directory Access Protocol(v3).1997
[29] Ian Foster, Carl Kesselman. The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Applications,2001,15(3):200-222
[30] Ian Foster, CarlKesselman, Jefrey M.Nick,et al. The Physiology of the Grid:An Open Grid Services Architecture for Distributed Systems Integration. http://www.globus.org/research/papers/ogsa.pdf
[31]都志辉,陈渝,刘鹏等.以服务为中心的网格体系结构OGSA.清华大学高性能所网格研究组技术报告,2002 http://hpclab.cs.tsinghua.edu.cn/~duzh/project/ogsa/ogsaintro.pdf
[32]张军华.基于HPF的地震资料并行处理方法研究:[工学博士学位论文],石油大学(华东),山东:2002
[33]张颖峰,李毓麟.基于进化算法的网格计算资源管理调度系统.计算机工程,2003;29(15):110-111
[34]郑然,李胜利,金海.网格资源管理与调度模型的研究.华中科技大学学报(自然科学版), 2001;29(12):87-89
[35]林剑柠,吴慧中.基于遗传算法的网格资源调度算法.计算机研究与发展,2004;41(12):2196-2199
[36]金海,陈刚,赵美平.容错计算网格作业调度模型的研究.计算机研究与发展,2004;41(08):1382-1388
[37] Krauter K, Buyya R, Maheswaran M. A TaXonomy and Survey of Grid Resource Management Systems. Software Practice and Experience, 2002; 32(2):80-85
[38] Xinjun Chu, Yu qing Fan.The research of PDM based on Web. Journal of Beijing Aeronautics and Astronaunts University, 1999(4): 205-207
[39] Ian Foster, Carl Kesselman. Grid:Blueprint for a New Computing Infrastructure.Morgan: Morgan-Kaufman, 1998
[40] Ian Foster, C Kesselman, S Teucke. The Anatomy of the Grid: Enabling Scalable Virtual Organization. International J. Supercomputer Applications, 2001;15 (3):80-84
[41] Ian Foster. What is the Grid? A Three-Point Checklist. Grid Today-Daily News and Information for the Global Grid Community, 2002;1(6):10-12
[42] Ian Foster. The Grid: A New Infrastructure for 21st Century Science. Physics Today, 2002;55 (2):42-47
[43] Karl C zajkowski, Ian Foster, Nicholas Karonis. Dynamic Grid Resource Management Architecture for Metacomputing Systems. Proc of IPPS/SPDP'98 Workshop on Job Scheduling Strategies for Parallel Processing. Orlando, Florida, USA , 1998
[44]查礼,徐志伟,林国璋等.数据和计算密集混合元任务的网格调度算法.计算机工程与设计,2003;10
[45]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社,2004
[46]李胜利.基于Web的网格资源管理与调度:[工学硕士学位论文].华中科技大学.武汉:2002
[47] Foster, C Kesselman. The Grid: Blueprint for a New Computing Infrastructure. San Francisco, CA: Morgan Kaufmann Publisher. 1999
[48]朱福喜,何炎祥.并行分布计算中的调度算法理论与设计.武汉:武汉大学出版社,2003 [49[]萨师煊,王珊.数据库系统概论.第三版.北京:高等教育出版社,2000:253-255
[50] MAHESWARAN M,ALIS,SIEGEL HJ,et al. Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. Proceeding of the 8th IEEE Heterogeneous Computing Workshop (HCW’99). IEEE Computer Society Press,1999:30-44.
[51] K. Czajkowski, I.an Foster, et al. Grid resource management: state of the art and future trends. Norwell, MA, USA: Kluwer Academic Publishers, 2004: 119-134
[52] Ling yun Yang, Jennifer M.Schopf, Ian Foster. Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments. SC'03, Phoenix, USA.2003:31
[53] G Allen,T. Dlitsch,et al. Supporting Efficient Executionin Heterogeneous Distributed Computing Environments with Cactus and Globus. Conference on High Performance Networking and Computing. Denver, Colorado.2001.New York, USA:ACM Press, 2001:52
[54] hloriyuki Fujimoto, Kenichi Hagihara. A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks. SAINT Workshops 2004: 674-680.
[55] Berman F, Computing Wolski R, Casanova H, Cirne W, Dai H, Faerman M et al. Adaptive Computing on the Grid Using AppLeS. IEEE Transactions on Parallel and Distributed Systems, 2003;14(4): 369-382
[56] He Xiaoshan, Xian-He Sun, Gregor von Laszewski. QoS Guided Min-Min Heuristic for Grid Task Scheduling. Journal of Computer Science and Technology. 2003;18(4):442-445
[57] T. Braun, H. Sigel, N. Beck, L. Boloni, M. Masheswaran, A. Reuther, J.Robertson, M. Theys, B.Yao, D.Hensgen. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In 8th IEEE heterogeneous computing Workshop (HCW‘99),1999;(4): 15-29
[58]武广号、文毅、乐美峰.遗传算法及其应用应用力学学报.1996;13(2)
[59[]钟守楠.遗传算法的收敛性与编码武汉水利电力大学学报.2000;33(1)
[60]张颖,刘艳秋.软计算方法.北京:科学出版社2002
[61] Manzur Murshed and Rajkumar Buyya, Using the GridSim Toolkit for Enabling Grid Computing Education, International Conference on Communication Networks and Distributed Systems Modeling and Simulation (CNDS 2002), January 27-31, 2002, San Antonio, Texas, USA.
[62] Rajkumar Buyya and Manzur Murshed, GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Crid Computing, The Journal of Concurrency and Computation: Practice and Experience (CCPE), Volume 14, Issue 13-15, Wiley Press, Nov.-Dec,2002.
[63] Rajkumar Buyya, Manzur Murshed, and David Abramson, A Deadline and Budget Constrained Cost-Time Optimization Algorithm for Scheduling Task Farming Applications on Global Grids, Technical Report, CSSE-2002/109, Monash University, Melbourne, Australia.
[64] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya.Visual Modeler for Grid Modelling and Simulation (GridSim) Toollcit, Proceedings of the 3rd International Conference on Computational Science (ICCS 2003), Springer Verlag Publications (LNCS Series), June, 2003, Melbourne,Australia
[65] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya, A Taxonomy of Computer-based Simulations and its Mapping to Parallel and Distributed Systems Simulation Tools, International Journal of Software: Practice and Experience, Volume 34, Issue 7, Pages: 653-673, Wiley Press, USA, June 2004.
[66] Anthony Sulistio, Rajkumar Buyya, A Grid Simulation Infrastructure Supporting Advance Reservation, Proceedings of the 16th International Conference on Parallel and Distributed Computing and Systems(PDCS 2004), November 9-11, 2004, MIT, Cambridge, USA, pp. 1-7.
[67]陈渝.网格平台Globus的核心技术.清华大学计算机系高性能所网格研究组.北京:2002
[68] J. Novomy, S. Tuecke. An Online Credential Repository for the Grid: MyProxy. Proceedings of the Tenth International Symposium on High Performance Distributed Computing (HPDC-10). San Francisco, Califonia. 2001. USA:IEEE Press, 2001.104-111
[69] E. Johnston, S. Talwar, R. Jackson, et al. Overview of Security Considerations for Computational and Data Grids. Proceedings of the Tenth IEEE International Symposium on High-Performance Distributed Computing(HPDC-10).SanFrancisco, California. 2001.USA: IEEE Press, August, 2001. 439-440
[70]陈锡明,卢显良.NOW环境中一种负载平衡系统ALBSIN的研究与实现.小型微型计算机系统.2001;22(9)
[71] A Downey. Predicting Queue Times on Space-Sharing Parallel Computers. International Parallel Processing Symposium,1997
[72] R Gibbons. A Historical Application Profiler for Use by Parallel Schedulers. Lecture Notes on Computer Science, 1997:58-75
[73] W Smith, Ian Foster, V Taylor. Predicting Application Run Times Using Historical Information. Lecture Notes in Computer Science,1998
[74] B PMiller, A Tamches. Fine-grained dynamic instrumentation of commodity operating system kernels. Third Symposium on Operating SystemsDesignandImplementation(OSDI'99),NewOrleans,1999(2):117-130
[75] P Dinda, D Hallaron. An Extensible Toolkit for Resource Prediction In Distributed Systems. Technical Report CMU-CS-99-138,School of Computer Science,Carnegie Mellon University,1999
[76] H Sun, M Wu. Grid Harvest Service: A System for Long-term, Application-level Task Scheduling. Proc of 2003 IEEE International Parallel and Distributed Processing Symposium, Nice,France,2000
[77] I Foster, C Kesselman, S Teucke. The Anatomy of the Grid: Enabling Scalable Virtual Organization. International. Supercomputer Applications, 2001;15 (3):80-84
[78] Globus Homepage http://www.globus.org/ 2007
[79] B. Allcock, J. Bester, J. Bresnahan et al. Data management and transfer in high performance computational grid environments. Parallel Computing Journal, Vol.28, May 2002:5-12
[80] The Globus Team. GridFTP: Universal Data Transfer for the Grid. http://www.globus.org, White Paper.
[81] Vazhkudais. Replica Selection in the Globus Data Grid. Proceedings of the First IEEE/ACMC CGRID, 2001
[82] EU Datagrid Project Http://eudatagrid.web.cern.ch/eu-datagrid/ 2005
[83] L Guy, P Kunszt, E Laure et.al. Replica Management in Data Grids, Technical report,DataGrid-02-TED-020724, July 2002
[84] SRB http://www.ibm.com/developerworks/cn/grid/gr-srb/#N10052 2007
[85]庞丽萍,周润松,吴松等.基于LDAP的广域网存储虚拟化目录管理华中科技大学学报(自然科学版),2004; 32 (05): 64~66
[86]金海,官象山,吴松等.分布式存储系统中文件传输优化的设计与实现,华中科技大学学报(自然科学版), 2005; 33 (01): 4~9
[87]刘鹏展,刘亮,杨寿保. GridFTP传输性能分析,计算机工程与应用2005; 15:138-140
[88]肖侬,付伟,黄斌等. Griddaen数据网格系统的设计与关键技术实现. http://www.chinagrid.net, 2005
[89] China Grid Home Page. http://www.chinagrid.edu.cn. 2007
[90]都志辉,陈渝,刘鹏.网格计算.北京:清华大学出版社, 2002
[91]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社, 2004
[92] H Siegelmann, O Frieder. Document allocation in multiprocessor information retrieval systems advanced database systems, LNCS759 Springer, 1993:289-310
[93] Kurt Geihs1. Middleware challenges ahead. Computer IEEE, 2001,34(6): 24-31.
[94] I Foster. The Grid: A new infrastructure for 21st century science. Physics Today, 2002:55 (2):42-47
[95] Data Farm Home Page. http://datafarm.apgrid.org/. 2007
[96] I Foster, J Frey et al. Modeling stateful resources with web services, Version1.1http://www-106.ibm.com/develperworks/library/ws-resource/ws-modelingresource.pdf
[97] Borja Sotomayor. The Globus Toolkit 4 programmer’s tutorial. http://www.globus.org/toolkit/. 2007
[98] J Bester, I Foster, C Kesselman, et al. GASS:A data movement and access service for wide area computing systems. Sixth Workshop on I/O in Parallel and Distributed Systems. 1999.
[99] W Hoschek, J Jaen-Martinez, A Samar, et al. Data management in an international grid project. 2000 International Workshop on Grid Computing, December 2000.
[100] OGSA-DAI http://www.globus.org/toolkit/docs/4.0/techpreview/ogsadai/ 2007
[101] B Allcock, J Bester, J Bresnahanet et al. GridFTP Protocol Specification, GGF GridFTP Working Group Document, September 2002.
[102] GT 4.0 RLS http://www.globus.org/toolkit/docs/4.0/data/rls/. 2007
[103]孙海燕.数据网格副本管理关键技术的研究:[工学博士学位论文],国防科技大学,湖南: 2005
[104] A Rowstron, P Druschel. Scalable, distributed object location and routing for large–scale peer-to-peer systems. Proc of the 18th IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, 2001:329-350.
[105] Hierarchical Distributed Replica Catalogues. EU DataGrid Project: Work Package 2, http://cern.ch/grid-data-management/.
[106] Y Hu. IBL for replica selection in data intensive Grid applications. Mater’s Thesis, Department of Computer Science, University of Chicago, 2003
[107] Sudharshan Vazhkudal, M Jennifer, Schopf. Using disk throughput data in predictions of end-to-end grid data transfer. Proceedings of Grid 2002, 2002: 291-304
[108] Faerman, Wolski, Berman. Adaptive performance prediction for distributed data-Intensive appliation. Proceedings of the 1999 ACM/IEEE conferenece on Supercomputering(CDROM),1999.
[109] Baru, R.Moore, et al. The SDSC storage resource broker. Proceedings of IBM Centers for Advanced Studies Conferenece 1998
[110]黄斌,彭小宁,肖侬等.数据网格环境中数据传输服务的研究与实现,计算机应用研究, 2004; 21 (10): 212~214
[111] Gnutella Home Page. http://gnutella.wego.com 2007
[112] The freenet project. http://freenetproject.org 2007
[113] Napster Home Page. http://www.napster.com 2007
[114] A Herzberg, Y Mass, J Mihael. Access control meets public key infrastructure. Proceedings of the 2000 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 2000
[115] GridFTP_C_interface. http://www.globus.org/api/ 2007
[116] GridFTP_Client. http://www.globus.org/api/ 2007
[117] GT Java CoG Kit. http://www.globus.org/toolkit/docs/ 2007
[118]应宏,黄河.网格体系结构、关键技术及其应用,计算机应用研究2004:9:7-11
[119] Globus-url-copy. http://www-unix.globus.org/toolkit/docs/ 2006
[120]曾国荪,陈闳中.计算网格的抽象定义.同济大学学报(自然科学版), 2003; 31(9):1092-1097
[121]时维国,宋存利,黄明.基于启发式算法的并行多机调度问题研究,大连铁道学院学报, 2003; 24(4):55-57
[122]寿纪麟.数学建模--方法与范例,西安:西安交通大学出版社, 1984
[123]梁鸿,田世峰.基于改进蚂蚁算法的网格任务调度策略研究,电子技术应用, 2006; 32(11):42-44
[124]刘舒强.概率论与数理统计,天津:天津大学出版社, 2003
[125] GT4 Admin Guide http://www.globus.org/toolkit/docs/4.0/admin/ 2007
[126]李凯原,杨孝宗.减少检查点开销的一种方法.计算机工程与应用,2000;36(2):4-5
[127]李毅,周明天.Minix进程检查点机制的实现.计算机应用,2003,23(1):12-17
[128] E.Pinheiro“EPCKPT,”http://www.research.retgers.edu/
[129] H.Zhong, J.Nieh,“CRAK: Linux Checkpoint/Restart as a Kernel Module,”Department of Computer Science, Columbia University, New York, Technical Report, November 2001
[130] K.A.Iskra, F.vander Linden, Z.W.Hendrikse, et al.“The implementation of Dynamite: An environment for migrating PVM Tasks,“Operating Systems Review, July 2000; 34(3):40-55
[131] J.S.Plank, M.Beck, G.Kingsley, et al.“Transparent Checkpointing under Unix,”Proceedings of the Unix Winter 1995 Technical Conference, New Orleans, Louisiana, 1995
[132] M.Litzkow, T.Tananenbaum, J.Basney, M.Livny,“Checkpoint and Migration of UNIX Processed in the Condor Distributed Processing System,”University of Wisconsin-Madison, Computer Sciences Technical Report, April 1997
[133] J.Pruyne, M.Livny.“Managing Checkpoints for Parallel Programs,”Proceedings of the IPPS Second Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Hawaii, April 1996:15-19
[134] Rajkumar Buyya. High Performance Cluster Computing, Architectures and Systems. Prentice Hall, 1999; Vol 1:151-156
[135] M.Litkow, P.Giese, W.Zint. Experiences with Load Distribution on Top of the Mach Microkernel. Proceedings of the UNIX Symposium on Experiences with Distributed and Multiprocessor Systems, 1993
[136] R.RASHID, G.ROBERTSON. Accent: a Communication Oriented Network Operation System Kernel. Proceeding of the 10th ACM Symposium on OS Principles, 1985:2-12
[137] X.Zhang, Y.Qu, L.Xiao.“Improving distributed workload performance by sharingboth CPU and memory resources”Proc. of 20th Inter. Conf. On Distributed Computing Systems. Taipei, 2000:261-264
[138] L.Xiao, X.Zhang, Y.Qu.“Effective load sharing on heterogeneous networks of workstation”. Proc. of the 2000 Inter. Parallel and Distributed Processing Symposium. Mexico, 2002: 431-438
[139] A.Barak, G.Shai, R.G.Wheeler. The MOSIX Distributed Operation System: Load Balancing for Unix. Springer Verlag, Berlin, 1993
[140] Douglis, J.Ousterhout. Transparent process migration: design alternatives and the sprite implementation Software: Practice and Experience 1991: 21(8):757-785
[141] M.Harchol-Balter, B. Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems, 1997; 15(3):253-285
[142] M.Mitzenmacher. How useful is old information. Proc. of the 16th ACM Symposium on Principles of Distributed Computing, 1997:83-91
[143] Damien De Paoli, Andrzej, Goscinski. An Overview of Process Management in the RHODOS System. School of Computing and Mathmatics, Deakin University, 1994
[144] Ian Foster, Carl Kesselman. The Globus Project:A Status Report,Proceedings of the Seventh Heterogeneous Computing Workshop, J.K. Antonio, Editor, IEEE, Computer Soc press, Los Alamitos, 1998:4-18
[145] Ian Foster, Carl Kesselman. The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, San Francisco, CA, USA, 1999
[146] Ian Foster. Carl Kesselman,Tuecke Steven. The Anatomy of the Grid: Enabling Scalable Virtual Organizations, International Journal of High Performance Computing Applications, 2001; 15(3): 200-222
[147] Ian Foster, Carl Kesselman, Jeffrey Nick, et al. Grid Services for Distributed System Integration, Computer, 2002; 35(6): 37-46
[148] Miguel, L.Bote-Lorenzo, Yannis, et al. Grid characteristics and uses: A grid definition, Grid Computing, Springer-Verlag, Berlin, 2004:291-298
[149] Mark Baker, Rajkumar Buyya, Domenico Laforenza. Grids and Grid Technologies for Wide-area Distributed Computing, Software-Practice & Experience, 2002; 32(15): 1437-1466
[150] Jennifer M. Schopf, Bill Nitzberg. Grids: the Top Ten Questions, Scientific你Programming, 2002; 10(2): 103-111
[151] Ian Foster, C.Kesselman, J.Nick, et al. The Physiology of the Grid: An Open GridServices Architecture for Distributed Systems Integration, January, 2002
[152] Dorian C. Amold, Henri Casanova, Jack Dongarra. Innovations of the NetSolve Grid Computing System, Concurrency and Computation Practice $ Experience, 2002; 14(13): 1457-1479
[153] Hidemoto Nakada, Yoshio Tanaka, Satoshi Matsuoka, et al. The Design and Implementation of a Fault-tolerant RPC System: Ninf-C, Procedings of Seventh International Conference on High Performance Computing, Grid in Asia Pacific Region, IEEE Computer Soc, Los Alamitos, 2004: 9-18
[154] Dietmar, W.Erwin. Unicore: A Grid Computing Environment, Concurrency and Computation-Practice & Experience, 2002; 14(13): 1395-1410
[155] Rajkumar Buyya, Srikumar Venugopal. The Gridbus Toolkit for Service Oriented Grid and Utility Computing: An Overview and Status Report, Gecon 2004, J.Hwang, H. Park, Editors, IEEE, New York, 2004:19-66
[156] Fran Berman, Rich Wolski, Silvia Figueira, et al. Application-Level Scheduling on Distributed Heterogeneous Networks, Proceedings of Supercomputing 96, Pittsburgh, PA, 1996
[157] James Frey, Todd Tannenbaurn, Miron Livay, Ian Foster, Steven Tuecke, Condor-G: 5(3): 237-246
[158] Rajkumar Buyya, David Abramson, Jonathan Giddy, Nimrod/G: An Architecture for a Resource Management and Scheduling System in a Global Computational Grid, Proceedings of Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, 2000;Vol 1: 283-289
[159] Goodale Tom, Allen Gabrielle, Lanfermann Gerd, et al. The Cactus Framework and Toolkit: Design and Applications, High Performance Computing for Computational Science VECPAR 2002. 5th International Conference, Selected Papers and Invited Talks (Lecture Notes in Computer Science 2003; Vol.2: 197-227
[160] Francine Berman, Andrew Chien, Keith Cooper, Jack Dongarrs, et al. The GrADS Project: Software support for High-level Grid Application Development, International Journal of High Performance Computing Applications, 2000; 15(4): 327-344
[161] Mary Thomas, Steve Mock, Maytal Dahan, et al. The GridPort Toolkit: A System for Building Grid Portals. Proceedings of 10th IEEE International Symposium on High Performance Distributed Computing, 2001:216-227
[162] PETER Kunszt. European DataGrid Project: Status and Plans, Nuclear Instruments & Methods in Physics Research Section a Accelerators Spectrometers Detectors andAssociated Equipment, 2003:376-381
[163] Ewa Deelman, Carl Kesselman, Gaurang Mehta, et al. GridPhyN and LIGO, Building a Virtual Data Grid for Gravitational Wave Scientists, Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, IEEE Computer Soc. Los Alamitos, 2002: 225-234
[164] Billie Spencer, Jr. Thomas, Finholt, Ian Foster, et al. NEESGRID: A Distributed Collaboratory for Advanced Earthquake Engineering Experiment and Simulation, Proceedings of the 13th World Conference on Earthquake Engineering, Vancouver, B.C, Canada, 2004
[165] Simon Cox, Grid Enabled Optimisation and Design Search for Engineering (Geodise), Semantic Grid Workshop, Tokyo, 2003
[166] William Leinberger, Vipin Kumar, Information Power Grid: The New Frontier in Parallel Computing IEEE Concurrency, 1999; 7(4): 75-84
[167] Globus: http://www.globus.org
[168] PlanetLab: http://www.planet-lab.org/
[169] e_Science: http://grid.ifca.unican.es/
[170] Li Zha, Wei Li, Haiyan Yu, et al. System Software for China National Grid,Network and Parallel Computing, Berlin, 2005: 14-21
[171] Hai Jin, ChinaGrid Project, 2005 International Conference on Parallel Processing Workshops, 2005: 81-81
[172]中国教育科研网格:http://www.chinagrid.edu.cn/chinagrid/index.jsp
[173] NSFC网格:http://www.nsfcnet.net/
[174]李春江,李东升,肖侬.计算网格应用可用性的度量模型.计算机研究与发展,2003;40(12):1707-1708
[175]李春江,肖侬,杨学军.基于作业进展描述的计算网格作业检查点.计算机工程,2005;31(10):57-60
[176] J.Tsai, W.Lin.“On Characteristics of DEF Communication-Induced Checkpointing Algorithms”In Proc of the 2002 Pacific Rim International Symposium on Dependable Computing, 2002
[177] E.N.Elnozahy, L.Alvisi, Y.M.Wang, et al. A survey of rollback-recovery algorithms in message-passing systems, ACM Computing Surveys, 2002; 34(3): 375-408
[178] Vaidya N H, Impcat of checkpoint latency on overhead of a checkpointing schemes IEEE Transaction on Computer. Aug, 1997; 46(8):942-947
[179]蒋廷耀,李庆华.一种新的优化的检查点间隔的求解模型.小型微型机计算机系统,2003;24(3):449-450
[180] Plank J. S, Li K. Ickp: A Consistent Checkpointier for Multicomputers. IEEE parallel and distributed technology; systems and applications, 1994; 2(2):62-67
[181] Plank J.S, Xu J, Netzer RHB. Compressed differences: An algorithm for fast incremental checkpointing. Technical Report CS-95-302, University of Tennessee, August 1995
[182] Plank J.S, Beck M and Kignsley G.. Compiler-assisted memory exclusion for fast checkpointing. IEEE Technical Committee on Operating Systems and Application Environments, 1995; 7(4):10-14
[183] Plank J.S, Chen Y, Li K. Memory Exclusion: Optimizing the Performance of Checkpointing Systems. Software Practice and Experience, 1999; 29(2):12-142
[184]方敏,王亚平.计算机操作系统.西安:西安电子科技大学出版社,2004:61
[185]裴丹,汪东升,沈美明.工作站网络系统进程迁移机制.软件学报,1999;10(10):1032-1037
[186]周全,卢显良,任立勇.基于Linux的进程迁移机制设计.计算机应用,2003;23(8):56-61
[187]蒋江.异构集群系统中基于进程迁移机制的负载平衡算法的研究:[工学博士学位论文],国防科学技术大学,长沙:2002
[188]汪东升,沈美明,郑纬民.一种基于检查点的回卷恢复与进程迁移系统.软件学报,1999;10(1):68-73
[189] J.Duell, P.argrove, E.Roman,“The Design and Implementation of Berkeley Lab’s Linux Checkpoint/Restart”, 2002:10-13
[190]赵复生.集群环境下的进程迁移机制及改进算法:[工学硕士学位论文],天津大学,天津:2002
[191]黄涛.基于Linux的分布式系统中的进程迁移技术的设计与实现:[工学硕士学位论文],电子科技大学,重庆:2002
[192] J.R.Allen, K.Kennedy. PFC: A program to convert Fortran to parallel form. Supercomputers: Design and Applications, IEEE Computer Society Press, 1984: pp186-205
[193] F.Allen, M.Burke,et al.“An overview of the PTRAN analysis system formultiprocessing”. Proc. First Int. Conf. Supercomputing, 1987
[194]戚威,田光伟,韦俊银. MPP环境下的数据分割和数据的局部化.计算机工程, 2000;(3): 55-56
[195] http://www-suif.stanford.edu/suif/
[196] http://suif.stanford.edu/suif/NCI/suif.html
[197] R. Chandra, N. Zeldovich, C. Sapuntzakis. The Collective: A Cache-Based System Management Architecture. In Proceedings of the Second Symposium on Networked Systems Design and Implementation, May 2005: pp 259-272
[198] B. Blume, R. Eigenmann, et al. the next generation in parallelizing compiler. Proc. of 7th Workshop on LCPC, 1994.
[199]朱传琪,藏斌宇,陈彤.程序自动并行化系统.软件学报,1996;(3):180-186
[200]藏斌宇,陈彤,张瑜.有效的数组私有化方法:相关—覆盖方法.计算机学报, 2000;(1):2-9
[201]丁永华,陈彤,藏斌宇.过程繁衍及其实现方法.软件学报, 1996;(11):23-29
[202] Zhang Feng, Chen Guoliang, Zhang Zhaoqing.“OpenMP on Networks of Workstations for Software DSMs”. Journal of Computer Science and Technology, 2002;(01)
[203]周谦,冯晓兵,张兆庆.Cache Profiling技术.计算机工程,2006;(13):
[204]刘章林,石学林,冯晓兵.中间表示设计中基于链表的多寄存器操作数处理.计算机工程,2006;(01):31-33
[205]马琳,陈莉.基于动态Profiling技术的流水粒度调优.计算机研究与发展,2005;(06):163-170
[206] Xiaobing Feng, Li Chen, Yiran Wang. Integrating Parallelizing Compilation Technologies for SMP Clusters. Journal of Computer Science and Technology, 2005;(01)
[207]侯永生,赵荣彩.并行化编译器中基于工作量的条件并行化研究.微计算机信息,2005;(04):224-225
[208]马红途,赵荣彩.基于SUIF自动产生具有OpenMP编译指示的并行程序.计算机工程,2005;(08):95-97
[209]胡南军,刘勇,陈道蓄.并行编译中数据分布的线性划分模式计算.计算机工程与科学,2002(02):42-46
[210] Ian Foster. The grid: A new infrastructure for 21st century science,Physics Today, 2002 [211 ] J.Gu, Z.Li, et al. Symbolic array dataflow analysis for array privation and program parallelization. Supercomputing, 1995
[212] Banerjee U. Dependence Analysis for Supercomputing. Shen Zhiyu, Zhao Kejia Trans. Changsha: Press of Science and Technology of Hu’nan, 1991 (Banerjee U.超级计算中的依赖关系分析.沈志宇赵克佳译.长沙:湖南科学技术出版社,1991)
[213] Wolfe M. High performance Compilers for Parallel Computing. Redwood City: Addison-Wesley Publishing Company. 1996
[214] U. Banerjee.“Dependence analysis for Supercomputing”, Kluwer. Boston, MA. 1988.
[215] W. Pugh.“A Practical Algorithm for Exact Array Dependence Analysis”, Communications of the ACM, Vol.8 August 1992. pp: 102-114 57中国石油大学(华东)硕士论文参考文献
[216] Cooper K D, Hall M W, Kennedy K. A methodology for procedure cloning. Computer Languages, 1993, 19(2):105-117
[217] Hall M W. Murphy B R. Amarasinghe S P et al. Interprocedural analysis for parallelization. Proceedings of the 8th Workshop on Languages and Compilers for Parallel Computing. Berlin: Springer, 1995, 61-68
[218] Gu J, Li Z, Lee G. Experience with efficient array data flow analysis for array privatization. In: Proceedings of the 6th ACM SIGPLAY Symposium on Principles & Parallel Programming. New York: ACM, 1997, 157-167
[219] Einenmann R, Hoeflinger J, Padua D. On the automatic parallelization of the perfect benchmarks. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(1):5-23
[220] Blume W, Eigenmann R, Nonlinear and symbolic data dependence testing. IEEE Transaction on Parallel and Distributed Systems, 1998, 9(12): 1180-1194
[221] S. Pande, D P Agrawal. Compilation techniques for distributed memory systems: Guest editorial introduction(special issue). Journal of Parallel and Distributed Computing on Compilation Techniques for Distributed Memory Systems, 1996; 38:107-113
[222]汪剑平,成旭,丁文魁等.HPF编译器中的通信实现策略及其相关算法.计算机学报,1997;22(5):39-48
[223] U.J.Kuck, R.Kuhn“Automatic program parallelization”, Proceedings of the IEEE,vol.81, no.2, 1993: 211-243
[224] W.Blume and R.Eigenmann,”Performance analysis of parallelizing compilers on the Perfect Benchmarks programs,”IEEE Trans.Parallel and Distributed Systems, vol.3, no.6, Nov.1992: 643-656
[225] U.Banerjee“Dependence analysis for supercomputing.”Norwell.Mass.Kluwer Academic Publishers 1988
[226] M.Wolfe, U.Banerjee.“Data dependence and its application to parallel processing.”International Journal of Parallel Programming. 1987.4
[227] J.M. Anderson, M.S. Lam.“Global Optimizations for Parallelism and Locality on Scalable Parallel Machines.”Proc. ACMSIGPLAN PLDI, Albuquerque, N.M., June 1993: pp112-125
[228] M. Mace. Memory Storage Patterns in Parallel Processing. Boston. Kluwer Academic, 1987
[229] U. Kremer. "NP-Completeness of Dynamic Remapping.“Proc. Fourth Workshop Compilers for Parallel Computers, Delft, the Netherlands, Dec.1993
[230] J. Li, M. Chen.“The Data Alignment Phase in Compiling Programs for Distributed-Memory Machines.”Parallel and Distributed Computing, vol.13, 1991: pp213-221
[231] Ramanujam J. and Sadayappan P. Tiling Multidimensional iteration spaces for multicomputers. Journal of parallel and distributed computing 16 , 1992: 108-120
[232] Anderson J. Automatic Computation and Data Decomposition for Multiprocessors. Ph. D. thesis, Dept. of EE and CS, Standford Univ. Stanford, CA
[233] Xue J. Communication-minimal tiling of uniform dependence loops. Journal of Parallel and Distributed Computing 42,, 1997: 42-59
[234] Chen T. and Sheu J. Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Trans. Parallel Distributed Syst. 5, 9. 1994: 924-938
[235] Huang C. and Sadayappan. Communication-free hyper plane partitioning of nested loops. Journal of Parallel and Distributed Computing 19. 1993: 90-102
[236] Ning Q., Dongen V. and Gao. Automatic data and computation decomposition for distributed memory machines. Parallel Processing Letters 5, 1995: 539-550
[2]薛宏全,廖建明,周小兵.基于移动代理的网格资源发现与监控模型研究.计算机应用,2004,24(6) :54-57
[3] Foster, Kesselman编著.金海,袁平鹏,石柯译.网格计算(第2版).北京:电子工业出版社,2004
[4]查礼,徐志伟,林国璋等.基于LDAP的网格监控系统.计算机研究与发展,2002,39(8):930-936
[5]潘景山,王英龙,张睿超等.基于LDAP和代理的网格环境下网络性能监控系统.大连理工大学学报,2004(10):103-106
[6]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社,2004
[7]语义Web和语义网格概述, http://bbs.w3china.org/dispbbs.asp?boardID=57&ID=14070
[8] A.Brown and D.A.Patterson. Embracing failure: A case for Recovery-Oriented Computing(ROC).In High Performance Transaction Processing Symposium, Asilomar, CA, 2001
[9] G. Fedak, C. Germain, V. Neri, F. Cappello. Xtrem Web: A Generic Global Computing System. In proceedings of the 1st IEEE/ACM Int’l Conf. On Cluster Computing and the Grid, Brisbane, Australia,IEEE Computer Society, 2001
[10] SF Express Project. http://www.cacr.caltech.edu/SFExpress/
[11] Sharon Brunett , Steven Fitzgerald. Metacomputing Supports Large-Scale Distributed Simulations, 1998, http://www.cacr.caltech.edu/SFExpress /pubs/sc98/sc98.html.
[12]李庆华,郭志鑫.一种面向工作站网络的系统负载预测方法.华中科技大学学报(自然科学版).2002,30(6) :49-51
[13] Dinda,David.R.O'Hallaron. Realistic CPU Workloads Through Host Load Trace Playback.LCR, 2000:246-259.or http://www.cs.cmu.edu/~pdinda/LoadTraces
[14]王丽,李敬有,王岩.面向工作站群机系统的网络负载预测.齐齐哈尔大学学报,2000,16(3) :63-65
[15] Monitoring event,“Discovery and Monitoring Event Description (DAMED-WG)”, http://www-didc.lbl.gov/damed
[16] PID Tutorial, http://www.engin.umich.edu/group/ctm/PID/PID.html
[17] P. A. Dinda and D. R. O'Hallaron. An Evaluation of Linear Models for Host Load Prediction. Proceedings of the 8th IEEE International Symposium on High-Performance Distributed Computing (HPDC-8), Redondo Beach, CA, 1999
[18] P. A. Dinda and D. R. O'Hallaron. The Statistical Properties of Host Load. Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR 98), Pittsburgh, PA, 1998
[19] Dail, H.J. A Modular Framework for Adaptive Scheduling in Grid Application Development Environments. Computer Science, 2001
[20] R. Wolski. Dynamically Forecasting Network Performance Using the Network Weather Service. Journal of Cluster Computing, 1998
[21] R. Wolski, N. Spring, J. Hayes. Predicting the CPU availability of Time-shared Unix Systems. Proceedings of 8th IEEE High Performance Distributed Computing Conference (HPDC-8), 1999
[22] R. Wolski. N. Spring, J. Hayes. The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Journal of Future Generation Computing Systems, 1998
[23] R. Wolski, N. Spring, C. Peterson. Implementing a Performance Forecasting System for Metacomputing: The Network Weather Service. Proceedings of SC97,1998
[24] M. Harchol-Balter and A. Downey. Exploiting Process Lifetime Distributions for Dynamic Load Balancing. Proceedings of ACM Sigmetrics' 96 Conference on Measurement and Modeling of Computer Systems, 1996
[25] David de Roure, Mark A. Baker, Nicholas R. Jennings et al. The evolution of the Grid. Grid Computing - Making the Global Infrastructure a Reality, 2003
[26] I.Foster, C.Kesselman. The Grid:Blueprint for a Future Computing Infrastructure.Morgan Kaufmann: San Francisco,CA,1999
[27] Gordon Good. RFC2849: LDAP Data Interchange Format(LDIF).2000
[28] Wengyik Yeong,Tim Howes,Steve Kille. RFC2251:Lightweight Directory Access Protocol(v3).1997
[29] Ian Foster, Carl Kesselman. The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Applications,2001,15(3):200-222
[30] Ian Foster, CarlKesselman, Jefrey M.Nick,et al. The Physiology of the Grid:An Open Grid Services Architecture for Distributed Systems Integration. http://www.globus.org/research/papers/ogsa.pdf
[31]都志辉,陈渝,刘鹏等.以服务为中心的网格体系结构OGSA.清华大学高性能所网格研究组技术报告,2002 http://hpclab.cs.tsinghua.edu.cn/~duzh/project/ogsa/ogsaintro.pdf
[32]张军华.基于HPF的地震资料并行处理方法研究:[工学博士学位论文],石油大学(华东),山东:2002
[33]张颖峰,李毓麟.基于进化算法的网格计算资源管理调度系统.计算机工程,2003;29(15):110-111
[34]郑然,李胜利,金海.网格资源管理与调度模型的研究.华中科技大学学报(自然科学版), 2001;29(12):87-89
[35]林剑柠,吴慧中.基于遗传算法的网格资源调度算法.计算机研究与发展,2004;41(12):2196-2199
[36]金海,陈刚,赵美平.容错计算网格作业调度模型的研究.计算机研究与发展,2004;41(08):1382-1388
[37] Krauter K, Buyya R, Maheswaran M. A TaXonomy and Survey of Grid Resource Management Systems. Software Practice and Experience, 2002; 32(2):80-85
[38] Xinjun Chu, Yu qing Fan.The research of PDM based on Web. Journal of Beijing Aeronautics and Astronaunts University, 1999(4): 205-207
[39] Ian Foster, Carl Kesselman. Grid:Blueprint for a New Computing Infrastructure.Morgan: Morgan-Kaufman, 1998
[40] Ian Foster, C Kesselman, S Teucke. The Anatomy of the Grid: Enabling Scalable Virtual Organization. International J. Supercomputer Applications, 2001;15 (3):80-84
[41] Ian Foster. What is the Grid? A Three-Point Checklist. Grid Today-Daily News and Information for the Global Grid Community, 2002;1(6):10-12
[42] Ian Foster. The Grid: A New Infrastructure for 21st Century Science. Physics Today, 2002;55 (2):42-47
[43] Karl C zajkowski, Ian Foster, Nicholas Karonis. Dynamic Grid Resource Management Architecture for Metacomputing Systems. Proc of IPPS/SPDP'98 Workshop on Job Scheduling Strategies for Parallel Processing. Orlando, Florida, USA , 1998
[44]查礼,徐志伟,林国璋等.数据和计算密集混合元任务的网格调度算法.计算机工程与设计,2003;10
[45]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社,2004
[46]李胜利.基于Web的网格资源管理与调度:[工学硕士学位论文].华中科技大学.武汉:2002
[47] Foster, C Kesselman. The Grid: Blueprint for a New Computing Infrastructure. San Francisco, CA: Morgan Kaufmann Publisher. 1999
[48]朱福喜,何炎祥.并行分布计算中的调度算法理论与设计.武汉:武汉大学出版社,2003 [49[]萨师煊,王珊.数据库系统概论.第三版.北京:高等教育出版社,2000:253-255
[50] MAHESWARAN M,ALIS,SIEGEL HJ,et al. Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. Proceeding of the 8th IEEE Heterogeneous Computing Workshop (HCW’99). IEEE Computer Society Press,1999:30-44.
[51] K. Czajkowski, I.an Foster, et al. Grid resource management: state of the art and future trends. Norwell, MA, USA: Kluwer Academic Publishers, 2004: 119-134
[52] Ling yun Yang, Jennifer M.Schopf, Ian Foster. Conservative Scheduling: Using Predicted Variance to Improve Scheduling Decisions in Dynamic Environments. SC'03, Phoenix, USA.2003:31
[53] G Allen,T. Dlitsch,et al. Supporting Efficient Executionin Heterogeneous Distributed Computing Environments with Cactus and Globus. Conference on High Performance Networking and Computing. Denver, Colorado.2001.New York, USA:ACM Press, 2001:52
[54] hloriyuki Fujimoto, Kenichi Hagihara. A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks. SAINT Workshops 2004: 674-680.
[55] Berman F, Computing Wolski R, Casanova H, Cirne W, Dai H, Faerman M et al. Adaptive Computing on the Grid Using AppLeS. IEEE Transactions on Parallel and Distributed Systems, 2003;14(4): 369-382
[56] He Xiaoshan, Xian-He Sun, Gregor von Laszewski. QoS Guided Min-Min Heuristic for Grid Task Scheduling. Journal of Computer Science and Technology. 2003;18(4):442-445
[57] T. Braun, H. Sigel, N. Beck, L. Boloni, M. Masheswaran, A. Reuther, J.Robertson, M. Theys, B.Yao, D.Hensgen. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In 8th IEEE heterogeneous computing Workshop (HCW‘99),1999;(4): 15-29
[58]武广号、文毅、乐美峰.遗传算法及其应用应用力学学报.1996;13(2)
[59[]钟守楠.遗传算法的收敛性与编码武汉水利电力大学学报.2000;33(1)
[60]张颖,刘艳秋.软计算方法.北京:科学出版社2002
[61] Manzur Murshed and Rajkumar Buyya, Using the GridSim Toolkit for Enabling Grid Computing Education, International Conference on Communication Networks and Distributed Systems Modeling and Simulation (CNDS 2002), January 27-31, 2002, San Antonio, Texas, USA.
[62] Rajkumar Buyya and Manzur Murshed, GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Crid Computing, The Journal of Concurrency and Computation: Practice and Experience (CCPE), Volume 14, Issue 13-15, Wiley Press, Nov.-Dec,2002.
[63] Rajkumar Buyya, Manzur Murshed, and David Abramson, A Deadline and Budget Constrained Cost-Time Optimization Algorithm for Scheduling Task Farming Applications on Global Grids, Technical Report, CSSE-2002/109, Monash University, Melbourne, Australia.
[64] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya.Visual Modeler for Grid Modelling and Simulation (GridSim) Toollcit, Proceedings of the 3rd International Conference on Computational Science (ICCS 2003), Springer Verlag Publications (LNCS Series), June, 2003, Melbourne,Australia
[65] Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya, A Taxonomy of Computer-based Simulations and its Mapping to Parallel and Distributed Systems Simulation Tools, International Journal of Software: Practice and Experience, Volume 34, Issue 7, Pages: 653-673, Wiley Press, USA, June 2004.
[66] Anthony Sulistio, Rajkumar Buyya, A Grid Simulation Infrastructure Supporting Advance Reservation, Proceedings of the 16th International Conference on Parallel and Distributed Computing and Systems(PDCS 2004), November 9-11, 2004, MIT, Cambridge, USA, pp. 1-7.
[67]陈渝.网格平台Globus的核心技术.清华大学计算机系高性能所网格研究组.北京:2002
[68] J. Novomy, S. Tuecke. An Online Credential Repository for the Grid: MyProxy. Proceedings of the Tenth International Symposium on High Performance Distributed Computing (HPDC-10). San Francisco, Califonia. 2001. USA:IEEE Press, 2001.104-111
[69] E. Johnston, S. Talwar, R. Jackson, et al. Overview of Security Considerations for Computational and Data Grids. Proceedings of the Tenth IEEE International Symposium on High-Performance Distributed Computing(HPDC-10).SanFrancisco, California. 2001.USA: IEEE Press, August, 2001. 439-440
[70]陈锡明,卢显良.NOW环境中一种负载平衡系统ALBSIN的研究与实现.小型微型计算机系统.2001;22(9)
[71] A Downey. Predicting Queue Times on Space-Sharing Parallel Computers. International Parallel Processing Symposium,1997
[72] R Gibbons. A Historical Application Profiler for Use by Parallel Schedulers. Lecture Notes on Computer Science, 1997:58-75
[73] W Smith, Ian Foster, V Taylor. Predicting Application Run Times Using Historical Information. Lecture Notes in Computer Science,1998
[74] B PMiller, A Tamches. Fine-grained dynamic instrumentation of commodity operating system kernels. Third Symposium on Operating SystemsDesignandImplementation(OSDI'99),NewOrleans,1999(2):117-130
[75] P Dinda, D Hallaron. An Extensible Toolkit for Resource Prediction In Distributed Systems. Technical Report CMU-CS-99-138,School of Computer Science,Carnegie Mellon University,1999
[76] H Sun, M Wu. Grid Harvest Service: A System for Long-term, Application-level Task Scheduling. Proc of 2003 IEEE International Parallel and Distributed Processing Symposium, Nice,France,2000
[77] I Foster, C Kesselman, S Teucke. The Anatomy of the Grid: Enabling Scalable Virtual Organization. International. Supercomputer Applications, 2001;15 (3):80-84
[78] Globus Homepage http://www.globus.org/ 2007
[79] B. Allcock, J. Bester, J. Bresnahan et al. Data management and transfer in high performance computational grid environments. Parallel Computing Journal, Vol.28, May 2002:5-12
[80] The Globus Team. GridFTP: Universal Data Transfer for the Grid. http://www.globus.org, White Paper.
[81] Vazhkudais. Replica Selection in the Globus Data Grid. Proceedings of the First IEEE/ACMC CGRID, 2001
[82] EU Datagrid Project Http://eudatagrid.web.cern.ch/eu-datagrid/ 2005
[83] L Guy, P Kunszt, E Laure et.al. Replica Management in Data Grids, Technical report,DataGrid-02-TED-020724, July 2002
[84] SRB http://www.ibm.com/developerworks/cn/grid/gr-srb/#N10052 2007
[85]庞丽萍,周润松,吴松等.基于LDAP的广域网存储虚拟化目录管理华中科技大学学报(自然科学版),2004; 32 (05): 64~66
[86]金海,官象山,吴松等.分布式存储系统中文件传输优化的设计与实现,华中科技大学学报(自然科学版), 2005; 33 (01): 4~9
[87]刘鹏展,刘亮,杨寿保. GridFTP传输性能分析,计算机工程与应用2005; 15:138-140
[88]肖侬,付伟,黄斌等. Griddaen数据网格系统的设计与关键技术实现. http://www.chinagrid.net, 2005
[89] China Grid Home Page. http://www.chinagrid.edu.cn. 2007
[90]都志辉,陈渝,刘鹏.网格计算.北京:清华大学出版社, 2002
[91]徐志伟,冯百明,李伟.网格计算技术.北京:电子工业出版社, 2004
[92] H Siegelmann, O Frieder. Document allocation in multiprocessor information retrieval systems advanced database systems, LNCS759 Springer, 1993:289-310
[93] Kurt Geihs1. Middleware challenges ahead. Computer IEEE, 2001,34(6): 24-31.
[94] I Foster. The Grid: A new infrastructure for 21st century science. Physics Today, 2002:55 (2):42-47
[95] Data Farm Home Page. http://datafarm.apgrid.org/. 2007
[96] I Foster, J Frey et al. Modeling stateful resources with web services, Version1.1http://www-106.ibm.com/develperworks/library/ws-resource/ws-modelingresource.pdf
[97] Borja Sotomayor. The Globus Toolkit 4 programmer’s tutorial. http://www.globus.org/toolkit/. 2007
[98] J Bester, I Foster, C Kesselman, et al. GASS:A data movement and access service for wide area computing systems. Sixth Workshop on I/O in Parallel and Distributed Systems. 1999.
[99] W Hoschek, J Jaen-Martinez, A Samar, et al. Data management in an international grid project. 2000 International Workshop on Grid Computing, December 2000.
[100] OGSA-DAI http://www.globus.org/toolkit/docs/4.0/techpreview/ogsadai/ 2007
[101] B Allcock, J Bester, J Bresnahanet et al. GridFTP Protocol Specification, GGF GridFTP Working Group Document, September 2002.
[102] GT 4.0 RLS http://www.globus.org/toolkit/docs/4.0/data/rls/. 2007
[103]孙海燕.数据网格副本管理关键技术的研究:[工学博士学位论文],国防科技大学,湖南: 2005
[104] A Rowstron, P Druschel. Scalable, distributed object location and routing for large–scale peer-to-peer systems. Proc of the 18th IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, 2001:329-350.
[105] Hierarchical Distributed Replica Catalogues. EU DataGrid Project: Work Package 2, http://cern.ch/grid-data-management/.
[106] Y Hu. IBL for replica selection in data intensive Grid applications. Mater’s Thesis, Department of Computer Science, University of Chicago, 2003
[107] Sudharshan Vazhkudal, M Jennifer, Schopf. Using disk throughput data in predictions of end-to-end grid data transfer. Proceedings of Grid 2002, 2002: 291-304
[108] Faerman, Wolski, Berman. Adaptive performance prediction for distributed data-Intensive appliation. Proceedings of the 1999 ACM/IEEE conferenece on Supercomputering(CDROM),1999.
[109] Baru, R.Moore, et al. The SDSC storage resource broker. Proceedings of IBM Centers for Advanced Studies Conferenece 1998
[110]黄斌,彭小宁,肖侬等.数据网格环境中数据传输服务的研究与实现,计算机应用研究, 2004; 21 (10): 212~214
[111] Gnutella Home Page. http://gnutella.wego.com 2007
[112] The freenet project. http://freenetproject.org 2007
[113] Napster Home Page. http://www.napster.com 2007
[114] A Herzberg, Y Mass, J Mihael. Access control meets public key infrastructure. Proceedings of the 2000 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 2000
[115] GridFTP_C_interface. http://www.globus.org/api/ 2007
[116] GridFTP_Client. http://www.globus.org/api/ 2007
[117] GT Java CoG Kit. http://www.globus.org/toolkit/docs/ 2007
[118]应宏,黄河.网格体系结构、关键技术及其应用,计算机应用研究2004:9:7-11
[119] Globus-url-copy. http://www-unix.globus.org/toolkit/docs/ 2006
[120]曾国荪,陈闳中.计算网格的抽象定义.同济大学学报(自然科学版), 2003; 31(9):1092-1097
[121]时维国,宋存利,黄明.基于启发式算法的并行多机调度问题研究,大连铁道学院学报, 2003; 24(4):55-57
[122]寿纪麟.数学建模--方法与范例,西安:西安交通大学出版社, 1984
[123]梁鸿,田世峰.基于改进蚂蚁算法的网格任务调度策略研究,电子技术应用, 2006; 32(11):42-44
[124]刘舒强.概率论与数理统计,天津:天津大学出版社, 2003
[125] GT4 Admin Guide http://www.globus.org/toolkit/docs/4.0/admin/ 2007
[126]李凯原,杨孝宗.减少检查点开销的一种方法.计算机工程与应用,2000;36(2):4-5
[127]李毅,周明天.Minix进程检查点机制的实现.计算机应用,2003,23(1):12-17
[128] E.Pinheiro“EPCKPT,”http://www.research.retgers.edu/
[129] H.Zhong, J.Nieh,“CRAK: Linux Checkpoint/Restart as a Kernel Module,”Department of Computer Science, Columbia University, New York, Technical Report, November 2001
[130] K.A.Iskra, F.vander Linden, Z.W.Hendrikse, et al.“The implementation of Dynamite: An environment for migrating PVM Tasks,“Operating Systems Review, July 2000; 34(3):40-55
[131] J.S.Plank, M.Beck, G.Kingsley, et al.“Transparent Checkpointing under Unix,”Proceedings of the Unix Winter 1995 Technical Conference, New Orleans, Louisiana, 1995
[132] M.Litzkow, T.Tananenbaum, J.Basney, M.Livny,“Checkpoint and Migration of UNIX Processed in the Condor Distributed Processing System,”University of Wisconsin-Madison, Computer Sciences Technical Report, April 1997
[133] J.Pruyne, M.Livny.“Managing Checkpoints for Parallel Programs,”Proceedings of the IPPS Second Workshop on Job Scheduling Strategies for Parallel Processing, Honolulu, Hawaii, April 1996:15-19
[134] Rajkumar Buyya. High Performance Cluster Computing, Architectures and Systems. Prentice Hall, 1999; Vol 1:151-156
[135] M.Litkow, P.Giese, W.Zint. Experiences with Load Distribution on Top of the Mach Microkernel. Proceedings of the UNIX Symposium on Experiences with Distributed and Multiprocessor Systems, 1993
[136] R.RASHID, G.ROBERTSON. Accent: a Communication Oriented Network Operation System Kernel. Proceeding of the 10th ACM Symposium on OS Principles, 1985:2-12
[137] X.Zhang, Y.Qu, L.Xiao.“Improving distributed workload performance by sharingboth CPU and memory resources”Proc. of 20th Inter. Conf. On Distributed Computing Systems. Taipei, 2000:261-264
[138] L.Xiao, X.Zhang, Y.Qu.“Effective load sharing on heterogeneous networks of workstation”. Proc. of the 2000 Inter. Parallel and Distributed Processing Symposium. Mexico, 2002: 431-438
[139] A.Barak, G.Shai, R.G.Wheeler. The MOSIX Distributed Operation System: Load Balancing for Unix. Springer Verlag, Berlin, 1993
[140] Douglis, J.Ousterhout. Transparent process migration: design alternatives and the sprite implementation Software: Practice and Experience 1991: 21(8):757-785
[141] M.Harchol-Balter, B. Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems, 1997; 15(3):253-285
[142] M.Mitzenmacher. How useful is old information. Proc. of the 16th ACM Symposium on Principles of Distributed Computing, 1997:83-91
[143] Damien De Paoli, Andrzej, Goscinski. An Overview of Process Management in the RHODOS System. School of Computing and Mathmatics, Deakin University, 1994
[144] Ian Foster, Carl Kesselman. The Globus Project:A Status Report,Proceedings of the Seventh Heterogeneous Computing Workshop, J.K. Antonio, Editor, IEEE, Computer Soc press, Los Alamitos, 1998:4-18
[145] Ian Foster, Carl Kesselman. The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann, San Francisco, CA, USA, 1999
[146] Ian Foster. Carl Kesselman,Tuecke Steven. The Anatomy of the Grid: Enabling Scalable Virtual Organizations, International Journal of High Performance Computing Applications, 2001; 15(3): 200-222
[147] Ian Foster, Carl Kesselman, Jeffrey Nick, et al. Grid Services for Distributed System Integration, Computer, 2002; 35(6): 37-46
[148] Miguel, L.Bote-Lorenzo, Yannis, et al. Grid characteristics and uses: A grid definition, Grid Computing, Springer-Verlag, Berlin, 2004:291-298
[149] Mark Baker, Rajkumar Buyya, Domenico Laforenza. Grids and Grid Technologies for Wide-area Distributed Computing, Software-Practice & Experience, 2002; 32(15): 1437-1466
[150] Jennifer M. Schopf, Bill Nitzberg. Grids: the Top Ten Questions, Scientific你Programming, 2002; 10(2): 103-111
[151] Ian Foster, C.Kesselman, J.Nick, et al. The Physiology of the Grid: An Open GridServices Architecture for Distributed Systems Integration, January, 2002
[152] Dorian C. Amold, Henri Casanova, Jack Dongarra. Innovations of the NetSolve Grid Computing System, Concurrency and Computation Practice $ Experience, 2002; 14(13): 1457-1479
[153] Hidemoto Nakada, Yoshio Tanaka, Satoshi Matsuoka, et al. The Design and Implementation of a Fault-tolerant RPC System: Ninf-C, Procedings of Seventh International Conference on High Performance Computing, Grid in Asia Pacific Region, IEEE Computer Soc, Los Alamitos, 2004: 9-18
[154] Dietmar, W.Erwin. Unicore: A Grid Computing Environment, Concurrency and Computation-Practice & Experience, 2002; 14(13): 1395-1410
[155] Rajkumar Buyya, Srikumar Venugopal. The Gridbus Toolkit for Service Oriented Grid and Utility Computing: An Overview and Status Report, Gecon 2004, J.Hwang, H. Park, Editors, IEEE, New York, 2004:19-66
[156] Fran Berman, Rich Wolski, Silvia Figueira, et al. Application-Level Scheduling on Distributed Heterogeneous Networks, Proceedings of Supercomputing 96, Pittsburgh, PA, 1996
[157] James Frey, Todd Tannenbaurn, Miron Livay, Ian Foster, Steven Tuecke, Condor-G: 5(3): 237-246
[158] Rajkumar Buyya, David Abramson, Jonathan Giddy, Nimrod/G: An Architecture for a Resource Management and Scheduling System in a Global Computational Grid, Proceedings of Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, 2000;Vol 1: 283-289
[159] Goodale Tom, Allen Gabrielle, Lanfermann Gerd, et al. The Cactus Framework and Toolkit: Design and Applications, High Performance Computing for Computational Science VECPAR 2002. 5th International Conference, Selected Papers and Invited Talks (Lecture Notes in Computer Science 2003; Vol.2: 197-227
[160] Francine Berman, Andrew Chien, Keith Cooper, Jack Dongarrs, et al. The GrADS Project: Software support for High-level Grid Application Development, International Journal of High Performance Computing Applications, 2000; 15(4): 327-344
[161] Mary Thomas, Steve Mock, Maytal Dahan, et al. The GridPort Toolkit: A System for Building Grid Portals. Proceedings of 10th IEEE International Symposium on High Performance Distributed Computing, 2001:216-227
[162] PETER Kunszt. European DataGrid Project: Status and Plans, Nuclear Instruments & Methods in Physics Research Section a Accelerators Spectrometers Detectors andAssociated Equipment, 2003:376-381
[163] Ewa Deelman, Carl Kesselman, Gaurang Mehta, et al. GridPhyN and LIGO, Building a Virtual Data Grid for Gravitational Wave Scientists, Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, IEEE Computer Soc. Los Alamitos, 2002: 225-234
[164] Billie Spencer, Jr. Thomas, Finholt, Ian Foster, et al. NEESGRID: A Distributed Collaboratory for Advanced Earthquake Engineering Experiment and Simulation, Proceedings of the 13th World Conference on Earthquake Engineering, Vancouver, B.C, Canada, 2004
[165] Simon Cox, Grid Enabled Optimisation and Design Search for Engineering (Geodise), Semantic Grid Workshop, Tokyo, 2003
[166] William Leinberger, Vipin Kumar, Information Power Grid: The New Frontier in Parallel Computing IEEE Concurrency, 1999; 7(4): 75-84
[167] Globus: http://www.globus.org
[168] PlanetLab: http://www.planet-lab.org/
[169] e_Science: http://grid.ifca.unican.es/
[170] Li Zha, Wei Li, Haiyan Yu, et al. System Software for China National Grid,Network and Parallel Computing, Berlin, 2005: 14-21
[171] Hai Jin, ChinaGrid Project, 2005 International Conference on Parallel Processing Workshops, 2005: 81-81
[172]中国教育科研网格:http://www.chinagrid.edu.cn/chinagrid/index.jsp
[173] NSFC网格:http://www.nsfcnet.net/
[174]李春江,李东升,肖侬.计算网格应用可用性的度量模型.计算机研究与发展,2003;40(12):1707-1708
[175]李春江,肖侬,杨学军.基于作业进展描述的计算网格作业检查点.计算机工程,2005;31(10):57-60
[176] J.Tsai, W.Lin.“On Characteristics of DEF Communication-Induced Checkpointing Algorithms”In Proc of the 2002 Pacific Rim International Symposium on Dependable Computing, 2002
[177] E.N.Elnozahy, L.Alvisi, Y.M.Wang, et al. A survey of rollback-recovery algorithms in message-passing systems, ACM Computing Surveys, 2002; 34(3): 375-408
[178] Vaidya N H, Impcat of checkpoint latency on overhead of a checkpointing schemes IEEE Transaction on Computer. Aug, 1997; 46(8):942-947
[179]蒋廷耀,李庆华.一种新的优化的检查点间隔的求解模型.小型微型机计算机系统,2003;24(3):449-450
[180] Plank J. S, Li K. Ickp: A Consistent Checkpointier for Multicomputers. IEEE parallel and distributed technology; systems and applications, 1994; 2(2):62-67
[181] Plank J.S, Xu J, Netzer RHB. Compressed differences: An algorithm for fast incremental checkpointing. Technical Report CS-95-302, University of Tennessee, August 1995
[182] Plank J.S, Beck M and Kignsley G.. Compiler-assisted memory exclusion for fast checkpointing. IEEE Technical Committee on Operating Systems and Application Environments, 1995; 7(4):10-14
[183] Plank J.S, Chen Y, Li K. Memory Exclusion: Optimizing the Performance of Checkpointing Systems. Software Practice and Experience, 1999; 29(2):12-142
[184]方敏,王亚平.计算机操作系统.西安:西安电子科技大学出版社,2004:61
[185]裴丹,汪东升,沈美明.工作站网络系统进程迁移机制.软件学报,1999;10(10):1032-1037
[186]周全,卢显良,任立勇.基于Linux的进程迁移机制设计.计算机应用,2003;23(8):56-61
[187]蒋江.异构集群系统中基于进程迁移机制的负载平衡算法的研究:[工学博士学位论文],国防科学技术大学,长沙:2002
[188]汪东升,沈美明,郑纬民.一种基于检查点的回卷恢复与进程迁移系统.软件学报,1999;10(1):68-73
[189] J.Duell, P.argrove, E.Roman,“The Design and Implementation of Berkeley Lab’s Linux Checkpoint/Restart”, 2002:10-13
[190]赵复生.集群环境下的进程迁移机制及改进算法:[工学硕士学位论文],天津大学,天津:2002
[191]黄涛.基于Linux的分布式系统中的进程迁移技术的设计与实现:[工学硕士学位论文],电子科技大学,重庆:2002
[192] J.R.Allen, K.Kennedy. PFC: A program to convert Fortran to parallel form. Supercomputers: Design and Applications, IEEE Computer Society Press, 1984: pp186-205
[193] F.Allen, M.Burke,et al.“An overview of the PTRAN analysis system formultiprocessing”. Proc. First Int. Conf. Supercomputing, 1987
[194]戚威,田光伟,韦俊银. MPP环境下的数据分割和数据的局部化.计算机工程, 2000;(3): 55-56
[195] http://www-suif.stanford.edu/suif/
[196] http://suif.stanford.edu/suif/NCI/suif.html
[197] R. Chandra, N. Zeldovich, C. Sapuntzakis. The Collective: A Cache-Based System Management Architecture. In Proceedings of the Second Symposium on Networked Systems Design and Implementation, May 2005: pp 259-272
[198] B. Blume, R. Eigenmann, et al. the next generation in parallelizing compiler. Proc. of 7th Workshop on LCPC, 1994.
[199]朱传琪,藏斌宇,陈彤.程序自动并行化系统.软件学报,1996;(3):180-186
[200]藏斌宇,陈彤,张瑜.有效的数组私有化方法:相关—覆盖方法.计算机学报, 2000;(1):2-9
[201]丁永华,陈彤,藏斌宇.过程繁衍及其实现方法.软件学报, 1996;(11):23-29
[202] Zhang Feng, Chen Guoliang, Zhang Zhaoqing.“OpenMP on Networks of Workstations for Software DSMs”. Journal of Computer Science and Technology, 2002;(01)
[203]周谦,冯晓兵,张兆庆.Cache Profiling技术.计算机工程,2006;(13):
[204]刘章林,石学林,冯晓兵.中间表示设计中基于链表的多寄存器操作数处理.计算机工程,2006;(01):31-33
[205]马琳,陈莉.基于动态Profiling技术的流水粒度调优.计算机研究与发展,2005;(06):163-170
[206] Xiaobing Feng, Li Chen, Yiran Wang. Integrating Parallelizing Compilation Technologies for SMP Clusters. Journal of Computer Science and Technology, 2005;(01)
[207]侯永生,赵荣彩.并行化编译器中基于工作量的条件并行化研究.微计算机信息,2005;(04):224-225
[208]马红途,赵荣彩.基于SUIF自动产生具有OpenMP编译指示的并行程序.计算机工程,2005;(08):95-97
[209]胡南军,刘勇,陈道蓄.并行编译中数据分布的线性划分模式计算.计算机工程与科学,2002(02):42-46
[210] Ian Foster. The grid: A new infrastructure for 21st century science,Physics Today, 2002 [211 ] J.Gu, Z.Li, et al. Symbolic array dataflow analysis for array privation and program parallelization. Supercomputing, 1995
[212] Banerjee U. Dependence Analysis for Supercomputing. Shen Zhiyu, Zhao Kejia Trans. Changsha: Press of Science and Technology of Hu’nan, 1991 (Banerjee U.超级计算中的依赖关系分析.沈志宇赵克佳译.长沙:湖南科学技术出版社,1991)
[213] Wolfe M. High performance Compilers for Parallel Computing. Redwood City: Addison-Wesley Publishing Company. 1996
[214] U. Banerjee.“Dependence analysis for Supercomputing”, Kluwer. Boston, MA. 1988.
[215] W. Pugh.“A Practical Algorithm for Exact Array Dependence Analysis”, Communications of the ACM, Vol.8 August 1992. pp: 102-114 57中国石油大学(华东)硕士论文参考文献
[216] Cooper K D, Hall M W, Kennedy K. A methodology for procedure cloning. Computer Languages, 1993, 19(2):105-117
[217] Hall M W. Murphy B R. Amarasinghe S P et al. Interprocedural analysis for parallelization. Proceedings of the 8th Workshop on Languages and Compilers for Parallel Computing. Berlin: Springer, 1995, 61-68
[218] Gu J, Li Z, Lee G. Experience with efficient array data flow analysis for array privatization. In: Proceedings of the 6th ACM SIGPLAY Symposium on Principles & Parallel Programming. New York: ACM, 1997, 157-167
[219] Einenmann R, Hoeflinger J, Padua D. On the automatic parallelization of the perfect benchmarks. IEEE Transactions on Parallel and Distributed Systems, 1998, 9(1):5-23
[220] Blume W, Eigenmann R, Nonlinear and symbolic data dependence testing. IEEE Transaction on Parallel and Distributed Systems, 1998, 9(12): 1180-1194
[221] S. Pande, D P Agrawal. Compilation techniques for distributed memory systems: Guest editorial introduction(special issue). Journal of Parallel and Distributed Computing on Compilation Techniques for Distributed Memory Systems, 1996; 38:107-113
[222]汪剑平,成旭,丁文魁等.HPF编译器中的通信实现策略及其相关算法.计算机学报,1997;22(5):39-48
[223] U.J.Kuck, R.Kuhn“Automatic program parallelization”, Proceedings of the IEEE,vol.81, no.2, 1993: 211-243
[224] W.Blume and R.Eigenmann,”Performance analysis of parallelizing compilers on the Perfect Benchmarks programs,”IEEE Trans.Parallel and Distributed Systems, vol.3, no.6, Nov.1992: 643-656
[225] U.Banerjee“Dependence analysis for supercomputing.”Norwell.Mass.Kluwer Academic Publishers 1988
[226] M.Wolfe, U.Banerjee.“Data dependence and its application to parallel processing.”International Journal of Parallel Programming. 1987.4
[227] J.M. Anderson, M.S. Lam.“Global Optimizations for Parallelism and Locality on Scalable Parallel Machines.”Proc. ACMSIGPLAN PLDI, Albuquerque, N.M., June 1993: pp112-125
[228] M. Mace. Memory Storage Patterns in Parallel Processing. Boston. Kluwer Academic, 1987
[229] U. Kremer. "NP-Completeness of Dynamic Remapping.“Proc. Fourth Workshop Compilers for Parallel Computers, Delft, the Netherlands, Dec.1993
[230] J. Li, M. Chen.“The Data Alignment Phase in Compiling Programs for Distributed-Memory Machines.”Parallel and Distributed Computing, vol.13, 1991: pp213-221
[231] Ramanujam J. and Sadayappan P. Tiling Multidimensional iteration spaces for multicomputers. Journal of parallel and distributed computing 16 , 1992: 108-120
[232] Anderson J. Automatic Computation and Data Decomposition for Multiprocessors. Ph. D. thesis, Dept. of EE and CS, Standford Univ. Stanford, CA
[233] Xue J. Communication-minimal tiling of uniform dependence loops. Journal of Parallel and Distributed Computing 42,, 1997: 42-59
[234] Chen T. and Sheu J. Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Trans. Parallel Distributed Syst. 5, 9. 1994: 924-938
[235] Huang C. and Sadayappan. Communication-free hyper plane partitioning of nested loops. Journal of Parallel and Distributed Computing 19. 1993: 90-102
[236] Ning Q., Dongen V. and Gao. Automatic data and computation decomposition for distributed memory machines. Parallel Processing Letters 5, 1995: 539-550