期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种并行的网格资源协同分配方法 被引量：2

A parallel method of resources co-allocation in grid system
在线阅读 下载PDF
导出
摘要 针对网格系统中资源协同分配的实时性问题,分析了现有的基于有向无环图的资源映射方法,提出了一种并行资源协同分配算法.该算法采用有向无环图表示每个应用,然后,将所得到的这些图合并成一个有向无环图并对其进行分层,最后,对每层中应用任务的资源分配问题并行处理.分析表明,该并行资源协同分配算法降低了系统中资源调度时间,提高了资源分配的效率,从而能够满足系统实时性要求. Based on the available resources mapping methods using the directed acyclic graph, a new parallel resources co-allocation algorithm was proposed to solve the real-time problem of the resources co-allocation in the grid. In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs representing applications are combined into one united directed acyclic graph. In succession, the united graph is partitioned into several levels, and the resources co-allocation problems in different levels are processed simultaneously. Analyses show that the parallel algorithm reduces the scheduling time of the resources allocation and improves the efficiency of resources co-allocation, and thus can satisfy the real-time requirements of the grid system.
作者 李慧贤 程春田
机构地区 大连理工大学土木水利学院水利工程信息研究所
出处 《大连理工大学学报》 EI CAS CSCD 北大核心 2005年第2期272-277,共6页 Journal of Dalian University of Technology
基金 国家自然科学基金资助项目(50479055).
关键词 协同 分配方法 网格资源 有向无环图 资源分配问题 分配算法 网格系统 映射方法 并行处理 资源调度 实时性 图表示 分析表 应用 grid parallel resource co-allocation directed acyclic graph
分类号 TP393.4 [自动化与计算机技术—计算机应用技术] TH122 [机械工程—机械设计及理论]
  • 相关文献

参考文献13

  • 1丁箐,陈国良,顾钧.计算网格环境下一个统一的资源映射策略[J].软件学报,2002,13(7):1303-1308. 被引量：60
  • 2WANG L Z, CAI W T, LEE BS, et al. Resource co-allocation for parallel tasks in computational grids[A]. Proceedings of the International Workshop on Challenges of Large Applications in Distributed Environments [C]. Seattle: IEEE Computer Society, 2003. 88-95.
  • 3BRUNETT S, DAVIS D, GOTTSCHALK T, et al. Implementing distributed synthetic forces simulations in metacomputing [A]. 7th IEEE Symposium on Heterogeneous Computing Workshop(HCW'98) [C]. Orlando: IEEE Computer Society, 1998. 29-42.
  • 4CZAJKOWSKI K, FOSTER I, KESSELMAN C.Resource co-allocation in computational grids [A].7th IEEE Symposium on High Performance Distributed Computing [C]. Redondo Beach: IEEE Computer Society, 1999. 219-228.
  • 5FOSTER I, KESSELMAN C, LEE C, et al. A distributed resource management architecture that support advance reservations and co-allocation[A]. International Workshop on Quality of Service[C]. London: IEEE Communications Society,1999. 27-36.
  • 6CHRISTOFIDES N. Graph Theory:an Algorithmic Approach[M]. London: Academic Press, 1975.
  • 7FOSTER I, KESSELMAN C, TUECKE S. The anatomy of the grid: enabling scalable virtual organizations [J]. lnt J of High Performance Comput Appl, 2001, 15(3):200-222.
  • 8BRAUN T, SIEGEL H J, BECK N, et al. A taxonomy for describing matching and scheduling heuristics for mixed-machines heterogeneous computing systems [A]. 17th IEEE Symposium on Reliable Distributed Systems [C]. West Lafayette.IEEE Computer Society, 1998. 330-335.
  • 9MAHESWARAN M, SIEGEL H J. A dynamic matching and scheduling algorithm for heterogeneous computing systems [A]. 7th IEEE Symposium on Heterogeneous Computing Workshop(HCW'98) [C]. Orlando: IEEE Computer Society,1998. 57-69.
  • 10IVERSON M, OZGUNER F. Dynamic competitive scheduling of multiple DAGs in a distributed heterogeneous environment [A]. 7th IEEE Symposium on Heterogeneous Computing Workshop (HCW' 98) [C]. Orlando: IEEE Computer Society,1998. 70-78.

二级参考文献14

  • 1[1]Foster, I., Kesselman, C. The Grid, Blueprint for a New Computing Infrastructure. San Francisco: Morgan Kaufmann Publishers Inc., 1998. 279～309.
  • 2[2]Czajkowski, K., Foster, I. A resource management architecture for metacomputing systems. In: Feitelson, D.G., Rudolph, L., eds. Proceedings of the 4th Workshop on Job Scheduling Strategies for Parallel Processing. LNCS 1459, Orlando: Springer-Verlag, 1998. 62～82.
  • 3[3]Sekiguchi, S., Sato, M. Ninf: network based information library for globally high performance computing. In: Proceedings of the Parallel Object-Oriented Methods and Applications (POOMA). 1996. 39～48. http://www.acl.lanl.gov/Pooma96/.
  • 4[4]Freund, R., Gherrity, M. Scheduling resources in multi-user, heterogeneous computing environments with Smarnet. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98), IEEE Computer Society Press, 1998. 184～199. http://dlib.computer. org/ conferen/ hcw/8365/pdf/83650003.pdf.
  • 5[5]Iverson, M., Ozguner, F. Dynamic, competitive scheduling of multiple DAGs in a distributed heterogeneous environment. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98). IEEE Computer Society Press, 1998. 70～78. http://dlib. computer. org/ conferen/hcw/8365/pdf/83650070.pdf.
  • 6[6]Wang, L., Siegel, H.J., Roychowdhury, V.P., et al. Task matching and scheduling in heterogeneous computing environments using a genetic algorithm based approach. Journal of Parallel and Distributed Computing, 1997,47(1):8～22.
  • 7[7]Foster, I., Roy, A., Winkler, L. A quality of service architecture that combines resource reservation and application adaptation. In: Proceedings of the 8th International Workshop on Quality of Service (IWQOS 2000). 2000. 181～188. http://www.globus.org/ documentation/ incoming/iwqos_adapt1.pdf.
  • 8[8]Armstrong, R., Hensgen, D., Kidd, T. The relative performance of various mapping algorithm is independent of sizable variance in run-time predictions. In: Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98). IEEE Computer Society Press, 1998. 79～87. http://dlib.computer.org/conferen/hcw/8365/pdf/83650079.pdf.
  • 9[9]Braun, T.D., Siegel, H.J., Beck, N., et al. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proceedings of the 8th IEEE Heterogeneous Computing Workshop (HCW'99). IEEE Computer Society Press, 1999. 15～29. http://dlib.computer.org/conferen/hcw/0107/pdf/01070015.pdf.
  • 10[10]Maheswaran, M., Ali, S., Siegel, H.J., et al. Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proceedings of the 8th IEEE Heterogeneous Computing Workshop (HCW'99). IEEE Computer Society Press, 1999. 30～44. http://dlib.computer.org/conferen/hcw/0107/pdf/01070030.pdf.

共引文献59

同被引文献27

  • 1计明军,靳志宏.集装箱码头集卡与岸桥协调调度优化[J].复旦学报（自然科学版）,2007,46(4):476-480. 被引量：47
  • 2陈璐,奚立峰,蔡建国,Nathalie Bostel,Pierre Dejax.一种求解带有阻塞限制的混合流水车间的禁忌搜索算法[J].上海交通大学学报,2006,40(5):856-859. 被引量：11
  • 3张海霖,江志斌,许泓.集装箱港口集疏运调度系统作业模式的仿真分析[J].上海交通大学学报,2006,40(6):1024-1030. 被引量：14
  • 4Wang Lizhe,Cai Wentong,Lee Busung.Resource co-allocation for parallel tasks in computational grids[c]//Proceedings of the International Workshop on Challenges of Large Applications in Distrib uted Environment(CLADE'03),21 June 2003:88-95.
  • 5Li Jiadao,Yahyapour R.Negotiation model supporting co-allocation for grid scheduling[C]//Grid Computing Conference 2006:254-281.
  • 6Decker J,Schneider J.Heuristic scheduling of grid workflows supporting CO-Allocation and advance reservation[C]//Seventh IEEE International Symposium on Cluster Computing and the Grid(CCGrid'07),14-17,May,2007,:335-342.
  • 7Pugliese A,Talia D,Yahyapour R.Modeling and supporting grid scheduling[J].J Grid Computing,2008(6):195-213.
  • 8Günther H O.Kim K H.Container terminals and terminal operations[J].OR Spectrum,2006,(28):437-445.
  • 9Bierwirth C,Meisel F.A survey of berth allocation and quay crane scheduling problems in container terminals[J].European Journal of Operational Research,2010(202):615-627.
  • 10Giallombardo G,Moccia L,Salani M.Modeling and solving the tactical berth allocation problem[J].Transportation Research Part B,2010(44):232-245.

引证文献2

二级引证文献2

大连理工大学学报
2005年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部