EXECUTION TIME MODELING WITH SINGLE NODE GATHER PROBLEM ON TRANSPUTERS

UNAL E., GURAN H.

INTERNATIONAL JOURNAL OF ELECTRONICS, cilt.76, sa.1, ss.1-13, 1994 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 76 Sayı: 1
  • Basım Tarihi: 1994
  • Doi Numarası: 10.1080/00207219408925901
  • Dergi Adı: INTERNATIONAL JOURNAL OF ELECTRONICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1-13
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

A methodology is presented for estimating the total execution time of loosely coupled parallel processing applications. The single node gather problem is considered as the communication primitive. The derived model is verified and illustrated on an image processing application with a network of transputers connected as a ternary tree. The expected execution times obtained by the model are validated experimentally and the model is then used to estimate the performance of the system with larger transputer networks.