The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper provides a methodology to decompose a complex network, containing primarily deterministic traffic, into isolated ΣD<sub><it>i</it></sub>/D/1 queuing models. We then present a new technique, Successive Superposition, to analyze the resulting models. In a ΣD<sub><it>i</it></sub>/D/1 queuing system, multiple streams of different bit rate, but constant length packets, arrive at a single high-speed multiplexer. Because of its application to Asynchronous Transfer Mode (ATM) switching nodes, previous ΣD<sub><it>i</it></sub>/D/1 analyses have assumed that stream arrivals are randomly staggered, and packets are served on a first-come-first-served basis. This work was, however, inspired primarily by the need for the accurate assessment of interprocessor communication costs in compile-time multiprocessor scheduling applications. For these applications, streams typically have known arrival times and must often be prioritized. This paper applies primarily to the class of digital signal processing and other applications which can be represented by directed, acyclic precedence graphs. The analysis presented in this paper provides an exact characterization of the traffic, including service start times, queue sizes, and system departure times. We confirm the validity of our approach against simulation results. Finally, we demonstrate the utility of this work in a compile-time multiprocessor scheduling application</p>
Asynchronous transfer mode, interprocessor communication, multiprocessor scheduling, packet multiplexing, packet queuing networks, rate monotonic scheduling algorithm, signal flow graphs.
Dan Picker, Ronald D. Fellman, "Successive Superposition: A Technique for the Exact Modeling of Deterministic Packet Queuing Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 1106-1120, October 1996, doi:10.1109/71.539741
175 ms
(Ver 3.3 (11022016))