TY - JOUR
T1 - Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy
AU - Lin, Yi-Bing
PY - 1993/9/27
Y1 - 1993/9/27
N2 - We proposed an approximate parallel simulation for packet loss of packet-switched multiplexer with priority scheduling policy. The speedup of the algorithm over the sequential simulation is O(N), where N is the number of processors. For packets with priority level m, the number Lm of lost packets computed in the algorithm is bounded by the exact number Lm
E within 2(N-1) packets. That is, |Lm-Lm
E| ≤2(N-1).
AB - We proposed an approximate parallel simulation for packet loss of packet-switched multiplexer with priority scheduling policy. The speedup of the algorithm over the sequential simulation is O(N), where N is the number of processors. For packets with priority level m, the number Lm of lost packets computed in the algorithm is bounded by the exact number Lm
E within 2(N-1) packets. That is, |Lm-Lm
E| ≤2(N-1).
KW - Analysis of algorithms
KW - parallel algorithms
UR - http://www.scopus.com/inward/record.url?scp=0027668060&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(93)90032-5
DO - 10.1016/0020-0190(93)90032-5
M3 - Article
AN - SCOPUS:0027668060
SN - 0020-0190
VL - 47
SP - 197
EP - 201
JO - Information Processing Letters
JF - Information Processing Letters
IS - 4
ER -