Analysis ofMultiprocessor Control Organizations with
A.A. Covo · 1974
In certain real-time multiprocessor controllers the programmemory mustbeatleast partly replicated toreducequeuing delays andmeetthroughput requirements. Intheseorganizations theprogrammemory isa common poolconsisting ofK sections servicing m CPU's.Thejthsection isofsizeXiandisreplicated ni times(n.<i m);j = 1,*.-, K.Dynamic programmingisusedtofind optimal valuesofthenumberofreplications nirelative togiven fixed values ofm,K,andXi. Thissolution satisfies throughput re- quirements atminimum cost, relative tothegiven m, K,andXi. Theprocessisrepeated forseveral values ofthelast three param- eters, using a systematic search procedure described herein, until reaching thefirst local minimum.Thisusually provides a satis- factory suboptimal solution. Partial replication (n,< m)iseconomic- ally- attractive ina wideclass ofreal-time control systems inwhich theCPU'saccessarelatively small portion oftheprogramstore most ofthetime.Quantitative examples indicate thatpartial replication may cause30to40percent costreduction compared tofull repli- cation.