1function [XN,UN,QN,RN,TN,CN,tranSysState,tranSync,sn]=solver_ssa_analyzer_serial(sn, init_state, options, isHashed)
2% [XN,UN,QN,RN,TN,CN]=SOLVER_SSA_ANALYZER_SERIAL(SN, OPTIONS)
4M = sn.nstations; %number of stations
5K = sn.nclasses; %number of
classes
7% istSpaceShift = zeros(1,M);
10% istSpaceShift(i) = 0;
12% istSpaceShift(i) = istSpaceShift(i-1) + size(sn.space{i-1},2);
17NK = sn.njobs
'; % initial population per class
33options.samples = options.samples + 1;
34if isfield(options,'config
') && isfield(options.config,'eventcache
')
35 eventCache = EventCache.create(options.config.eventcache, sn);
37 eventCache = EventCache.create(false, sn);
40[probSysState,StateSpaceAggr,arvRates,depRates,tranSysState,tranSync] = solver_ssa(sn, init_state, options, eventCache);
42wset = 1:size(StateSpaceAggr,1);
44 refsf = sn.stationToStateful(sn.refstat(k));
45 XN(k) = probSysState*depRates(wset,refsf,k);
49 isf = sn.stationToStateful(ist);
51 TN(ist,k) = probSysState*depRates(wset,isf,k);
52 QN(ist,k) = probSysState*StateSpaceAggr(wset,(ist-1)*K+k);
55 case SchedStrategy.INF
57 UN(ist,k) = QN(ist,k);
59 case {SchedStrategy.PS, SchedStrategy.DPS, SchedStrategy.GPS, ...
60 SchedStrategy.PSPRIO, SchedStrategy.DPSPRIO, SchedStrategy.GPSPRIO, SchedStrategy.LPS}
61 if isempty(sn.lldscaling) && isempty(sn.cdscaling) && ~sn_has_joint_dependence(sn)
63 if ~isempty(PH{ist}{k})
64 UN(ist,k) = probSysState*arvRates(wset,isf,k)/sn.rates(ist,k)/S(ist);
67 else % lld/cd/ljd cases
68 ind = sn.stationToNode(ist);
72 % [ni,nir] = State.toMarginal(sn, ind, StateSpace(st,(istSpaceShift(i)+1):(istSpaceShift(i)+size(sn.space{i},2))));
75 % UN(i,k) = UN(i,k) + probSysState(st)*nir(k)*sn.schedparam(i,k)/(nir*sn.schedparam(i,:)');
81 if isempty(sn.lldscaling) && isempty(sn.cdscaling) && ~sn_has_joint_dependence(sn)
83 if ~isempty(PH{ist}{k})
84 UN(ist,k) = probSysState*arvRates(wset,isf,k)*map_mean(PH{ist}{k})/S(ist);
87 else % lld/cd/ljd cases
88 ind = sn.stationToNode(ist);
92 % [ni,~,sir] = State.toMarginal(sn, ind, StateSpace(st,(istSpaceShift(i)+1):(istSpaceShift(i)+size(sn.space{i},2))));
95 % UN(i,k) = UN(i,k) + probSysState(st)*sir(k)/S(i);
106 RN(ist,k) = QN(ist,k)./TN(ist,k);
111 CN(k) = NK(k)./XN(k);
115% now update the routing probabilities in
nodes with state-dependent routing
117 for isf=1:sn.nstateful
118 if sn.nodetype(isf) == NodeType.Cache
119 ind = sn.statefulToNode(isf);
120 TNcache(isf,k) = probSysState*depRates(:,isf,k);
125% updates cache actual hit and miss data
127 for isf=1:sn.nstateful
128 if sn.nodetype(isf) == NodeType.Cache
129 ind = sn.statefulToNode(isf);
130 if length(sn.nodeparam{ind}.hitclass)>=k
131 h = sn.nodeparam{ind}.hitclass(k);
132 m = sn.nodeparam{ind}.missclass(k);
134 sn.nodeparam{ind}.actualhitprob(k) = NaN;
135 sn.nodeparam{ind}.actualmissprob(k) = NaN;
137 sn.nodeparam{ind}.actualhitprob(k) = TNcache(isf,h)/sum(TNcache(isf,[h,m]));
138 sn.nodeparam{ind}.actualmissprob(k) = TNcache(isf,m)/sum(TNcache(isf,[h,m]));