By Topic

Analysis of Multiprocessor Control Organizations with Partial Program Memory Replication

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 $13
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)
Covo, A.A. ; Electronic Systems Group, Communications Systems Division, GTE Sylvania, Inc.

In certain real-time multiprocessor controllers the program memory must be at least partly replicated to reduce queuing delays and meet throughput requirements. In these organizations the program memory is a common pool consisting of K sections servicing m CPU's. The jth section is of size Xi and is replicated ni times (ni ≤ m); j = 1,...-, K. Dynamic programming is used to find optimal values of the number of replications ni relative to given fixed values of m, K, and Xi. This solution satisfies throughput requirements at minimum cost, relative to the given m, K, and Xi. The process is repeated for several values of the last three parameters, using a systematic search procedure described herein, until reaching the first local minimum. This usually provides a satisfactory suboptimal solution. Partial replication (n, ≤ m) is economically attractive in a wide class of real-time control systems in which the CPU's access a relatively small portion of the program store most of the time. Quantitative examples indicate that partial replication may cause 30 to 40 percent cost reduction compared to full replication.

Published in:

Computers, IEEE Transactions on  (Volume:C-23 ,  Issue: 2 )