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.
Publié le : 2015-10-19
Classification:  Parallel and Distributed Computing; Computer Architectures and Networking,  Data scheduling, data grids, real-time systems, simulation, performance evaluation,  68M14; 68M20; 68U20
@article{cai1787,
     author = {Mustafa M\"ujdat Atanak; Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskisehir and Atakan Do\u gan; Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskisehir},
     title = {Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids},
     journal = {Computing and Informatics},
     volume = {33},
     number = {3},
     year = {2015},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai1787}
}
Mustafa Müjdat Atanak; Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskisehir; Atakan Doğan; Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskisehir. Improving Real-Time Data Dissemination Performance by Multi Path Data Scheduling in Data Grids. Computing and Informatics, Tome 33 (2015) no. 3, . http://gdmltest.u-ga.fr/item/cai1787/