Some Mathematical Considerations of Time-Sharing Scheduling Algorithms
Journal of the ACM (JACM)
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
Journal of the ACM (JACM)
Feedback Queueing Models for Time-Shared Systems
Journal of the ACM (JACM)
Numerical Methods for Scientists and Engineers
Numerical Methods for Scientists and Engineers
Fast Fourier Transforms: for fun and profit
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Effects of scheduling on file memory operations
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
A study of multiaccess computer communications
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Modeling, measurement and computer power
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A systematic approach to the design of digital bussing structures
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Packet-switching in a slotted satellite channel
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Random access techniques for data transmission over packet-switched radio channels
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Buffer overflow in a store-and-forward network node
IBM Journal of Research and Development
Hi-index | 0.00 |
In order to reduce the communications costs in time-sharing systems and multicomputer communication systems, multiplexing techniques have been introduced to increase channel utilization. A commonly used technique is Synchronous Time Division Multiplexing (STDM). In Synchronous Time Division Multiplexing, for example, consider the transmission of messages from terminals to computer, each terminal is assigned a fixed time duration. After one user's time duration has elapsed, the channel is switched to another user. With synchronous operation, buffering is limited to one character per user line, and addressing is usually not required. The STDM technique, however, has certain disadvantages. As shown in Figure 1, it is inefficient in capacity and cost to permanently assign a segment of bandwidth that is utilized only for a portion of the time. A more flexible system that efficiently uses the transmission facility on an "instantaneous time-shared" basis could be used instead. The objective would be to switch from one user to another user whenever the one user is idle, and to asynchronously time multiplex the data. With such an arrangement, each user would be granted access to the channel only when he has a message to transmit. This is known as an Asynchronous Time Division Multiplexing System (ATDM). A segment of a typical ATDM data stream is shown in Figure 2. The crucial attributes of such a multiplexing technique are: 1. An address is required for each transmitted message, and 2. Buffering is required to handle the random message arrivals.