IEEE Transactions on Computers, Volume 38

Volume 38, Number 1, January 1989

• A. P. Wim Böhm, John Sargeant:
  Code Optimization for Tagged-Token Dataflow Machines. 4-14
  
• Ahmed E. Barbour, Anthony S. Wojcik:
  A General, Constructive Approach to Fault-Tolerant Design Using Redundancy. 15-29
  
• Prithviraj Banerjee, Abhijeet Dugar:
  The Design, Analysis and Simulation of a Fault-Tolerant Interconnection Network Supporting the Fetch-and-Add Primitive. 30-46
  
• Kai Hwang, Ping-Sheng Tseng, Dongseung Kim:
  An Orthogonal Multiprocessor for Parallel Scientific Computations. 47-61
  
• Laura A. Sanchis:
  Multiple-Way Network Partitioning. 62-81
  
• Edward A. Bender, Jon T. Butler:
  On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. 82-98
  
• Ian F. Akyildiz:
  Product Form Approximations for Queueing Networks with Multiple Servers and Blocking. 99-114
  
• Jie-Yong Juang, Benjamin W. Wah:
  Resource Sharing Interconnection Networks in Multiprocessors. 115-129
  
• Masahiro Miyakawa:
  Criteria for Selecting a Variable in the Construction of Efficient Decision Trees. 130-141
  

• Jayaram Bhasker, Sartaj Sahni:
  Via Assignment in Single-Row Routing. 142-149
  
• H. V. Jagadish, Thomas Kailath:
  A Family of New Efficient Arrays for Matrix Multiplication. 149-155
  
• Robert P. Cook:
  An Empirical Analysis of The Lilith Instruction Set. 156-158
  

Volume 38, Number 2, February 1989

• Fayez El Guibali:
  Design and Analysis of Arbitration Protocols. 161-171
  
• Stamatis Vassiliadis, Eric M. Schwarz, Don J. Hanrahan:
  A General Proof for Overlapped Multiple-Bit Scanning Multiplications. 172-183
  
• Zhixi Fang, Xiaobo Li, Lionel M. Ni:
  On the Communication Complexity of Generalized 2-D Convolution on Array Processors. 184-194
  
• Arun K. Somani, Vinod K. Agarwal, David Avis:
  On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems. 195-201
  
• Jyh-Charn Liu, Kang G. Shin:
  Polynomial Testing of Packet Switching Networks. 202-217
  
• Jason Gait:
  A Kernel for High-Performance Multicast Communications. 218-226
  
• Woei Lin, Chuan-lin Wu:
  A Fault-Tolerant Mapping Scheme for a Configurable Multiprocessor System. 227-237
  
• Isaac D. Scherson, Sandeep Sen:
  Parallel Sorting in Two-Dimensional VLSI Models of Computation. 238-249
  
• Cheeha Kim, Ashok K. Agrawala:
  Analysis of the Fork-Join Queue. 250-255
  

• Robert F. Molyneaux, Alexander Albicki:
  Comments on "Ternary Scan Design for VLSI Testability". 256-263
  
• Walter A. Helbig, Veljko M. Milutinovic:
  A DCFL E/D-MESFET GaAs Experimental RISC Machine. 263-274
  
• Vladimir Cherkassky, Miroslaw Malek:
  Partitioning and Permuting Properties of CC-Banyan Networks. 274-278
  
• Peter J. Varman, I. V. Ramakrishnan:
  Optimal Matrix Multiplication on Fault-Tolerant VLSI Arrays. 278-283
  
• Toshio Nakatani, Shing-Tsaan Huang, Bruce W. Arden, Satish K. Tripathi:
  K-Way Bitonic Sort. 283-288
  
• Allen Van Gelder:
  PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms. 289-292
  
• A. P. Shenoy, R. Kumaresan:
  Fast Base Extension Using a Redundant Modulus in RNS. 292-297
  
• Israel Gazit, Miroslaw Malek:
  On the Number of Permutations Performable by Extra-Stage Multistage Interconnection Networks. 297-302
  
• Kyungsook Y. Lee, Hyunsoo Yoon:
  The PM22I Interconnection Network. 302-307
  
• Hon Fung Li, R. Jayakumar, Clement Wing Hong Lam:
  Restructuring for Fault-Tolerant Systolic Arrays. 307-311
  
• Arturo I. Concepcion:
  A Hierarchical Computer Architecture for Distributed Simulation. 311-319
  

Volume 38, Number 3, March 1989

• Russ Miller, Quentin F. Stout:
  Mesh Computer Algorithms for Computational Geometry. 321-340
  
• John A. Stankovic:
  Decentralized Decision Making for Task Reallocation in a Hard Real-Time System. 341-355
  
• Fred J. Meyer, Dhiraj K. Pradhan:
  Dynamic Testing Strategy for Distributed Systems. 356-365
  
• Joseph Kljaich Jr., Brian T. Smith, Anthony S. Wojcik:
  Formal Verification of Fault Tolerance Using Theorem-Proving Techniques. 366-376
  
• Andrew S. Noetzel:
  An Interpolating Memory Unit for Function Evaluation: Analysis and Design. 377-384
  
• Anujan Varma, C. S. Raghavendra:
  Fault-Tolerant Routing in Multistage Interconnection Networks. 385-393
  
• Pinaki Mazumder, Janak H. Patel:
  Parallel Testing for Pattern-Sensitive Faults in Semiconductor Random-Access Memories. 394-407
  
• Derek L. Eager, John Zahorjan, Edward D. Lazowska:
  Speedup Versus Efficiency in Parallel Systems. 408-423
  
• Bhabani P. Sinha, Pradip K. Srimani:
  Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures. 424-431
  
• Adrian E. Conway, Edmundo de Souza e Silva, Stephen S. Lavenberg:
  Mean Value Analysis by Chain of Product Form Queueing Networks. 432-442
  

• Thomas A. Rice, Leah H. Jamieson:
  A Highly Parallel Algorithm for Root Extraction. 443-449
  
• Ahmed El-Amawy:
  A Systolic Architecture for Fast Dense Matrix Inversion. 449-455
  
• Craig G. Prohazka:
  Decoupling Link Scheduling Constraints in Multihop Packet Radio Networks. 455-458
  
• Yang-Chang Hong, Thomas H. Payne:
  Parallel Sorting in a Ring Network of Processors. 458-464
  
• B. L. Bodnar, A. C. Liu:
  Modeling and Performance Analysis of Single-Bus Tightly-Coupled Multiprocessors. 465-470
  
• Viktor K. Prasanna, Yu-Chen Tsai:
  On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays. 470-478
  
• Mary Ann Kennedy, Gerard G. L. Meyer:
  The PMC System Level Fault Model: Cardinality Properties of the Implied Faulty Sets. 478-480
  

Volume 38, Number 4, April 1989

• Gurindar S. Sohi:
  Cache Memory Organization to Enhance the Yield of High-Performance VLSI Processors. 484-492
  
• Ming-Feng Chang, W. Kent Fuchs, Janak H. Patel:
  Diagnosis and Repair of Memory with Coupling Faults. 493-500
  
• Sun-Yuan Kung, Shiann-Ning Jean, Chih-Wei Jim Chang:
  Fault-Tolerant Array Processors Using Single-Track Switches. 501-514
  
• Jung Hwan Kim, Sudhakar M. Reddy:
  On the Design of Fault-Tolerant Two-Dimensional Systolic Arrays for Yield Enhancement. 515-525
  
• Hee Yong Youn, Adit D. Singh:
  On Implementing Large Binary Tree Architectures in VLSI and WSI. 526-537
  
• Fred J. Meyer, Dhiraj K. Pradhan:
  Modeling Defect Spatial Distribution. 538-546
  

• Mingshien Wang, Michal Cutler, Stephen Y. H. Su:
  Reconfiguration of VLSI/WSI Mesh Array Processors with Two-Level Redundancy. 547-554
  
• Sheldon B. Akers, Balakrishnan Krishnamurthy:
  A Group-Theoretic Model for Symmetric Interconnection Networks. 555-566
  
• Maheswara R. Samatham, Dhiraj K. Pradhan:
  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI. 567-581, (Correction: IEEE Transactions on Computers 41(1): 122-123 (1991))
  
• Tsutomu Sasao:
  On the Optimal Design of Multiple-Valued PLA's. 582-592
  
• Harold Fleisher, John Giraldi, R. Phoenix, Morton Tavel:
  Minimizability of Random Boolean Functions. 593-595
  
• Corinna Lee:
  Multistep Gradual Rounding. 595-600
  
• Amar Mukherjee:
  Hardware Algorithms for Determining Similarity Between Two Strings. 600-603
  
• Lee-Chin Hsu Liu, David Hung-Chang Du:
  A Near-Optimal Heuristic Algorithm for Single-Row Routing. 603-608
  

Volume 38, Number 5, May 1989

• H. Paul Lin, Harry E. Stovall III:
  Self-Synchronizing Communication Protocols. 609-625
  
• K. H. Kim, Howard O. Welch:
  Distributed Execution of Recovery Blocks: An Approach for Uniform Treatment of Hardware and Software Faults in Real-Time Applications. 626-636
  
• René David, Antoine Fuentes, Bernard Courtois:
  Random Pattern Testing Versus Deterministic Testing of RAM's. 637-650
  
• Mukesh Singhal:
  A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems. 651-662
  
• Alexandru Nicolau:
  Run-Time Disambiguation: Coping with Statically Unpredictable Dependencies. 663-678
  
• Vikram V. Karmarkar, Jon G. Kuhl:
  An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks. 679-695
  
• Ichiro Suzuki, Harngdar Lu:
  Temporal Petri Nets and Their Application to Modeling and Analysis of a Handshake Daisy Chain Arbiter. 696-704
  
• James F. Kurose, Rahul Simha:
  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems. 705-717
  
• Ian J. Davis:
  Local Correction of Helix(k) Lists. 718-724
  
• Helmar Burkhart, Roland Millen:
  Performance-Measurement Tools in a Multiprocessor Environment. 725-737
  

• Hiroshi Masuyama, Tetsuo Ichimori:
  Tolerance of Double-Loop Computer Networks to Multinode Failures. 738-741
  
• Patrick Shen-Pei Wang, Edward Y. Y. Zhang:
  A Fast and Flexible Thinning Algorithm. 741-745
  
• Wentai Liu, Thomas H. Hildebrandt, Ralph K. Cavin III:
  Hamiltonian Cycles in the Shuffle-Exchange Network. 745-750
  
• Ahmed El-Amawy:
  Comments on "Can Redundancy and Masking Improve the Performance of Synchronizers?". 750-753
  
• M. J. Foster:
  Avoiding Latch Formation in Regular Expression Recognizers. 754-756
  
• Li-Shin Lin, Sartaj Sahni:
  Fair Edge Deletion Problems. 756-761
  
• Robert S. Roberts, Suresh C. Kothari:
  On Computing the Combinatorial Power of SW-Banyan Networks. 761-765
  
• Ian Parberry:
  A Note on Nondeterminism in Small, Fast Parallel Computers. 766-767
  

Volume 38, Number 6, June 1989

• Peter D. Hortensius, Howard C. Card, Robert D. McLeod, Werner Pries:
  Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata. 769-774
  
• Joanne Bechta Dugan, Kishor S. Trivedi:
  Coverage Modeling for Dependability Analysis of Fault-Tolerant Systems. 775-787
  
• T. Raju Damarla, Mark G. Karpovsky:
  Fault Detection in Combinational Networks by Reed-Muller Transforms. 788-797
  
• Makoto Kobayashi, Myron H. MacDougall:
  The Stack Growth Function: Cache Line Reference Models. 798-805
  
• Franklin T. Luk, Haesun Park:
  A Proof of Convergence for Two Parallel Jacobi SVD Algorithms. 806-811
  
• Senol Utku, Moktar Salama, Robert J. Melosh:
  A Family of Permutations for Concurrent Factorization of Block Tridiagonal Matrices. 812-824
  
• Kentaro Shimizu, Eiichi Goto, Shuichi Ichikawa:
  CPC (Cyclic Pipeline Computer) - An Architecture Suited for Josephson and Pipelined-Memory Machines. 825-832
  
• Clement Wing Hong Lam, Hon Fung Li, R. Jayakumar:
  A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays. 833-844
  
• Geoffrey M. Brown, Mohamed G. Gouda, Chuan-lin Wu:
  Token Systems that Self-Stabilize. 845-852
  

• Alan A. Bertossi, Maurizio A. Bonuccelli:
  A Gracefully Degradable VLSI System for Linear Programming. 853-861
  
• Sreejit Chakravarty, Harry B. Hunt III:
  A Note on Detecting Sneak Paths in Transistor Networks. 861-864
  
• Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz:
  The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. 865-869
  
• Ram Chillarege, Ravishankar K. Iyer:
  An Experimental Study of Memory Fault Latency. 869-874
  
• Veljko M. Milutinovic, Mark Bettinger, Walter A. Helbig:
  Multiplier/Shifter Design Tradeoffs in a 32-bit Microprocessor. 874-881
  
• L. Vroomen, Paul J. Zsombor-Murray, P. Baracos, R. Hudson:
  Comments on "Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity". 880-881
  
• Anton T. Dahbura, Krishan K. Sabnani, William J. Hery:
  Spare Capacity as a Means of Fault Detection and Diagnosis in Multiprocessor Systems. 881-891
  
• Nicola Santoro, Ed Suen:
  Reduction Techniques for Selection in Distributed Files. 891-896
  
• Joseph JáJá, Sau-Mou Wu:
  A New Approach to Realizing Partially Symmetric Functions. 896-898
  
• D. C. Schmidt:
  An Analytic Model of Printed Circuit Wiring Distributions. 898-903
  
• M. A. Sridhar:
  A Fast Algorithm for Testing Isomorphism of Permutation Networks. 903-909
  
• Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton:
  Array Access Bounds for Block Storage Memory Systems. 909-913
  
• S.-C. Chu, James R. Armstrong:
  t-TDA-Diagnosable Systems. 914-920
  
• Chaitanya K. Baru, Ophir Frieder:
  Database Operations in a Cube-Connected Multicomputer System. 920-927
  

Volume 38, Number 7, July 1989

• Seyed H. Hosseini:
  On Fault-Tolerant Structure, Distributed Fault-Diagnosis, Reconfiguration, and Recovery of the Array Processors. 932-942
  
• Suzanne M. Sharrock, David Hung-Chang Du:
  Efficient CSMA/CD-Based Protocols for Multiple Priority Classes. 943-954
  
• Rajiv M. Dewan, Bezalel Gavish:
  Models for the Combined Logical and Physical Design of Databases. 955-967
  
• Vijay K. Vaishnavi:
  Multidimensional Balanced Binary Trees. 968-985
  
• Raymond T. Boute:
  Representational and Denotational Semantics of Digital Systems. 986-999
  
• Seth Abraham, Krishnan Padmanabhan:
  Performance of the Direct Binary n-Cube Network for Multiprocessors. 1000-1011
  
• Dominique Thiébaut:
  On the Fractal Dimension of Computer Programs and its Application to the Prediction of the Cache Miss Ratio. 1012-1026
  
• Laxmi N. Bhuyan, Dipak Ghosal, Qing Yang:
  Approximate Analysis of Single and Multiple Ring Networks. 1027-1040
  

• Balakrishnan Krishnamurthy, Ioannis G. Tollis:
  Improved Techniques for Estimating Signal Probabilities. 1041-1045
  
• Antonio Pincin:
  A New Algorithm for Multiplication in Finite Fields. 1045-1049
  
• M. Scott:
  Fast Rounding in Multiprecision Floating-Slash Arithmetic. 1049-1052
  
• Hartmut Schmeck, Heiko Schröder, Christoph Starke:
  Systolic s²-Way Merge Sort is Optimal. 1052-1056
  

Volume 38, Number 8, August 1989

• Wei-Tek Tsai, C. V. Ramamoorthy, Wei Kang Tsai, Osamu Nishiguchi:
  An Adaptive Hierarchical Routing Protocol. 1059-1075
  
• Senro Saito, Hiroyuki Yoshida, Tosiyasu L. Kunii:
  The CrossoverNet LAN System Using an Intelligent Head-End. 1076-1085
  
• Woei Lin, Tsang-Ling Sheu, Chita R. Das, Tse-Yun Feng, Chuan-lin Wu:
  A Conflict-Free Routing Scheme on Multistage Interconnection Networks. 1086-1097
  
• Katherine M. Baumgartner, Benjamin W. Wah:
  GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks. 1098-1109
  
• Krithi Ramamritham, John A. Stankovic, Wei Zhao:
  Distributed Scheduling of Tasks with Deadlines and Resource Requirements. 1110-1123
  
• Kang G. Shin, Yi-Chieh Chang:
  Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts. 1124-1142
  
• Qing Yang, Laxmi N. Bhuyan, Bao-Chyn Liu:
  Analysis and Comparison of Cache Coherence Protocols for a Packet-Switched Multiprocessor. 1143-1153
  
• Christoph Scheurich, Michel Dubois:
  Dynamic Page Migration in Multiprocessors with Distributed Global Memory. 1154-1163
  
• Arif Ghafoor, Patrick Solé:
  Performance of Fault-Tolerant Diagnostics in the Hypercube Systems. 1164-1172
  
• K. Ravindran, Samuel T. Chanson:
  Failure Transparency in Remote Procedure Calls. 1173-1187
  
• K. H. Kim, Seung M. Yang:
  Performance Impacts of Look-Ahead Execution in the Conversation Scheme. 1188-1202
  
• Jih-Kwon Peir, Ron Cytron:
  Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors. 1203-1211
  
• Marina Roesler, Walter A. Burkhard:
  Resolution of Deadlocks in Object-Oriented Distributed Systems. 1212-1224
  

Volume 38, Number 9, September 1989

• Jean-Luc Gaudiot, Yi-Hsiu Wei:
  Token Relabeling in a Tagged Token Data-Flow Architecure. 1225-1239
  
• K. V. S. Ramarao:
  Distributed Algorithms for Network Recognition Problems. 1240-1248
  
• S. Lennart Johnsson, Ching-Tien Ho:
  Optimum Broadcasting and Personalized Communication in Hypercubes. 1249-1268
  
• Mark A. Yoder, Leah H. Jamieson:
  Simulation of a Word Recognition System on Two Parallel Architectures. 1269-1284
  
• Constantine D. Polychronopoulos, David J. Kuck, David A. Padua:
  Utilizing Multidimensional Loop Parallelism on Large-Scale Parallel Processor Systems. 1285-1296
  
• Rajiv Gupta, Alessandro Zorat, I. V. Ramakrishnan:
  Reconfigurable Multipipelines for Vector Supercomputers. 1297-1307
  
• David Bernstein, Michael Rodeh, Izidor Gertner:
  On the Complexity of Scheduling Problems for Parallel/Pipelined Machines. 1308-1313
  
• Harold S. Stone:
  Optimal Search Policies for Searches with I/O Bound Tasks. 1314-1320
  

• Bertrand Hochet, Patrice Quinton, Yves Robert:
  Systolic Gaussian Elimination over GF(p) with Partial Pivoting. 1321-1324
  
• S. G. Smith:
  Incremental Computation of Squares and Sums of Squares. 1325-1328
  
• S. G. Smith:
  Comments on "A Signed Bit-Sequential Multiplier". 1328-1330
  
• Donald M. Topkis:
  All-to-All Broadcast by Flooding in Communications Networks. 1330-1333
  
• Martin Fürer, Kurt Mehlhorn:
  AT²-Optimal Galois Field Multiplier for VLSI. 1333-1336
  
• Bruno Ciciani, Giovanni Cantone:
  Comments on "Design and Evaluation of a Fault-Tolerant Multiprocessur Using Hardware Recovery Blocks". 1336-1341, (see: IEEE Trans. Computers 33(2): 113-124 (1984))
  
• Luigi Dadda:
  On Serial-Input Multipliers for Two's Complement Numbers. 1341-1345
  
• Hungwen Li, Massimo Maresca:
  Polymorphic-Torus Network. 1345-1351
  

Volume 38, Number 10, October 1989

• Israel Cidon, Moshe Sidi:
  Distributed Assignment Algorithms for Multihop Packet Radio Networks. 1353-1361
  
• Hussein G. Badr, Sunil Podar:
  An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies. 1362-1371
  
• Aura Ganz, Imrich Chlamtac:
  Path Allocation Access Control in Fiber Optic Communication Systems. 1372-1382
  
• Gui Liang Feng:
  A VLSI Architecture for Fast Inversion in GF(2^m). 1383-1386
  
• Gyungho Lee:
  A Performance Bound of Multistage Combining Networks. 1387-1395
  
• Gianfranco Bilardi:
  Merging and Sorting Networks with the Topology of the Omega Network. 1396-1403
  
• Saburo Muroga, Yahiko Kambayashi, Hung Chi Lai, Jay Niel Culliney:
  The Transduction Method-Design of Logic Networks Based on Permissible Functions. 1404-1424
  
• Arif Ghafoor, Theodore R. Bashkow, Imran Ghafoor:
  Bisectionla Fault-Tolerant Communication Archtecture for Supercomputer Systems. 1425-1446
  

• A. Yavuz Oruç, Ajai Thirumalai:
  A Systematic Design of Cellular Permutation Arrays. 1447-1451
  
• Weicheng Shen, A. Yavuz Oruç:
  On Systolic Contractions of Program Graphs. 1451-1457
  
• Charles C. Wang:
  An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis. 1457-1460
  
• Prasad R. Chalasani, Sudipta Bhawmik, Anurag Acharya, P. Pal Chaudhuri:
  Design of Testable VLSI Circuits with Minumum Area Overhead. 1460-1462
  
• Carl K. Chang, Tsang Ming Jiang:
  A Binary Single-Key-Lock System for Access Control. 1462-1466
  
• Peter D. Hortensius, Robert D. McLeod, Howard C. Card:
  Parallel Random Number Generation for VLSI Systems Using Cellular Automata. 1466-1473
  
• David M. Mandelbaum:
  On Iterative Arrays for the Euclidean Algorithm over Finite Fields. 1473-1478
  

Volume 38, Number 11, November 1989

• Chung-Chi Jim Li, Paul Peichuan Chen, W. Kent Fuchs:
  Local Concurrent Error Detection and Dorrection in Data Structures Using Virtual Backpointers. 1481-1492
  
• Mario Blaum, Henk C. A. van Tilborg:
  On t-Error Correcting/All Unidirectional Error Detecting Codes. 1493-1501
  
• Anurag Kumar:
  Adaptive Load Control of the Central Processor in a Distributed System with a Star Topology. 1502-1512
  
• Ravi Mirchandaney, Donald F. Towsley, John A. Stankovic:
  Analysis of the Effects of Delays on Load Sharing. 1513-1525
  
• Guy E. Blelloch:
  Scans as Primitive Parallel Operations. 1526-1538
  
• Gita Alaghband, Harry F. Jordan:
  Sparse Gaussian Elimination with Controlled Fill-in on a Shared Memory Multiprocessor. 1539-1557
  
• Lester Lipsky, Sharad C. Seth:
  Signal Probabilities in AND-OR Trees. 1558-1563
  
• Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang:
  The Number of Intersections Between Two Rectangular Paths. 1564-1571
  

• Adam Kapralski:
  The Maximum and Minimum Selector SELRAM and its Application for Developing Fast Sorting Machines. 1572-1577
  
• S. S. S. P. Rao, J. R. Isaac:
  Interface Optimization: An Algorithm for the Detection of Data Path Redundancy and Reconfigurability Towards Obtaining Minimal Bus Interfaces. 1577-1580
  
• Bhargab B. Bhattacharya, Sharad C. Seth:
  Design of Parity Testable Combinational Circuits. 1580-1584
  
• A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
  A Note Extending the Analysis of Two-Head Disk Systems to More General Seek-Time Characteristics. 1584-1586
  
• Abdol-Hossein Esfahanian:
  Generalized Measures of Fault Tolerance with Application to N-Cube Networks. 1586-1591
  
• Rami G. Melhem:
  A Systolic Accelerator for the Iterative Solution of Sparse Linear Systems. 1591-1595
  
• Sumit Ghosh, Meng-Lin Yu:
  A Preemtive Scheduling Mechanism for Accurate Behavioral Simulation of Digital Designs. 1595-1600
  
• James T. Blake, Kishor S. Trivedi:
  Multistage Interconnection Network Reliability. 1600-1604
  
• Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima:
  The Via Minimization Problem is NP-Complete. 1604-1608
  

Volume 38, Number 12, December 1989

• Mark D. Hill, Alan Jay Smith:
  Evaluating Associativity in CPU Caches. 1612-1630, (Correction: IEEE Transactions on Computers 41(3): 371 (1991))
  
• Thomas E. Anderson, Edward D. Lazowska, Henry M. Levy:
  The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors. 1631-1644
  
• Norman P. Jouppi:
  The Nonuniform Distribution of Instruction-Level and Machine Parallelism and Its Effect on Performance. 1645-1658
  
• Rafael H. Saavedra-Barrera, Alan Jay Smith, Eugene Miya:
  Machine Characterization Based on an Abstract High-Level Language Machine. 1659-1679
  
• A. L. Narasimha Reddy, Prithviraj Banerjee:
  An Evaluation of Multiple-Disk I/O Systems. 1680-1690
  
• Darrell D. E. Long, John L. Carroll, Kris Stewart:
  Estimating the Reliability of Regeneration-Based Replica Control Protocols. 1691-1702
  
• Vijay P. Kumar, Andrew L. Reibman:
  Failure Dependent Performance Analysis of a Fault-Tolerant Multistage Interconnection Network. 1703-1713
  
• Richard R. Muntz, Edmundo de Souza e Silva, Ambuj Goyal:
  Bounding Availability of Repairable Computer Systems. 1714-1723
  
• Scott Shenker, Abel Weinrib:
  The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing. 1724-1735
  
• Jiawei Hong, Xiaonan Tan, Donald F. Towsley:
  A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System. 1736-1744
  

Last update Fri May 24 20:51:20 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page