Abstract is missing.
- On the parallel recognition of some tree-representable graphsRong Lin, Stephan Olariu. 6-13 [doi]
- Energy complexity of optical computationsAkhilesh Tyagi, John H. Reif. 14-21 [doi]
- LR-algorithm: concurrent operations on priority queuesRassul Ayani. 22-25 [doi]
- Decentralized decision-making in adaptive task sharingHemant G. Rotithor, S. S. Pyo. 34-41 [doi]
- Deterministic load balancing in computer networksXiaotie Deng, Hai-Ning Liu, Bing Xiao. 50-57 [doi]
- Dynamic load-balancing on a parallel inference systemZhiyong Liu, Jia-Huai You. 58-61 [doi]
- Algorithms for end-to-end scheduling to meet deadlinesRiccardo Bettati, Jane W.-S. Liu. 62-67 [doi]
- Composite Routing ProtocolsAnish Arora, Mohamed G. Gouda, Ted Herman. 70-78 [doi]
- Topology of Efficiently Controllable Banyan Multistage NetworksAbdou Youssef, Bruce W. Arden. 79-86 [doi]
- Subcube Recognition, Allocation/Deallocation and Relocation in HypercubesMee Yee Chan, Shiang-Jen Lee. 87-93 [doi]
- Routing Permutations on MESH Interconnection NetworksJop F. Sibeyn. 94-97 [doi]
- A Simulation-Based Comparison of Interconnection NetworksM. T. Raghunath, Abhiram G. Ranade. 98-105 [doi]
- Execution Replay on Distributed Memory ArchitecturesEric Leu, André Schiper, Abdel Wahab Zramdini. 106-112 [doi]
- Divide and Conquer for Distributed Mutual ExclusionK. V. S. Ramarao, K. Brahmadathan. 113-120 [doi]
- Correct Two-Phase and One-Phase Deadlock Detection Algorithms for Distributed SystemsAjay D. Kshemkalyani, Mukesh Singhal. 126-129 [doi]
- A New Paradigm for High Availability and Efficiency in Replicated Distributed DatabasesPeter Triantafillou, David J. Taylor. 136-143 [doi]
- Parallel Join Processing Using Nonclustered Indexes for a Shared Memory MultiprocessorEdward Omiecinski, Ron Shonkwiler. 144-151 [doi]
- Main Memory Database Recovery Algorithms and Their PerformanceVijay Kumar, Albert Burger. 152-155 [doi]
- A transaction definition based on message passingF. Mariategui, Margaret H. Eich. 160-163 [doi]
- Design of optimal systolic arrays: a systematic approachMichael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri. 166-173 [doi]
- A broadcast/reduce architecture for high-speed data compressionRoland Zito-Wolf. 174-181 [doi]
- Multiple instruction streams in a highly pipelined processorMitsuhisa Sato, Shuichi Ichikawa, Eiichi Goto. 182-189 [doi]
- Convergence/response tradeoffs in concurrent systemsMohamed G. Gouda, Michael Evangelist. 188-192 [doi]
- High-speed propagation of link status routing control informationDouglas Comer, Rajendra Yavatkar. 190-194 [doi]
- Deterministic simulation of PRAMs on hypercube networks without look-up tablesT. Heywood, Arif Ghafoor, Jim K. Chan. 195-198 [doi]
- Evaluation and improvement of fault coverage for verification and validation of protocolsYinan N. Shen, Fabrizio Lombardi, Donatella Sciuto. 200-207 [doi]
- Fault tolerant distributed computing using atomic send-receive checkpointsZbigniew M. Wójcik, Barbara E. Wójcik. 215-222 [doi]
- An effective fault-tolerant technique for circular butterfly parallel systemsNian-Feng Tzeng. 223-226 [doi]
- An asymptotically 100 efficient parallel implementation of the nonsymmetric QR algorithmDuncan G. Hudson III, Robert A. van de Geijn. 243-249 [doi]
- Integer sorting on a mesh-connected array of processorsDanny Krizanc. 250-253 [doi]
- Parallel time complexity of a heuristic algorithm for the k-center problem with usage weightsQingzhou Wang, Kam-Hoi Cheng. 254-257 [doi]
- Allowing overlaps makes switchbox layouts niceM. Kaufmann. 267-274 [doi]
- Multi-level VLSI simulator for general purpose parallel machinesE. Aposporidis, F. Lohnert, P. Mehring. 275-278 [doi]
- Parallel algorithms for slicing floorplan designsCheng-Hsi Chen, Ioannis G. Tollis. 279-282 [doi]
- A parallel distributed processing approach to VLSI global routingJohn D. Provence, S. Naganathan. 283-286 [doi]
- Approximation algorithms for the bandwidth minimization problem for caterpillar graphsJames Haralambides, Fillia Makedon, Burkhard Monien. 301-307 [doi]
- Analysis of parallel algorithms using continuous job profilesM. L. Weems, Nasr Ullah, Mario J. Gonzalez. 308-311 [doi]
- Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computersJiahuang Ji, Menkae Jeng. 312-315 [doi]
- An adaptive cache coherence scheme for hierarchical shared-memory multiprocessorsQing Yang, George Thangadurai, Laxmi N. Bhuyan. 318-325 [doi]
- Distributed input/output processing in data-driven multiprocessorsParaskevas Evripidou, Jean-Luc Gaudiot. 326-333 [doi]
- Design of a highly parallel IEEE standard floating point unit: the Cyrix 83D87 coprocessorDavid W. Matula. 334 [doi]
- The European Declarative System (EDS) as a platform for parallel logic programmingK. 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. 339-342 [doi]
- Parallel join algorithms for nested relations on shared-memory multiprocessorsVinay Deshpande, Per-Åke Larson, T. Patrick Martin. 344-347 [doi]
- A high performance hybrid architecture for concurrent query executionKien A. Hua, Chiang Lee, Jih-Kwon Peir. 348-351 [doi]
- Type inference and the Algebra of qualified relationsDavid Eichmann. 352-356 [doi]
- The application of parallel processing to the simplified marker and cell methodD. B. Johnson, P. E. Raad, R. E. Rausch. 357-362 [doi]
- The formal derivation of distributed programs from systolic arraysMichael Barnett. 363-366 [doi]
- Modeling distributed termination with pre-defined partial termination orderingTzilla Elrad, N. Krishna Kumar, James R. Kenevan. 373-376 [doi]
- Scheduling in the operation-oriented paradigmA. S. M. Sajeev. 378-385 [doi]
- Scheduling tasks with AND/OR precedence constraintsDonald W. Gillies, Jane W.-S. Liu. 394-401 [doi]
- Dynamic load balancing for parallel program execution on a message-passing multicomputerJian Xu, Kai Hwang. 402-406 [doi]
- Scheduling precedence graphs to minimize total system time in partitionable parallel architecturesHyeong-Ah Choi, Bhagirath Narahari. 407-410 [doi]
- Termination condition for a parallel shape coding and a parallel shape coding algorithmZbigniew M. Wójcik, Barbara E. Wójcik. 412-419 [doi]
- Binary representation and intensity surface interpolation of the grey level image by relaxation neural network modelsNoboru Sonehara. 420-427 [doi]
- A parallel distributed algorithm for feature extraction and disparity analysis of computer imagesM. S. Mousavi, Robert J. Schalkoff. 428-435 [doi]
- On linear speedup of a class of neighborhood functions in an array processorD.-L. Lee, W. A. Davis. 441-446 [doi]
- Accelerated learning on the connection machineDiane J. Cook, Lawrence B. Holder. 448-454 [doi]
- Forward chaining parallel inferenceM. C. Rowe, J. Labhart, R. Bechtel, S. Matney, S. Carrow. 455-462 [doi]
- Parallel execution on production systemsFu-Chiung Cheng, Huei-Huang Chen, Jiin-Hwai Perng. 463-470 [doi]
- Extended restricted AND-parallelism execution modelSi-En Chang, M. L. Manwaring, Y. Paul Chiang. 471-474 [doi]
- Parallel distributed robot navigation in the presence of obstaclesErwin Prassler, Evangelos E. Milios. 475-478 [doi]
- Efficient parallel algorithms for solving set recurrence equations and applicationsOscar H. Ibarra, Hui Wang, Tao Jiang. 480-487 [doi]
- Parallel algorithms for determining k-width- connectivity in binary imagesFrank K. H. A. Dehne, Susanne E. Hambrusch. 488-496 [doi]
- Parallel dynamic programmingVenkatraman Viswanathan, Shou-Hsuan Stephen Huang, Hongfei Liu. 497-500 [doi]
- Parallel bin packing using first fit and k-delayed best-fit heuristicsAzer Bestavros, Thomas Cheatham, Dan C. Stefanescu. 501-504 [doi]
- Multi-failure fault-tolerance of embedded loops on hypercubes: issues and performance studyC.-T. Liang, W. T. Tsai. 511-518 [doi]
- On the testability of array structures for FFT computationFabrizio Lombardi, Yinan N. Shen, Jon C. Muzio. 519-522 [doi]
- Self-testing and self-reconfiguration architecture for 2-D WSI arraysHussam Y. Abujbara, Sami A. Al-Arian. 527-530 [doi]
- A topological property of hypercubes: node disjoint pathsSeshu Madhavapeddy, Ivan Hal Sudborough. 532-539 [doi]
- Embedding of cycles and grids in star graphsJung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall. 540-547 [doi]
- Improving multistage network performance under uniform and hot-spot trafficsJih-Kwon Peir, Yann-Hang Lee. 548-551 [doi]
- Computer network reliability evaluation from application s point of viewA. Kumar, D. P. Agrawal. 552-555 [doi]
- Efficient routing and conflict resolution in F and IADM networksK. C. Anand, D. P. Agrawal, N. M. Kini. 556-559 [doi]
- A semi distributed load balancing scheme for large multicomputer systemsIshfaq Ahmad, Arif Ghafoor. 562-569 [doi]
- Analysis and synthesis of generalized task graphsK. Kant. 570-577 [doi]
- An optimal algorithm for guaranteeing sporadic tasks in hard real-time systemsMaryline Silly, Houssine Chetto, N. Elyounsi. 578-585 [doi]
- Self scheduling and execution threadsRhys S. Francis, Arnold Neville Pears. 586-590 [doi]
- Average response time minimization in star-connected computer networksG. R. Dattatreya, R. Venkatesh. 591-594 [doi]
- A strict monolithic array constructorGuang R. Gao, Robert Kim Yates, Jack B. Dennis, Lenor M. R. Mullin. 596-603 [doi]
- The complexity of processing tree queries in distributed databasesChihping Wang. 604-611 [doi]
- SISAL 1.2: high-performance applicative computingDavid C. Cann, John Feo, Thomas DeBoni. 612-616 [doi]
- Multiprocessor Common Lisp on TOP-1Tomoyuki Tanaka, Shigeru Uzuhara. 617-622 [doi]
- Multiple concurrency control policies in an object-oriented programming systemGail E. Kaiser, Wenwey Hseush, Steven S. Popovich, Shyhtsun Felix Wu. 623-626 [doi]
- LU factorization on CM2Shan Jiang, Amrit L. Goel, Arif Ghafoor. 628-633 [doi]
- Using universe knowledge and arithmetic to get faster parallel algorithmsVassilis J. Tsotras, B. Gopinath, George W. Hart. 634-641 [doi]
- An improved parallel algorithm for construction Voronoi diagram on a mesh-connected computerC. S. Jeong. 642-645 [doi]
- Synthesis of simple distributed detection networksNageswara S. V. Rao. 646-649 [doi]
- Multi-version memory: software cache management for concurrent B-treesWilliam E. Weihl, Paul Wang. 650-655 [doi]
- RDS: a primitive for the maintenance of replicated data objectsMarek Rusinkiewicz, Dimitrios Georgakopoulos, R. Thomas. 658-667 [doi]
- A general model and mechanisms for model-level heterogeneous RPC interoperabilityAlexander D. Stoyenko. 668-675 [doi]
- Transparent structurization of parallel processes for backward recoveryAlexander Romanovsky, I. V. Sturtz. 698-706 [doi]
- Recovery with limited replay: fault-tolerant processes in LindaSrikanth Kambhatla, Jonathan Walpole. 715-718 [doi]
- Fault tolerant distributed shared memory algorithmsMichael Stumm, Songnian Zhou. 719-724 [doi]
- Datarol: a massively parallel architecture for functional languagesM. Amamiya, R. Taniguchi. 726-735 [doi]
- A virtual bus for dynamic parallel processingK. C. Lee. 736-743 [doi]
- Restructuring wafers for maximum yield and some applications of WSID. Bhatia. 750-753 [doi]
- Performance analysis of hierarchically structured multiple bus multiprocessor systemAshwani K. Ramani, N. Gore, Pramod C. Sharma, Pradip K. Chande. 760-767 [doi]
- A comprehensive modeling for performance evaluation of regular interconnection networkCalvin Ching-Yuen Chen, Hee Yong Youn. 768-775 [doi]
- Modeling the execution of LOTOS specifications by cooperating extended finite state machinesAdriano Valenzano, Riccardo Sisto, Luigi Ciminiera. 780-785 [doi]
- Distributed task processing performance on a NUMA shared memory multiprocessorXiaodong Zhang, P. Srinivasan. 786-789 [doi]
- Modeling the retinal horizontal cell layer on a massively parallel processor: a detailed neural network modelA. L. Kimball, Raimond L. Winslow. 792-798 [doi]
- A probabilistic inference method with multiple evidences and its implementation using a layered networkA. Tanaka, O. Nakamura. 799-805 [doi]
- Optimizing connectionist datasets with ConSTrainerApostolos Nikolaos Refenes. 806-811 [doi]
- On computational limitations of neural network architecturesAchim G. Hoffmann. 818-825 [doi]
- On parallel processing in computational fluid dynamicsP. E. Raad, A. N. Varghese. 826-833 [doi]
- The parallel complexity of queue versus stack breadth-first searchRaymond Greenlaw. 834-837 [doi]
- Mapping binary precedence trees to hypercubes and meshesStuart Ullman, Bhagirath Narahari. 838-841 [doi]
- Near-optimal heuristics for schedulings on task-dependent machinesK. C. K. Luo, Yuan-Chieh Chow, Richard E. Newman-Wolfe. 842-847 [doi]
- Simulating parallel neighbouring communications among square meshes and square torusesLixin Tao, E. Ma. 850-857 [doi]
- Compressing cube-connected cycles and butterfly networksRalf Klasing, Reinhard Lüling, Burkhard Monien. 858-865 [doi]
- An approach to study performance properties of distributed simulationDevendra Kumar, Saad Harous. 866-869 [doi]
- On finding maximal subcubes in residual hypercubesM. A. Sridhar, C. S. Raghavendra. 870-873 [doi]
- The embedding kernel on the IBM victor multiprocessor for program mapping and network reconfigurationEva Ma, Dennis G. Shea. 874-879 [doi]
- The maximum weight perfect matching problem for complete weighted graphs is in PCConstantine N. K. Osiakwan, Selim G. Akl. 880-887 [doi]