A data scheduling algorithm for autonomous distributed real-time applications in grid computing

Eltayeb M., DOĞAN A., Özgüner F.

Proceedings - 2004 International Conference on Parallel Processing, ICPP 2004, Montreal, Canada, 15 - 18 August 2004, pp.388-395 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/icpp.2004.1327947
  • City: Montreal
  • Country: Canada
  • Page Numbers: pp.388-395
  • Anadolu University Affiliated: Yes


Large-scale data intensive applications with real-time requirements are currently emerging in many disciplines of science and engineering. Such applications can benefit from a Grid environment provided that an efficient solution to the following data scheduling problem can be found: Schedule the transfer of a set of large-scale data objects of distributed applications in a Grid environment so as to meet real-time constraints associated with these data transfers. Based on this premise, this paper focuses on the aforementioned problem and proposes a new effective path-selection based scheduling algorithm. The algorithm performs its optimization based on a schedule reflection model; a new cost criterion that takes into account the satisfiability of each application as a whole. We show, by simulation, that our algorithm improves the performance of data intensive real-time applications.