Computer Systems: Science & Engineering, Volume 5

Volume 5, Number 1, January 1990

• Editorial. 3-4 BibTeX
• Gianfranco Ciccarella, G. Paris, G. Valent: Top-down approach to the design of OCCAM and transputer-based real-time systems. 5-12 BibTeX
• Kevin Murray, Andy J. Wellings: Wisdom: A distributed operating system for transputers. 13-20 BibTeX
• Guo Qingping, Yakup Paker: Concurrent communication and granularity assessment for a transputer-based multiprocessor system. 21-28 BibTeX
• Harald Richter: Multiprocessor with dynamically variable topology. 29-35 BibTeX
• X. L. Deng, Tharam S. Dillon, Ken S. Lew, J. Rankin, E. Smith, David Suter: Optimal topologies of transputers for different classes of problems. 36-41 BibTeX
• Alain G. Chalmers, J. W. Hearne, K. J. Cameron, N. E. Ligeti: Implementation and performance evaluation of an optimization algorithm on transputers. 42-46 BibTeX
• R. K. Cooper, D. A. Peshkin: Parallel alternating direction implicit method on a network of transputers. 47-52 BibTeX

Volume 5, Number 2, April 1990

• Pradip K. Srimani, Shivakant Mishra: Performance evaluation of distributed mutual exclusion algorithms for computer networks. 59-64 BibTeX
• M. Becker, C. Dekoninck, J. P. Prost, B. Verrier: Stochastic Petri net model for the FPS/264. 65-72 BibTeX
• M. Seetha Lakshmi, Philip S. Yu: Effectiveness of parallel processing in database systems. 73-81 BibTeX
• Chris S. Wallace: Physically random generator. 82-88 BibTeX
• David Finkel: Modelling dynamic load-sharing in a distributed computing system. 89-94 BibTeX
• Edmond F. Kouka, Jean-Luc Patry: Algorithms for restructuring WSI arrays of processors. 95-104 BibTeX
• Y. M. Lam, H. T. Mouftah, Mohammad Ilyas: Performance analysis of CSMA-CD protocols in local area bus networks. 105-110 BibTeX
• C. P. Ravikumar, Lalit M. Patnaik: Performance improvement of simulated annealing algorithms. 111-115 BibTeX
• Hong-Fa Ho, Gen-Huey Chen, Te-Son Kuo: Branch testing of concurrent programs using Petri net models. 116-125 BibTeX

Volume 5, Number 3, July 1990

• Sajal K. Das, Narsingh Deo: Parallel Hungarian algorithm. 131-136 BibTeX
• Paul T. Hulina, Lee D. Coraor: Coprocessor architectures for efficient address computation and memory accessing. 137-146 BibTeX
• Jin-Chin Wang, Michel Dubois: Performance comparison of cache coherence protocols based on the access burst model. 147-158 BibTeX
• Graham M. Megson: Complex Eigenproblem solution by a parallel norm-reducing Jacobi method. 159-168 BibTeX
• Bryan Beresford-Smith, Heiko Schröder: Effective reconfiguration algorithms in fault-tolerant processor arrays. 169-177 BibTeX
• Vincenza Carchiolo, Antonella Di Stefano, Alberto Faro, Giuseppe Pappalardo: Case study in protocol verification. 178-186 BibTeX
• Milind Mahajan, Viktor K. Prasanna: Efficient parallel implementation of RETE pattern matching. 187-192 BibTeX

Volume 5, Number 4, 1990

• Reda A. Ammar: Algorithmic approach to construct probabilistic grammatical models of command streams in interactive software systems. 195-201 BibTeX
• Dilip Sarkar, Ratan K. Guha: Mapping a class of algorithms from binary tree machines to linear arrays. 202-204 BibTeX
• P. David Stotts: Bounding procedure execution times in a synchronous Petri net computation model. 205-214 BibTeX
• Sang Hyuk Son: Reconstruction of distributed databases. 215-222 BibTeX
• Tad Hogg, Jeffrey O. Kephart: Phase transitions in high-dimensional pattern classification. 223-232 BibTeX
• Shih-Chian Yang, John A. Silvester: Fault-tolerant multistage interconnection networks: performance/reliability tradeoffs. 233-242 BibTeX
• Douglas W. Cornell, Philip S. Yu: Integrated approach to buffer management and query optimization. 243-251 BibTeX