Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids
Keywords:
Data scheduling, data grids, real-time systems, simulation, performance evaluationAbstract
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 % as compared to a very competitive single path data dissemination algorithm is possible.Downloads
Download data is not yet available.
Downloads
Published
2015-10-19
How to Cite
Atanak, M. M., & Doğan, A. (2015). Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids. Computing and Informatics, 34(2), 402–424. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/1787
Issue
Section
Articles