Analytical models of bandwidth allocation in pipelined k-ary n-cubes

Author

Gaughan, Patrick T. ; Yalamanchili, Sudhakar

Author_Institution

Comput. Syst. Res. Lab., Georgia Inst. of Technol., Atlanta, GA, USA

fYear

1993

fDate

13-16 Apr 1993

Firstpage

395

Lastpage

400

Abstract

This paper extends existing work in virtual-channel flow control mechanisms by focusing on the bandwidth allocation issues. It presents an analytical model of the network that captures key phenomena of bandwidth allocation mechanisms in k-ary n-cubes. Tradeoffs are examined between full-duplex vs half-duplex links, purely demand-driven bandwidth allocation vs demand-driven allocation with CTS lookahead, and virtual to physical link assignment with link load balancing

Keywords

communication complexity; hypercube networks; CTS lookahead; analytical models; bandwidth allocation; demand-driven bandwidth allocation; full-duplex; half-duplex; physical link assignment; pipelined k-ary n-cubes; virtual-channel flow control mechanisms; Analytical models; Bandwidth; Channel allocation; Circuits; Delay; Laboratories; Personal communication networks; Pipeline processing; Routing; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Conference_Location

Newport, CA

Print_ISBN

0-8186-3442-1

Type

conf

DOI

10.1109/IPPS.1993.262915

Filename

262915

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3487438