A comparison of centralized and distributed meta-scheduling architectures for computation and communication tasks in Grid networks

被引:21
作者
Christodoulopoulos, K. [1 ,2 ]
Sourlas, V. [3 ]
Mpakolas, I. [1 ,2 ]
Varvarigos, E. [1 ,2 ]
机构
[1] Univ Patras, Comp Engn & Informat Dept, GR-26110 Patras, Greece
[2] Res Acad Comp Technol Inst, Patras, Greece
[3] Univ Thessaly, Dept Comp & Commun Engn, Volos, Greece
关键词
Grid networks; Centralized vs. distributed architecture; Task scheduling; Routing and data scheduling; Online algorithms; BURST; PROTOCOL;
D O I
10.1016/j.comcom.2009.03.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The management of Grid resources requires scheduling of both computation and communication tasks at various levels. In this study, we consider the two constituent sub-problems of Grid scheduling, namely: (i) the scheduling of computation tasks to processing resources and (ii) the routing and scheduling of the data movement in a Grid network. Regarding computation tasks, we examine two typical online task scheduling algorithms that employ advance reservations and perform full network simulation experiments to measure their performance when implemented in a centralized or distributed manner. Similarly, for communication tasks, we compare two routing and data scheduling algorithms that are implemented in a centralized or a distributed manner. We examine the effect network propagation delay has on the performance of these algorithms. Our simulation results indicate that a distributed architecture with an exhaustive resource utilization update strategy yields better average end-to-end delay performance than a centralized architecture. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1172 / 1184
页数:13
相关论文
共 28 条
  • [1] [Anonymous], SPRINGER J GRID COMP
  • [2] A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
    Braun, TD
    Siegel, HJ
    Beck, N
    Bölöni, LL
    Maheswaran, M
    Reuther, AI
    Robertson, JP
    Theys, MD
    Yao, B
    Hensgen, D
    Freund, RF
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (06) : 810 - 837
  • [3] Economic models for resource management and scheduling in Grid computing
    Buyya, R
    Abramson, D
    Giddy, J
    Stockinger, H
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2002, 14 (13-15) : 1507 - 1542
  • [4] CAI J, 2001, CENTRALIZED VS DISTR
  • [5] CARDINALE Y, 2006, HIGH PERF COMP SIM C
  • [6] Optical burst switching: A new area in optical networking research
    Chen, Y
    Qiao, CM
    Yu, X
    [J]. IEEE NETWORK, 2004, 18 (03): : 16 - 23
  • [7] COUTELEN T, EFFICIENT ADAPTIVE O
  • [8] Analysis of a dynamically wavelength-routed optical burst switched network architecture
    Düser, M
    Bayvel, P
    [J]. JOURNAL OF LIGHTWAVE TECHNOLOGY, 2002, 20 (04) : 574 - 585
  • [9] ELMROTH E, 2008, FUTURE GENERATION CO, V24
  • [10] Foster I., 1998, GRID BLUEPRINT NEW C