By Topic

A queueing analysis of a symmetric multiprocessor with shared memories and buses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kriz, J. ; Brown Boveri Corp., Research Centre, Baden, Switzerland

The performance of a symmetric multiprocessor system on the level of memory requests is studied. The multiprocessor consists of a number of identical processors, each having its local private memory and each being connected via a system of identical buses to all global memory modules. The system is modelled by a Markovian queueing network and solved approximately by a hierarchical decomposition technique. A closed-form solution for the steady-state probabilities is presented and its numerical properties are discussed. Formulas for computing various performance measures are included. Simple lower and upper bounds for the throughput are derived which converge to the exact value as the number of processors increases.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:130 ,  Issue: 3 )