Performance Evaluation, Volume 6

Volume 6, Number 1, 1986

• Teemu Kerola: The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments. 1-9
• Catherine E. Houstis, Mike C. Wescott: Modeling and Analysis of a Communication Switching Processor. 11-19
• Maria Calzarossa, Domenico Ferrari: A Sensitivity Study of the Clustering Approach to Workload Modeling. 25-33
• Hussein G. Badr, David Gelernter, Sunil Podar: An Adaptive Communications Protocol for Network Computers. 35-51
• Derek L. Eager, Edward D. Lazowska, John Zahorjan: A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing. 53-68

Volume 6, Number 2, 1986

• Zvi Rosberg: A Hybrid Access Method in a Multiple Access Channel. 93-102
• Anna Hac: On the Modeling of Shared Resources with Various Lock Granularities Using Queueing Networks. 103-115
• Martin H. Ackroyd: Approximate Characterisation of Nonstationary Discrete Time G/G/1 Systems. 117-123
• Mohammad Ilyas, H. T. Mouftah: Towards Performance Improvement of Cut-Through Switching in Computer Networks. 125-133
• A. Inkeri Verkamo: Comparison of External Sorting and Internal Sorting in Virtual Memory. 135-145

Volume 6, Number 3, 1986

• Gerold K. Wieber: Performance Analysis of a Virtual Circuit Protocol with Local Control. 175-187
• Peter J. Haas, Gerald S. Shedler: Regenerative Stochastic Petri Nets. 189-204
• Janusz Filipiak: Location of a Boundary for Diffusion Equation of a Single Server Queue. 205-218
• Andre B. Bondi, Ward Whitt: The Influence of Service-Time Variability in a Closed Network of Queues. 219-234

Volume 6, Number 4, 1986

• Robert Geist, Dennis E. Stevenson, Robert A. Allen: The Perceived Effect of Breakdown and Repair on the Performance of Multiprocessor Systems. 249-260
• Zvi Rosberg: Bounds for the Optimal Decentralized Access Protocol in a Local Area Network. 261-268
• Sukumar Ghosh, Somprakash Bandyopadhyay, Chandan Mazumdar: Study of a Simulated Stream Machine for Dataflow Computation. 269-291
• Kathryn E. Stecke: On the Nonconcavity of Throughput in Certain Closed Queueing Networks. 293-305
• Errol L. Lloyd: Two Processor Scheduling with Limited Preemption. 307-312