Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPerformance Evaluation, Volume 4
Volume 4, Number 1, February 1984
- Jiri Kriz:
Throughput bounds for closed queueing networks. 1-10 - P. M. Gopal, Johnny W. Wong, Jayanti C. Majithia:
Analysis of playout strategies for voice transmission using packet switching techniques. 11-18 - Lawrence W. Dowdy, Karen D. Gordon:
Algorithms for nonintegral degrees of multiprogramming in closed queuing networks. 19-29 - Oscar Bronshtein, Ilya B. Gertsbakh
:
An open exponential queuing network with limited waiting spaces and losses: A method of approximate analysis. 31-43 - Hideaki Takagi:
Book review: G. Louchard and G. Latouche (editors), Probability Theory and Computer Science, Academic Press, New York, 1983. 71-72
Volume 4, Number 2, May 1984
- Hisashi Kobayashi:
Editorial. 79 - Raymond H. Kwong, Alberto Leon-Garcia:
Performance analysis of an integrated hybrid-switched multiplex structure. 81-91 - Philippe Nain:
Interdeparture times from a queuing system with preemptive resume priority. 93-98 - John Zahorjan:
The distribution of network states during residence times in product form queueing networks. 99-104 - Kwai-Ting Lan, Dennis G. Kafura:
Strategy independent program restructuring using the critical reference principle. 105-115 - Jehan-François Pâris, Domenico Ferrari:
An analytical study of strategy-oriented restructuring algorithms. 117-132
Volume 4, Number 3, August 1984
- Nachum Shacham:
Throughput-delay performance of packet-switching multiple-access channel with power capture. 153-170 - M. Booyens, Pieter S. Kritzinger:
SNAPL/1: A language to describe and evaluate queuing network models. 171-181 - Joseph S. Kaufman:
Approximation methods for networks of queues with priorities. 183-198 - C. Murray Woodside:
Response time sensitivity measurement for computer systems and general closed queuing networks. 199-210 - John Zahorjan, Edward D. Lazowska:
Incorporating load dependent servers in approximate mean value analysis. 219 - Domenico Ferrari, Tzong-yu Paul Lee:
Modeling file system organizations in a local area network environment. 219 - Michael Stonebraker, John Woodfill, Jeff Ranstrom, Joseph Kalash, Kenneth Arnold, Erika Andersen:
Performance analysis of distributed data base systems. 220 - Anna Hac:
On the modeling of shared resources by queueing networks with serialization delays. 220 - Douglas B. Terry:
An analysis of naming conventions for distributed computer systems. 221 - G. Haring:
Book review: D. Ferrari, G. Serazzi and A. Zeigner: Measurement and Tuning of Computer Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1983, 523 pages, $50.65. 223-224
Volume 4, Number 4, November 1984
- Erik A. van Doorn:
On the Overflow Process from a Finite Markovian Queue. 233-240 - Steven C. Bruell, Gianfranco Balbo, P. V. Afshari:
Mean value analysis of mixed, multiple class BCMP networks with load dependent service stations. 241-260 - Janina Mincer-Daszkiewicz, Zbigniew Weiss:
An approach to program I/O reference behavior modeling. 261-273 - Derek L. Eager, Kenneth C. Sevcik:
An analysis of an approximation algorithm for queueing networks. 275-284 - Tak-Shing P. Yum, C. Dou:
Buffer allocation strategies with blocking requirements. 285-295
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
