Showing papers on "Server published in 1971"
TL;DR: In this paper, the first two moments of the input were used to obtain bounds on the expected wait in an A/G/k queue with stationary input, in terms of the expected delay in the queue length.
Abstract: This paper obtains bounds, in terms of the first two moments of the input, on the expected wait in an A/G/k queue with stationary input. To this end, two single-server systems are constructed. The wait in queue for the first single-server system is stochastically larger than the wait in the given multiserver system, and the expected wait in the second single-server system is used to obtain a lower bound on the expected wait in the A/G/k system. The paper also develops, as a consequence of the lower bounds, some results concerning the optimum number of servers, given a fixed work capacity.
93 citations
TL;DR: It is proved that marginal allocation is an optimal and easily implemented solution technique and suggested that it is also optimal for exponential service times.
Abstract: In this note we consider the allocation of servers to a multiple facility service system. Each facility consists of a number of parallel channels and the arrival processes are Poisson. When service times are constant we prove that marginal allocation is an optimal and easily implemented solution technique and suggest that it is also optimal for exponential service times.
60 citations
TL;DR: This heterogeneous system is compared to the corresponding homogeneous system, and conditions showing its efficiency are obtained, and the problem of obtaining the best service rates is investigated numerically.
Abstract: In this article a Markovian queueing system with three heterogeneous servers is considered. The system is such that the first server works faster than the second, and the second works faster than the third. This heterogeneous system is compared to the corresponding homogeneous system, and conditions showing its efficiency are obtained. The problem of obtaining the best service rates, which minimize the average characteristics of the heterogeneous system, is investigated numerically. Tables representing the sequences of the best service rates, and the average characteristics of both the heterogeneous and the homogeneous systems are given.
17 citations
01 Oct 1971
TL;DR: This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.
Abstract: (c) 1971 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
11 citations
01 Oct 1971
TL;DR: A generalised approach is presented for the study of a computer-controlled queuing system with general input, ‘first-come-first-served’ queue discipline and multiple servers with feedback for either exponential servers or constant service times.
Abstract: A generalised approach is presented for the study of a computer-controlled queuing system with general input, ‘first-come-first-served’ queue discipline and multiple servers with feedback for either exponential servers or constant service times. Two generating functions for the state probabilities of the system corresponding to the two different types of service times are derived. Further, necessary and sufficient conditions for the existence of statistical equilibrium of the computer-controlled queuing system are obtained from the generating functions. The results obtained here generalise many results previously obtained by other workers.
7 citations
01 Jan 1971
TL;DR: It is frequently desirable to design stochastic service systems which cannot be adequately analyzed by normal queueing theoretic models, which are often realistic representations of behavior in diverse fields such as plant management, telephone switching, air traffic control, electronic warfare, logistics, and computer system specification and control.
Abstract: It is frequently desirable to design stochastic service systems which cannot be adequately analyzed by normal queueing theoretic models. Such systems consist, in the most usual instances, of numerous waiting lines (or “queues”), servers, and controlling or directing stations which determine the discipline of task flow through the system. These systems are often realistic representations, for high-traffic design purposes, of behavior in diverse fields such as plant management, telephone switching, air traffic control, electronic warfare, logistics, and computer system specification and control.
7 citations
01 Mar 1971
TL;DR: A convention must be established so that all 128 ASCII codes can be keyed from a 2741 terminal, which requires that one character be chosen as an escape character which can be converted into any desired ASCII code.
Abstract: Disclaimer This material has not been reviewed for public release and is intended only for use with the ARPA network. It should not be quoted or cited in any publication not related to the ARPA network. An IBM terminal can be used to key in 92 different codes. These include 88 graphics plus the 4 controls SP, BS, HT, and NL. Each of these have defined ASCII codes except the cent graphic ([1]) and the New Line Control (NL). When the NL character is keyed, the program receiving the keyboard input can translate this signal into the appropriate line end signal for the host which is being used. That is, to a NL, CR, or LF code whichever is appropriate. There are 7 other ASCII graphic characters ({, }, [, ], ^, \, ') and 31 other ASCII controls which cannot be keyed on a 2741 terminal. A convention must be established so that all 128 ASCII codes can be keyed from a 2741 terminal. This requires that one character be chosen as an escape (or prefix) character which,a together with following characters, can be converted into any desired ASCII code. In addition to this escape character, there are three other functions which are usually indicated by the typing of a single character key. These are: a) character delete-to cause this character and the preceding character in the input line to be deleted. b) line delete-to cause this character and all previous characters in the current input line to be deleted. c) logical line end-to cause all characters keyed after the last logical line end character or last NL character up to this character to be considered as one logical line with this character being treated as if the NL key were entered. Characters following the logical line end character up to another logical line end character or a NL character are used for form another input line. Winett [Page 1]
1 citations