SPDP. 1990.

Conference: spdp1990

Abstract is missing.

- On the parallel recognition of some tree-representable graphs6-13 [doi]
- Energy complexity of optical computations14-21 [doi]
- LR-algorithm: concurrent operations on priority queues22-25 [doi]
- Decentralized decision-making in adaptive task sharing34-41 [doi]
- Deterministic load balancing in computer networks50-57 [doi]
- Dynamic load-balancing on a parallel inference system58-61 [doi]
- Algorithms for end-to-end scheduling to meet deadlines62-67 [doi]
- Composite Routing Protocols70-78 [doi]
- Topology of Efficiently Controllable Banyan Multistage Networks79-86 [doi]
- Subcube Recognition, Allocation/Deallocation and Relocation in Hypercubes87-93 [doi]
- Routing Permutations on MESH Interconnection Networks94-97 [doi]
- A Simulation-Based Comparison of Interconnection Networks98-105 [doi]
- Execution Replay on Distributed Memory Architectures106-112 [doi]
- Divide and Conquer for Distributed Mutual Exclusion113-120 [doi]
- Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed Systems126-129 [doi]
- A New Paradigm for High Availability and Efficiency in Replicated Distributed Databases136-143 [doi]
- Parallel Join Processing Using Nonclustered Indexes for a Shared Memory Multiprocessor144-151 [doi]
- Main Memory Database Recovery Algorithms and Their Performance152-155 [doi]
- A transaction definition based on message passing160-163 [doi]
- Design of optimal systolic arrays: a systematic approach166-173 [doi]
- A broadcast/reduce architecture for high-speed data compression174-181 [doi]
- Multiple instruction streams in a highly pipelined processor182-189 [doi]
- Convergence/response tradeoffs in concurrent systems188-192 [doi]
- High-speed propagation of link status routing control information190-194 [doi]
- Deterministic simulation of PRAMs on hypercube networks without look-up tables195-198 [doi]
- Evaluation and improvement of fault coverage for verification and validation of protocols200-207 [doi]
- Fault tolerant distributed computing using atomic send-receive checkpoints215-222 [doi]
- An effective fault-tolerant technique for circular butterfly parallel systems223-226 [doi]
- An asymptotically 100 efficient parallel implementation of the nonsymmetric QR algorithm243-249 [doi]
- Integer sorting on a mesh-connected array of processors250-253 [doi]
- Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights254-257 [doi]
- Allowing overlaps makes switchbox layouts nice267-274 [doi]
- Multi-level VLSI simulator for general purpose parallel machines275-278 [doi]
- Parallel algorithms for slicing floorplan designs279-282 [doi]
- A parallel distributed processing approach to VLSI global routing283-286 [doi]
- Approximation algorithms for the bandwidth minimization problem for caterpillar graphs301-307 [doi]
- Analysis of parallel algorithms using continuous job profiles308-311 [doi]
- Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers312-315 [doi]
- An adaptive cache coherence scheme for hierarchical shared-memory multiprocessors318-325 [doi]
- Distributed input/output processing in data-driven multiprocessors326-333 [doi]
- Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessor334 [doi]
- The European Declarative System (EDS) as a platform for parallel logic programming339-342 [doi]
- Parallel join algorithms for nested relations on shared-memory multiprocessors344-347 [doi]
- A high performance hybrid architecture for concurrent query execution348-351 [doi]
- Type inference and the Algebra of qualified relations352-356 [doi]
- The application of parallel processing to the simplified marker and cell method357-362 [doi]
- The formal derivation of distributed programs from systolic arrays363-366 [doi]
- Modeling distributed termination with pre-defined partial termination ordering373-376 [doi]
- Scheduling in the operation-oriented paradigm378-385 [doi]
- Scheduling tasks with AND/OR precedence constraints394-401 [doi]
- Dynamic load balancing for parallel program execution on a message-passing multicomputer402-406 [doi]
- Scheduling precedence graphs to minimize total system time in partitionable parallel architectures407-410 [doi]
- Termination condition for a parallel shape coding and a parallel shape coding algorithm412-419 [doi]
- Binary representation and intensity surface interpolation of the grey level image by relaxation neural network models420-427 [doi]
- A parallel distributed algorithm for feature extraction and disparity analysis of computer images428-435 [doi]
- On linear speedup of a class of neighborhood functions in an array processor441-446 [doi]
- Accelerated learning on the connection machine448-454 [doi]
- Forward chaining parallel inference455-462 [doi]
- Parallel execution on production systems463-470 [doi]
- Extended restricted AND-parallelism execution model471-474 [doi]
- Parallel distributed robot navigation in the presence of obstacles475-478 [doi]
- Efficient parallel algorithms for solving set recurrence equations and applications480-487 [doi]
- Parallel algorithms for determining k-width- connectivity in binary images488-496 [doi]
- Parallel dynamic programming497-500 [doi]
- Parallel bin packing using first fit and k-delayed best-fit heuristics501-504 [doi]
- Multi-failure fault-tolerance of embedded loops on hypercubes: issues and performance study511-518 [doi]
- On the testability of array structures for FFT computation519-522 [doi]
- Self-testing and self-reconfiguration architecture for 2-D WSI arrays527-530 [doi]
- A topological property of hypercubes: node disjoint paths532-539 [doi]
- Embedding of cycles and grids in star graphs540-547 [doi]
- Improving multistage network performance under uniform and hot-spot traffics548-551 [doi]
- Computer network reliability evaluation from application s point of view552-555 [doi]
- Efficient routing and conflict resolution in F and IADM networks556-559 [doi]
- A semi distributed load balancing scheme for large multicomputer systems562-569 [doi]
- Analysis and synthesis of generalized task graphs570-577 [doi]
- An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems578-585 [doi]
- Self scheduling and execution threads586-590 [doi]
- Average response time minimization in star-connected computer networks591-594 [doi]
- A strict monolithic array constructor596-603 [doi]
- The complexity of processing tree queries in distributed databases604-611 [doi]
- SISAL 1.2: high-performance applicative computing612-616 [doi]
- Multiprocessor Common Lisp on TOP-1617-622 [doi]
- Multiple concurrency control policies in an object-oriented programming system623-626 [doi]
- LU factorization on CM2628-633 [doi]
- Using universe knowledge and arithmetic to get faster parallel algorithms634-641 [doi]
- An improved parallel algorithm for construction Voronoi diagram on a mesh-connected computer642-645 [doi]
- Synthesis of simple distributed detection networks646-649 [doi]
- Multi-version memory: software cache management for concurrent B-trees650-655 [doi]
- RDS: a primitive for the maintenance of replicated data objects658-667 [doi]
- A general model and mechanisms for model-level heterogeneous RPC interoperability668-675 [doi]
- Transparent structurization of parallel processes for backward recovery698-706 [doi]
- Recovery with limited replay: fault-tolerant processes in Linda715-718 [doi]
- Fault tolerant distributed shared memory algorithms719-724 [doi]
- Datarol: a massively parallel architecture for functional languages726-735 [doi]
- A virtual bus for dynamic parallel processing736-743 [doi]
- Restructuring wafers for maximum yield and some applications of WSI750-753 [doi]
- Performance analysis of hierarchically structured multiple bus multiprocessor system760-767 [doi]
- A comprehensive modeling for performance evaluation of regular interconnection network768-775 [doi]
- Modeling the execution of LOTOS specifications by cooperating extended finite state machines780-785 [doi]
- Distributed task processing performance on a NUMA shared memory multiprocessor786-789 [doi]
- Modeling the retinal horizontal cell layer on a massively parallel processor: a detailed neural network model792-798 [doi]
- A probabilistic inference method with multiple evidences and its implementation using a layered network799-805 [doi]
- Optimizing connectionist datasets with ConSTrainer806-811 [doi]
- On computational limitations of neural network architectures818-825 [doi]
- On parallel processing in computational fluid dynamics826-833 [doi]
- The parallel complexity of queue versus stack breadth-first search834-837 [doi]
- Mapping binary precedence trees to hypercubes and meshes838-841 [doi]
- Near-optimal heuristics for schedulings on task-dependent machines842-847 [doi]
- Simulating parallel neighbouring communications among square meshes and square toruses850-857 [doi]
- Compressing cube-connected cycles and butterfly networks858-865 [doi]
- An approach to study performance properties of distributed simulation866-869 [doi]
- On finding maximal subcubes in residual hypercubes870-873 [doi]
- The embedding kernel on the IBM victor multiprocessor for program mapping and network reconfiguration874-879 [doi]
- The maximum weight perfect matching problem for complete weighted graphs is in PC880-887 [doi]