ملخص
Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 153-168 |
عدد الصفحات | 16 |
دورية | Parallel Processing Letters |
مستوى الصوت | 15 |
رقم الإصدار | 1-2 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - مارس 2005 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1708???