Skip Navigation

The Computer Journal 1996 39(4):346-352; doi:10.1093/comjnl/39.4.346
© 1996 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wang, H.-J.
Right arrow Articles by Li, J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bandwidth Analysis for A Class of Bus-Based Systems

H.-J. Wang1 and J. Li2 *

1 Department of Computer Science and Engineering, NanJing University of Science and Technology, NanJing 210094; China, 2 SiWei Computer Corporation, No. 448 ZhuJiang Road, NanJing 210018, China

Bus-based systems are very attractive because they are simple and easy to use. This paper addresses the performance analysis of (N x N x B) prioritized bus-based multiprocessor systems. The interconnection networks considered include the complete multiple bus networks, the partial multiple bus networks and the partial multiple bus networks with K classes. The effective memory bandwidth is chosen as the performance measure. The proposed analytical models are derived under the assumption that a processor has a favourite memory module. The simulation experiments are performed. It can be shown that the results from theory models are very close to those from simulations.


Received September 20, 1994. revised April 20, 1996.

* SiWei Computer Corporation, No. 448 ZhuJiang Road, NanJing 210018, P.R. China

§ Department of Computer Science and Engineering, NanJing University of Science and Technology, NanJing 210094; P.R. China


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.