e-journal

A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks

---

Deadlock remains a central problem in interconnection network. In this paper, we establish a new theory of deadlock-free flow control for k-ary, n-cube mesh network, which enables the use of any minimal-path adaptive routing algorithms while avoiding deadlock. We prove that the proposed flow control algorithm is a sufficient condition for deadlock freedom in any minimal path, adaptive routing algorithms on k-ary, n-cube mesh network.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

COMPUTER ARCHITECTURE

No. Panggil

-

Penerbit

Sweden : IEEE Computer Architecture Letters., 2015

Deskripsi Fisik

IEEE COMPUTER ARCHITECTURE LETTERS, VOL. 14, NO. 2, JULY-DECEMBER 2015

Bahasa

English

ISBN/ISSN

Digital Object Ident

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

VOL. 14, NO. 2, JULY-DECEMBER 2015

Subjek

ARSITEKTUR KOMPUTER

Info Detail Spesifik

-

Pernyataan Tanggungjawab

deliza

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar