SIGMETRICS 1992: Newport, Rhode Island, USA

Trace Analysis Techniques

• Margaret Martonosi, Anoop Gupta, Thomas E. Anderson: MemSpy: Analyzing Memory System Bottlenecks in Programs. 1-12
• David B. Whalley: Fast Instruction Cache Performance Evaluation Using Compile-Time Analysis. 13-22

Memory Management

• Richard P. LaRowe Jr., Mark A. Holliday, Carla Schlatter Ellis: An Analysis of Dynamic Page Replacement on a NUMA Multiprocessor. 23-34
• Victor F. Nicola, Asit Dan, Daniel M. Dias: Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing. 35-46

Queueing Analysis

• Sem C. Borst, Onno J. Boxma, M. B. Combé: Collection of Customers: a Correlated M/G/1 Queue. 47-59
• Philippe Jacquet: Subexponential Tail Distribution in LaPalice Queues. 60-69
• Duan-Shin Lee, Bhaskar Sengupta: A Reservation Based Cyclic Server Queue With Limited Service. 70-77

File Systems

• K. K. Ramakrishnan, Prabuddha Biswas, Ramakrishna Karedla: Analysis of File I/O Traces in Commercial Computing Environments. 78-90
• Harjinder S. Sandhu, Songnian Zhou: Cluster-Based File Replication in Large-Scale Distributed Systems. 91-102

Transaction Processing

• Arif Merchant, Kun-Lung Wu, Philip S. Yu, Ming-Syan Chen: Performance Analysis of Dynamic Finite Versioning for Concurrency Transaction and Query Processing. 103-114
• Alexander Thomasian: Performance of Locking Policies with Limited Wait Depth. 115-127

Bounding Techniques for Complex Systems

• James F. Kurose: On Computing Per-session Performance Bounds in High-Speed Multi-hop Computer Networks. 128-139
• John C. S. Lui, Richard R. Muntz: Algorithmic Approach to Bounding the Mean Response Time of a Minimum Expected Delay Routing System. 140-151
• Edmundo de Souza e Silva, Pedro Mejía Ochoa: State Space Exploration in Markov Models. 152-166

Networks

• Susan S. Owicki, Anna R. Karlin: Factors in the Performance of the AN1 Computer Network. 167-180
• A. Udaya Shankar, Cengiz Alaettinoglu, Ibrahim Matta, Klaudia Dussa-Zieger: Performance Comparison of Routing Protocols using MaRS: Distance-Vector versus Link-State. 181-192
• Eitan Altman, Philippe Nain: Closed-Loop Control with Delayed Information. 193-204

Parallel Systems

• Arif Merchant: Analytical Models of Combining Banyan Networks. 205-212
• Ian F. Akyildiz, Liang Chen, Samir Ranjan Das, Richard Fujimoto, Richard F. Serfozo: Performance Analysis of "Time Warp" with Limited Memory. 213-224
• John Turek, Joel L. Wolf, Krishna R. Pattipati, Philip S. Yu, Icel Wolf: Scheduling Parallelizable Tasks: Putting it All on the Shelf. 225-236

Poster Session of Extended Abstracts

• Pierre Brémaud, W.-B. Gong: Derivatives of Likelihood Ratios and Smoothed Perturbation Analysis for the Routing Problem. 237-238
• Rosemary Candlin, Peter Fisk, Joseph Phillips, Neil Skilling: Studying the Performance Properties of Concurrent Programs by Simulation Experiments on Synthetic Programs. 239-240
• Robert F. Berry, Joseph L. Hellerstein: Characterizing and Interpreting Periodic Behavior in Computer Systems. 241-242
• Erhard Rahm, Donald F. Ferguson: High Performance Cache Management for Sequential Data Access. 243-244
• Ram Chakka, Isi Mitrani: Multiprocessor Systems with General Breakdowns and Repairs. 245-246
• Eric A. Brewer, Chrysanthos Dellarocas, Adrian Colbrook, William E. Weihl: PROTEUS: A High-Performance Parallel-Architecture Simulator. 247-248
• Dikran S. Meliksetian, C. Y. Roger Chen: Performance Analysis of Communications in Static Interconnection Networks. 249-250
• Asit Dan, Philip S. Yu, Jen-Yao Chung: Characterization of Database Access Skew in a Transaction Processing Environment. 251-252
• Aloke Gupta, Wen-mei W. Hwu: Xprof: Profiling the Execution of X Window Programs. 253-254
• Ruth Shoham, Uri Yechiali: Elevator-Type Polling Systems. 255-256
• François Baccelli, Miguel Canales: Parallel Simulation of Stochastic Petri Nets Using Recurrence Equations. 257-258
• Manfred R. Jobmann, Johann Schumann: Modelling and Performances Analysis of a Parallel Theorem Prover. 259-260