Abstract

The performance of data grids for data intensive, real-time applications is highly dependent on the data dissemination algorithm employed in the system. Motivated by this fact, this study first formally defines the real-time splittable data dissemination problem (RTS/DDP) where data transfer requests can be routed over multiple paths to maximize the number of data transfers to be completed before their deadlines. Since RTS/DDP is proved to be NP-hard, four different heuristic algorithms, namely kSP/ESMP, kSP/BSMP, kDP/ESMP, and kDP/BSMP are proposed. The performance of these heuristic algorithms is analyzed through an extensive set of data grid system simulation scenarios. The simulation results reveal that a performance increase up to 8

Keywords

MSC

68M14, 68M20, 68U20

Cite this article

@article{cai-1787,
  author  = {Mustafa Mujdat Atanak and Atakan Dogan},
  title   = {Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids},
  journal = {Computing and Informatics},
  volume  = {34},
  number  = {2},
  pages   = {402--424},
  year    = {2015},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2015/2/improving-real-time-data-dissemination-performance-by-multi-path-data-scheduling-in-data-grids/}
}
Download .bib