Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing

Doʇan A., Özgüner F.

International Conference on Parallel Processing, ICPP 2000, Toronto, Kanada, 21 - 24 Ağustos 2000, cilt.2000-January, ss.307-314 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2000-January
  • Doi Numarası: 10.1109/icpp.2000.876146
  • Basıldığı Şehir: Toronto
  • Basıldığı Ülke: Kanada
  • Sayfa Sayıları: ss.307-314
  • Anahtar Kelimeler: Computer applications, Computer networks, Cost function, Distributed computing, High performance computing, High-speed networks, Network topology, Processor scheduling, Scheduling algorithm, Telecommunication network reliability
  • Anadolu Üniversitesi Adresli: Hayır

Özet

© 2000 IEEE.In this paper, two cost functions that can be incorporated into a matching and scheduling algorithm for tasks with precedence constraints are introduced to enable the algorithm to consider the reliability of different resources in the system while making decisions. The cost functions introduced are unique in the sense that they are not restricted to tree-based networks and a specific matching and scheduling algorithm. As an example, cost functions are applied to a compile time, static list scheduling heuristic. The simulation results confirm that the proposed cost functions can be exploited to produce task assignments where the effect of failures of machines and network resources on the execution of the application is reduced.