Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy

Yi-Bing Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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).

Original languageEnglish
Pages (from-to)197-201
Number of pages5
JournalInformation Processing Letters
Volume47
Issue number4
DOIs
StatePublished - 27 Sep 1993

Keywords

  • Analysis of algorithms
  • parallel algorithms

Fingerprint

Dive into the research topics of 'Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy'. Together they form a unique fingerprint.

Cite this