Comparative performance of interleaved and non-interleaved pipelining in ATM terminal adapters

In this paper we compare the end-to-end delay performance of two service disciplines that an Asynchronous Transfer Mode (ATM) multiplexor can use to multiplex pipelined synchronous native protocol frames arriving over low speed access lines onto higher speed ATM trunks. The ATM multiplexor must convert native protocol frames on the access lines (typically hundreds of bytes in length) into ATM cells on the trunks (of fixed length 53 bytes) at the network access and the corresponding ATM (de)multiplexor must reassemble these multiple ATM cells into a bit continuous synchronous native protocol frame at the network egress. In one service discipline, the multiplexor (hereafter referred to as a terminal adaptor, or TA) pipelines one synchronous frame at a time onto the high speed trunk, waiting, if it needs to, for the successive ATM cells from this one synchronous frame to accumulate. This scheme introduces a larger queueing delay at the ingress TA but no playout delay is required at the egress TA. In the other scheme the TA interleaves the ATM cells from the various synchronous frames arriving concurrently over the low speed lines. An interleaving scheme has a smaller queueing delay, but introduces a large variability in the network insertion times of the ATM cells corresponding to a native protocol frame. Hence the egress TA must enforce a delay before playing out the original bit-synchronous native frame over a low speed line, so as to increase the probability that the ATM cells are available when required to properly reassemble the native synchronous frame into a bit continuous stream. Using an analytical model for the first scheme and a simulation model for the second scheme we analyze the end-to-end delay of a synchronous frame, and compare the mean end-to-end delay for various trunk speeds (TA-to-network switch) to "access" line speed ratios. We conclude that, for the cases studied in this paper, if this ratio is greater than or equal to 4 then, over the range of useful loading, interleaved pipelining typically yields smaller mean delays than noninterleaved pipelining. If the ratio is less than 4 then interleaving typically yields larger mean delays for native protocols due to increased playout delays at the egress TA

The Third NASA Goddard Conference on Mass Storage Systems and Technologies

This report contains copies of nearly all of the technical papers and viewgraphs presented at the Goddard Conference on Mass Storage Systems and Technologies held in October 1993. The conference served as an informational exchange forum for topics primarily relating to the ingestion and management of massive amounts of data and the attendant problems involved. Discussion topics include the necessary use of computers in the solution of today's infinitely complex problems, the need for greatly increased storage densities in both optical and magnetic recording media, currently popular storage media and magnetic media storage risk factors, data archiving standards including a talk on the current status of the IEEE Storage Systems Reference Model (RM). Additional topics addressed System performance, data storage system concepts, communications technologies, data distribution systems, data compression, and error detection and correction

Software for Exascale Computing - SPPEXA 2016-2019

This open access book summarizes the research done and results obtained in the second funding phase of the Priority Program 1648 "Software for Exascale Computing" (SPPEXA) of the German Research Foundation (DFG) presented at the SPPEXA Symposium in Dresden during October 21-23, 2019. In that respect, it both represents a continuation of Vol. 113 in Springer’s series Lecture Notes in Computational Science and Engineering, the corresponding report of SPPEXA’s first funding phase, and provides an overview of SPPEXA’s contributions towards exascale computing in today's sumpercomputer technology. The individual chapters address one or more of the research directions (1) computational algorithms, (2) system software, (3) application software, (4) data management and exploration, (5) programming, and (6) software tools. The book has an interdisciplinary appeal: scholars from computational sub-fields in computer science, mathematics, physics, or engineering will find it of particular interest