2. SPDP 1990: Dallas, Texas, USA

• Rong Lin, Stephan Olariu:
  On the parallel recognition of some tree-representable graphs. 6-13
  
• Akhilesh Tyagi, John H. Reif:
  Energy complexity of optical computations. 14-21
  
• Rassul Ayani:
  LR-algorithm: concurrent operations on priority queues. 22-25
  
• Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
  Parallel algorithms for ranking of trees. 26-31
  
• Hemant G. Rotithor, S. S. Pyo:
  Decentralized decision-making in adaptive task sharing. 34-41
  
• Gilbert C. Sih, Edward A. Lee:
  Dynamic-level scheduling for heterogeneous processor networks. 42-49
  
• Xiaotie Deng, Hai-Ning Liu, Bing Xiao:
  Deterministic load balancing in computer networks. 50-57
  
• Zhiyong Liu, Jia-Huai You:
  Dynamic load-balancing on a parallel inference system. 58-61
  
• Riccardo Bettati, Jane W.-S. Liu:
  Algorithms for end-to-end scheduling to meet deadlines. 62-67
  

Networks I

• Anish Arora, Mohamed G. Gouda, Ted Herman:
  Composite Routing Protocols. 70-78
  
• Abdou Youssef, Bruce W. Arden:
  Topology of Efficiently Controllable Banyan Multistage Networks. 79-86
  
• Mee Yee Chan, Shiang-Jen Lee:
  Subcube Recognition, Allocation/Deallocation and Relocation in Hypercubes. 87-93
  
• Jop F. Sibeyn:
  Routing Permutations on MESH Interconnection Networks. 94-97
  
• M. T. Raghunath, Abhiram G. Ranade:
  A Simulation-Based Comparison of Interconnection Networks. 98-105
  

Operating Systems I

• Eric Leu, André Schiper, Abdel Wahab Zramdini:
  Execution Replay on Distributed Memory Architectures. 106-112
  
• K. V. S. Ramarao, K. Brahmadathan:
  Divide and Conquer for Distributed Mutual Exclusion. 113-120
  
• S. Schleipfer:
  The ServOS Kernel: A Special-Purpose Operating System Kernel for Server Machines. 121-125
  
• Ajay D. Kshemkalyani, Mukesh Singhal:
  Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed Systems. 126-129
  
• C. A. Lee:
  Barrier Synchronization Over Multistage Interconnection Networks. 130-135
  

Databases

• Peter Triantafillou, David J. Taylor:
  A New Paradigm for High Availability and Efficiency in Replicated Distributed Databases. 136-143
  
• Edward Omiecinski, Ron Shonkwiler:
  Parallel Join Processing Using Nonclustered Indexes for a Shared Memory Multiprocessor. 144-151
  
• Vijay Kumar, Albert Burger:
  Main Memory Database Recovery Algorithms and Their Performance. 152-155
  
• Akhil Kumar:
  A Crash Recovery Algorithm Based on Multiple Logs that Exploits Parallelism. 156-159
  

• F. Mariategui, Margaret H. Eich:
  A transaction definition based on message passing. 160-163
  
• Michael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri:
  Design of optimal systolic arrays: a systematic approach. 166-173
  
• Roland Zito-Wolf:
  A broadcast/reduce architecture for high-speed data compression. 174-181
  
• Mitsuhisa Sato, Shuichi Ichikawa, Eiichi Goto:
  Multiple instruction streams in a highly pipelined processor. 182-189
  
• Douglas Comer, Rajendra Yavatkar:
  High-speed propagation of link status routing control information. 190-194
  
• T. Heywood, Arif Ghafoor, Jim K. Chan:
  Deterministic simulation of PRAMs on hypercube networks without look-up tables. 195-198
  
• Yinan N. Shen, Fabrizio Lombardi, Donatella Sciuto:
  Evaluation and improvement of fault coverage for verification and validation of protocols. 200-207
  
• Seyed H. Hosseini, Nizar Jamal:
  Distributed, dynamic, and efficient testing of large scale multiple processor systems. 208-214
  
• Zbigniew M. Wójcik, Barbara E. Wójcik:
  Fault tolerant distributed computing using atomic send-receive checkpoints. 215-222
  
• Nian-Feng Tzeng:
  An effective fault-tolerant technique for circular butterfly parallel systems. 223-226
  
• C. Ko:
  Parallel execution of Lanczos algorithm in a CAM systolic ring. 228-234
  
• A. D. Robinson:
  Optimistic regulation of concurrency. 235-242
  
• Duncan G. Hudson III, Robert A. van de Geijn:
  An asymptotically 100% efficient parallel implementation of the nonsymmetric QR algorithm. 243-249
  
• Danny Krizanc:
  Integer sorting on a mesh-connected array of processors. 250-253
  
• Qingzhou Wang, Kam-Hoi Cheng:
  Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights. 254-257
  
• S. Henriques, N. Ranganathan:
  A parallel architecture for data compression. 260-266
  
• M. Kaufmann:
  Allowing overlaps makes switchbox layouts nice. 267-274
  
• E. Aposporidis, F. Lohnert, P. Mehring:
  Multi-level VLSI simulator for general purpose parallel machines. 275-278
  
• Cheng-Hsi Chen, Ioannis G. Tollis:
  Parallel algorithms for slicing floorplan designs. 279-282
  
• John D. Provence, S. Naganathan:
  A parallel distributed processing approach to VLSI global routing. 283-286
  
• David G. Kirkpatrick, Teresa M. Przytycka:
  An optimal parallel minimax tree algorithm. 293-300
  
• James Haralambides, Fillia Makedon, Burkhard Monien:
  Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. 301-307
  
• M. L. Weems, Nasr Ullah, Mario J. Gonzalez:
  Analysis of parallel algorithms using continuous job profiles. 308-311
  
• Jiahuang Ji, Menkae Jeng:
  Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers. 312-315
  
• Qing Yang, George Thangadurai, Laxmi N. Bhuyan:
  An adaptive cache coherence scheme for hierarchical shared-memory multiprocessors. 318-325
  
• Paraskevas Evripidou, Jean-Luc Gaudiot:
  Distributed input/output processing in data-driven multiprocessors. 326-333
  
• David W. Matula:
  Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor. 334
  
• S. P. Johansen:
  A universal online bit-serial cell for parallel expression evaluation. 335-338
  
• K.-F. Wong, U. C. Baron, Hans Benker, Sylvie Bescos, A. B. Cheese, François J. N. Cosquer, Sergio A. Delgado-Rannauro, Michel Dorochevsky, P. Heuze, M. Ibanez-Espiga, Jacques Noyé, Maurizio Paci, M. J. Ratcliffe, M. J. Reeve, Kees Schuerman, Alan P. Sexton, André Véron, Jiyang Xu:
  The European Declarative System (EDS) as a platform for parallel logic programming. 339-342
  
• Vinay Deshpande, Per-Åke Larson, T. Patrick Martin:
  Parallel join algorithms for nested relations on shared-memory multiprocessors. 344-347
  
• Kien A. Hua, Chiang Lee, Jih-Kwon Peir:
  A high performance hybrid architecture for concurrent query execution. 348-351
  
• David Eichmann:
  Type inference and the Algebra of qualified relations. 352-356
  
• D. B. Johnson, P. E. Raad, R. E. Rausch:
  The application of parallel processing to the simplified marker and cell method. 357-362
  
• Michael Barnett:
  The formal derivation of distributed programs from systolic arrays. 363-366
  
• J. Sandberg:
  Design of the PRAM network. 367-372
  
• Tzilla Elrad, N. Krishna Kumar, James R. Kenevan:
  Modeling distributed termination with pre-defined partial termination ordering. 373-376
  
• A. S. M. Sajeev:
  Scheduling in the operation-oriented paradigm. 378-385
  
• E. K. Haddad:
  Optimal partitioning of random workloads in homogeneous multiprocessor and distributed systems. 386-393
  
• Donald W. Gillies, Jane W.-S. Liu:
  Scheduling tasks with AND/OR precedence constraints. 394-401
  
• Jian Xu, Kai Hwang:
  Dynamic load balancing for parallel program execution on a message-passing multicomputer. 402-406
  
• Hyeong-Ah Choi, Bhagirath Narahari:
  Scheduling precedence graphs to minimize total system time in partitionable parallel architectures. 407-410
  
• Zbigniew M. Wójcik, Barbara E. Wójcik:
  Termination condition for a parallel shape coding and a parallel shape coding algorithm. 412-419
  
• Noboru Sonehara:
  Binary representation and intensity surface interpolation of the grey level image by relaxation neural network models. 420-427
  
• M. S. Mousavi, Robert J. Schalkoff:
  A parallel distributed algorithm for feature extraction and disparity analysis of computer images. 428-435
  
• R. Kamimura:
  Recognition and restoration of periodic patterns with recurrent neural network. 436-440
  
• D.-L. Lee, W. A. Davis:
  On linear speedup of a class of neighborhood functions in an array processor. 441-446
  
• Diane J. Cook, Lawrence B. Holder:
  Accelerated learning on the connection machine. 448-454
  
• M. C. Rowe, J. Labhart, R. Bechtel, S. Matney, S. Carrow:
  Forward chaining parallel inference. 455-462
  
• Fu-Chiung Cheng, Huei-Huang Chen, Jiin-Hwai Perng:
  Parallel execution on production systems. 463-470
  
• Si-En Chang, M. L. Manwaring, Y. Paul Chiang:
  Extended restricted AND-parallelism execution model. 471-474
  
• Erwin Prassler, Evangelos E. Milios:
  Parallel distributed robot navigation in the presence of obstacles. 475-478
  
• Oscar H. Ibarra, Hui Wang, Tao Jiang:
  Efficient parallel algorithms for solving set recurrence equations and applications. 480-487
  
• Frank K. H. A. Dehne, Susanne E. Hambrusch:
  Parallel algorithms for determining k-width- connectivity in binary images. 488-496
  
• Venkatraman Viswanathan, Shou-Hsuan Stephen Huang, Hongfei Liu:
  Parallel dynamic programming. 497-500
  
• Azer Bestavros, Thomas Cheatham, Dan C. Stefanescu:
  Parallel bin packing using first fit and k-delayed best-fit heuristics. 501-504
  
• N. R. Wagner:
  Randomized fault-detecting leader election in a bi-directional ring. 506-510
  
• C. T. Liang, W. T. Tsai:
  Multi-failure fault-tolerance of embedded loops on hypercubes: issues and performance study. 511-518
  
• Fabrizio Lombardi, Yinan N. Shen, Jon C. Muzio:
  On the testability of array structures for FFT computation. 519-522
  
• Richard Hughey, Daniel P. Lopresti:
  A software approach to fault detection on programmable systolic arrays. 523-526
  
• Hussam Y. Abujbara, Sami A. Al-Arian:
  Self-testing and self-reconfiguration architecture for 2-D WSI arrays. 527-530
  
• Seshu Madhavapeddy, Ivan Hal Sudborough:
  A topological property of hypercubes: node disjoint paths. 532-539
  
• Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall:
  Embedding of cycles and grids in star graphs. 540-547
  
• Jih-Kwon Peir, Yann-Hang Lee:
  Improving multistage network performance under uniform and hot-spot traffics. 548-551
  
• A. Kumar, D. P. Agrawal:
  Computer network reliability evaluation from application's point of view. 552-555
  
• K. C. Anand, D. P. Agrawal, N. M. Kini:
  Efficient routing and conflict resolution in F and IADM networks. 556-559
  
• Ishfaq Ahmad, Arif Ghafoor:
  A semi distributed load balancing scheme for large multicomputer systems. 562-569
  
• K. Kant:
  Analysis and synthesis of generalized task graphs. 570-577
  
• Maryline Silly, Houssine Chetto, N. Elyounsi:
  An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. 578-585
  
• Rhys S. Francis, Arnold Neville Pears:
  Self scheduling and execution threads. 586-590
  
• G. R. Dattatreya, R. Venkatesh:
  Average response time minimization in star-connected computer networks. 591-594
  
• Guang R. Gao, Robert Kim Yates, Jack B. Dennis, Lenore M. R. Mullin:
  A strict monolithic array constructor. 596-603
  
• Chihping Wang:
  The complexity of processing tree queries in distributed databases. 604-611
  
• David C. Cann, John Feo, Thomas DeBoni:
  SISAL 1.2: high-performance applicative computing. 612-616
  
• Tomoyuki Tanaka, Shigeru Uzuhara:
  Multiprocessor Common Lisp on TOP-1. 617-622
  
• Gail E. Kaiser, Wenwey Hseush, Steven S. Popovich, Shyhtsun Felix Wu:
  Multiple concurrency control policies in an object-oriented programming system. 623-626
  
• Shan Jiang, Amrit L. Goel, Arif Ghafoor:
  LU factorization on CM2. 628-633
  
• Vassilis J. Tsotras, B. Gopinath, George W. Hart:
  Using universe knowledge and arithmetic to get faster parallel algorithms. 634-641
  
• C. S. Jeong:
  An improved parallel algorithm for construction Voronoi diagram on a mesh-connected computer. 642-645
  
• Nageswara S. V. Rao:
  Synthesis of simple distributed detection networks. 646-649
  
• William E. Weihl, Paul Wang:
  Multi-version memory: software cache management for concurrent B-trees. 650-655
  
• Marek Rusinkiewicz, Dimitrios Georgakopoulos, R. Thomas:
  RDS: a primitive for the maintenance of replicated data objects. 658-667
  
• Alexander D. Stoyenko:
  A general model and mechanisms for model-level heterogeneous RPC interoperability. 668-675
  
• L. Lim, A. Park:
  Solving the processor identity problem in O(n) space. 676-680
  
• I. Valdes, J.-F. Paris:
  Efficient caching of temporary files. 681-684
  
• S. E. Chern, R. T. Jacob, Ivor P. Page:
  Variations on the drinking philosophers algorithm. 685-688
  
• Tsair-chin Lin, Hsing Mei:
  On the fault diagnosis of a VLSI cellular array. 690-697
  
• Alexander Romanovsky, I. V. Sturtz:
  Transparent structurization of parallel processes for backward recovery. 698-706
  
• A. Agrawal:
  Fault-tolerant computing on trees. 707-714
  
• Srikanth Kambhatla, Jonathan Walpole:
  Recovery with limited replay: fault-tolerant processes in Linda. 715-718
  
• Michael Stumm, Songnian Zhou:
  Fault tolerant distributed shared memory algorithms. 719-724
  
• M. Amamiya, R. Taniguchi:
  Datarol: a massively parallel architecture for functional languages. 726-735
  
• K. C. Lee:
  A virtual bus for dynamic parallel processing. 736-743
  
• P. M. Miller, A. R. Hurson:
  Rapid design of testable, high-performance/capacity associative memories. 744-749
  
• D. Bhatia:
  Restructuring wafers for maximum yield and some applications of WSI. 750-753
  
• T. E. A. Lees:
  Context streams a theoretical basis for a generic form of MIMD pipelining. 754-757
  
• Ashwani K. Ramani, N. Gore, Pramod C. Sharma, Pradip K. Chande:
  Performance analysis of hierarchically structured multiple bus multiprocessor system. 760-767
  
• Calvin Ching-Yuen Chen, Hee Yong Youn:
  A comprehensive modeling for performance evaluation of regular interconnection network. 768-775
  
• K. M. Kavi, S. R. Kuthalam, A. K. Deshpande:
  A decomposition approach for analysis of parallel processing systems. 776-779
  
• Adriano Valenzano, Riccardo Sisto, Luigi Ciminiera:
  Modeling the execution of LOTOS specifications by cooperating extended finite state machines. 780-785
  
• Xiaodong Zhang, P. Srinivasan:
  Distributed task processing performance on a NUMA shared memory multiprocessor. 786-789
  
• A. L. Kimball, Raimond L. Winslow:
  Modeling the retinal horizontal cell layer on a massively parallel processor: a detailed neural network model. 792-798
  
• A. Tanaka, O. Nakamura:
  A probabilistic inference method with multiple evidences and its implementation using a layered network. 799-805
  
• Apostolos Nikolaos Refenes:
  Optimizing connectionist datasets with ConSTrainer. 806-811
  
• J. Ghosh, R. L. Holmberg:
  Multisensor fusion using neural networks. 812-815
  
• Achim G. Hoffmann:
  On computational limitations of neural network architectures. 818-825
  
• P. E. Raad, A. N. Varghese:
  On parallel processing in computational fluid dynamics. 826-833
  
• Raymond Greenlaw:
  The parallel complexity of queue versus stack breadth-first search. 834-837
  
• Stuart Ullman, Bhagirath Narahari:
  Mapping binary precedence trees to hypercubes and meshes. 838-841
  
• K. C. K. Luo, Yuan-Chieh Chow, Richard E. Newman-Wolfe:
  Near-optimal heuristics for schedulings on task-dependent machines. 842-847
  
• Lixin Tao, E. Ma:
  Simulating parallel neighbouring communications among square meshes and square toruses. 850-857
  
• Ralf Klasing, Reinhard Lüling, Burkhard Monien:
  Compressing cube-connected cycles and butterfly networks. 858-865
  
• Devendra Kumar, Saad Harous:
  An approach to study performance properties of distributed simulation. 866-869
  
• M. A. Sridhar, C. S. Raghavendra:
  On finding maximal subcubes in residual hypercubes. 870-873
  
• Eva Ma, Dennis G. Shea:
  The embedding kernel on the IBM victor multiprocessor for program mapping and network reconfiguration. 874-879
  
• Constantine N. K. Osiakwan, Selim G. Akl:
  The maximum weight perfect matching problem for complete weighted graphs is in PC. 880-887
  
• Mohamed G. Gouda, Michael Evangelist:
  Convergence/response tradeoffs in concurrent systems. 188-192