๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues

โœ Scribed by Maggs, Bruce M.; Sitaraman, Ramesh K.


Book ID
118178207
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
378 KB
Volume
28
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Throughput bounding and simple approxima
โœ Chun-Hyun Paik ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

Exponential fork/join queueing networks (FJQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing systems. In this study, we fast suggest the throughput upper and lower bounds. Our upper-bounding method is elaborated on with general network configura