Abstract is missing.
- A Compiler Directed Cache Coherence Scheme with Fast and Parallel Explicit InvalidationAhmed Louri, Hongki Sung. 2-9
- Simulate CSP-like Synchronous Communications by MDC Asynchronous Message Passing and Pattern MatchingMing-Hwa Wang, Thomas W. Christopher. 2-9
- Reconfigurable Buses with Shift Switching - VLSI RADIX SortRong Lin. 2-9
- A Fast Selection Algorithm for Meshes with Multiple BroadcastingDharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang. 10-17
- Asynchronous Execution Through Instruction Caching in Massively Parallel SystemsSerge M. Manning, David G. Meyer. 10-17
- Unicast-based Multicast Communication in Wormhole-routed NetworksPhilip K. McKinley, Hong Xu, Abdol-Hossein Esfahanian, Lionel M. Ni. 10-19
- A New Cache Coherency and Address Translation Consistency ProtocolJen-Tien Yen, Behrooz Shirazi, Krishna M. Kavi. 18-21
- A Multicast Algorithm for Hypercube MultiprocessorsJang-Ping Sheu, Ming-Yang Su. 18-22
- A Formal Specification and Verification Technique for Cache Coherence ProtocolsAshwini K. Nanda, Laxmi N. Bhuyan. 22-26
- Fault-Tolerant Nonredundant Broadcasting in HypercubesJie Wu. 23-26
- Computing Threshold Times for k-Resilient ProtocolsSampath Rangarajan, Yennun Huang, Satish K. Tripathi. 24-27
- MAD Kernels: An Experimental Testbed to Study Multiprocessor Memory System BehviorArun K. Nanda, Lionel M. Ni. 28-35
- Embeddings of Hypercubes and Grids into de Bruijn GraphsMarie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. 28-37
- Analyzing Effect of Shared Data Replication on Minimizing Communication OverheadsSoo-Young Lee, Chung-Ming Chen. 28-31
- Retiming and Unfolding Data-Flow GraphsLiang-Fang Chao, Edwin Hsing-Mean Sha. 33-40
- Tolerating First Level Memory Access Latency in High-Performance SystemsWilliam Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu. 36-43
- A Divide and Conquer Ring Embedding Scheme in Hypercubes with Efficient Recovery AbilityJunlin Liu, Bruce M. McMillin. 38-45
- The Effectiveness of Random Mapping on Fine-Grain MIMD ArchitecturesMark R. Thistle, Thomas L. Sterling, James T. Kuehn, Thomas A. Anastasio. 41-48
- Dynamic Behavior of Memory Reference Streams for the Perfect Club BenchmarksKay A. Robbins, Steven Robbins. 48-52
- A Compile-Time Technique for Contorlling Real-Time Execution of Task-Level Data-Flow GraphsShridhar B. Shukla, Brian Little, Amr Zaky. 49-56
- Partial Multinode Broadcast Algorithms for D-Dimensional MeshesEmmanouel A. Varvarigos, Dimitri P. Bertsekas. 51-54
- Reducing PE/Memory Traffic in Shared Memory Multiprocessors by the Difference Coding of AddressesDavid M. Koppelman. 53-56
- Efficient Algorithm for Gray-to-Binary Permutation on HypercubesChing-Tien Ho, M. T. Raghunath. 55-59
- Multicast in Faulty HypercubesYouran Lan. 58-61
- Optimal Distribution of Random Workloads Over Heterogeneous Processors with Loading ConstraintsEmile Haddad. 58-65
- A Class of Optimal VLSI Architectures for Computing Discrete Fourier TransformHeonchul Park, Viktor K. Prasanna. 61-68
- On the Comparison of Hypercube and Torus NetworksKevin Bolding, Smaragda Konstantinidou. 62-66
- A Distributed Load Balancing Scheme for Parallel Logic ProgrammingZheng Lin, Jack Minker. 66-73
- Priorities in Nonminimal, Adaptive RoutingSmaragda Konstantinidou. 67-71
- A Parallel Matrix Inversion Algorithm on Torus with Adaptive PivotingJaved I. Khan, Woei Lin, David Y. Y. Yun. 69-72
- Brdiged and Twisted Hypercubes with Reduced DiametersRajib K. Das, Krishnendu Mukhopadhyaya, Bhabani P. Sinha. 72-75
- The RPT Parallel Gaussian Elimination AlgorithmSam H. Noh, Soo-Mook Moon, Ashok K. Agrawala. 73-76
- A Graph Partitioning-Based Load Balancing Strategy for a Distributed Memory MachineJames M. Conrad, Dharma P. Agrawal. 74-81
- Recursive Interconnection Networks for Multicomputer NetworksRonald Fernandes. 76-79
- The Complexity of FFT and Related Butterfly Algorithms on Meshes and HypermeshesTed H. Szymanski. 77-81
- Balanced HypercubesKe Huang, Jie Wu. 80-84
- On the Use of Adaptive Chebychev Iteration in Eigenvalue ProblemsYi-ling F. Chiang. 82-86
- Optimal Loope Parallelization Based on a Retiming TechniqueJin-Chin Chung. 83-90
- Synthesizing General Topologies from RingsRoss E. Johnson, James R. Goodman. 86-95
- Parallel Recurrence Solvers for Vector and SIMD SupercomputersHarold E. Conn, Louis J. Podrazik. 88-95
- Data Dependence Analysis and Uniformization for Doubly Nested LoopsTen H. Tzen, Lionel M. Ni. 91-99
- Synthesizing Otimal Lower Dimensional Processor ArraysKumar N. Ganapathy, Benjamin W. Wah. 96-103
- A unifying Framework for Distributed Routing AlgorithmsAlan Rooks, Bruno R. Preiss. 96-100
- Applying an Abstract Data Structure Description Approach to Parallelizing Scientific Pointer ProgramsJoseph Hummel, Laurie J. Hendren, Alexandru Nicolau. 100-104
- Maximally Fully Adaptive Routing in 2D MeshesChristopher J. Glass, Lionel M. Ni. 101-104
- Generating Parallel Programs from Tensor Product Formulas: A Case Study of Strassen s Matrix Multiplication AlgorithmChua-Huang Huang, John R. Johnson, Rodney W. Johnson. 104-108
- Parallel Computer Reconfigurability Through Optical InterconnectsKhaled A. Aly, Patrick W. Dowd. 105-108
- Sparse Data Representation for Dense Data-Parallel ComputationAlex L. Cheung, Anthony P. Reeves. 106-114
- Parallel Partition Expansion for the Solution of Arbitrary RecurrencesA. J. Huang, Z. George Mou. 109-113
- Performance Differences Among Combining Switch ArchitecturesSusan R. Dickey, Ora E. Percus. 110-117
- Distributed Object Replication Strategies for a Remote Caching ArchitectureAvraham Leff, Joel L. Wolf, Philip S. Yu. 114-123
- Parallel Orientation of Polygonal PartsViktor K. Prasanna, Anil S. Rao. 115-122
- Optimal Multipass Self-Routing Algorithms for Clos-Type Multistage NetworksHussein M. Alnuweiri, Viktor K. Prasanna. 118-122
- A Versatile External Control Method for Self-Routable Permutations in Benes NetworkNabanita Das, Krishnendu Mukhopadhyaya, Jayasree Dattagupta. 123-126
- Parallel Computation of Congruent Regions on SIMD MachinesChang-Sung Jeong, Sun-Mi Kim, Seung-Bong Baek. 123-126
- Exploiting Data Exchange Patterns in Creating Objects for NUMA Shared Virtual Memory SystemsJayashree Ramanathan, Lionel M. Ni. 124-131
- Efficient Parallel Algorithms for Some Geometric Problems on Reconfigurable MeshJu-wook Jang, Viktor K. Prasanna. 127-130
- Expanded Delta Networks for Verry Large Parallel ComputersBrian D. Alleyne, Isaac D. Scherson. 127-131
- Boolean Combinations of Polygons in ParallelChandrasekhar Narayanaswami, Wm. Randolph Franklin. 131-135
- Transmission Times in Unbuffered Crossbars with Cyclic ArbitrationA. J. Field, Peter G. Harrison. 132-137
- Resource Placement in ::::k::::-Ary ::::n::::-CubesParameswaran Ramanathan, Suresh Chalasani. 133-140
- Constructing Voronoi Diagram of a Point Set on Mesh of TreesFenglien Lee, Si-Qing Zheng. 136-140
- Design of Efficient and Easily Routable Generalized ConnectorsChing-Yi Lee, A. Yavuz Oruç. 138-141
- On Efficient Distributed Elections in Clustered Chordal RingsYi Pan. 141-144
- Hybrid Task Decomposition for Particle-in-Cell Method on Message Passing SystemsSoo-Young Lee, Nasser G. Azari. 141-144
- Experiments with Shared Virtual Memory on a iPSC/2 HypercubeThierry Priol, Zakaria Lahjomri. 145-148
- An Optimal Parallel Algorithm for the Domatic Partition Problem on Interval GraphsMing-Shing Yu, Cheng-Hsing Yang. 146-152
- On Algorithms for Mutual Exclusion in Distributed SystemsKia Makki, Paul Banta, Ken Been, Niki Pissinou. 149-152
- Extending Multistage Interconnection Networks for MultitaskingYeimkuan Chang, Laxmi N. Bhuyan. 151-158
- A Performance Analysis of Time WarpNikos Krivossidis, Carl Tropper. 153-156
- Computing Prefixes on a Large Family of Interconnection TopologiesWen-Jing Hsu, Carl V. Page, Jen-Shiuh Liu. 153-159
- HAL: A High-Level Actor Language and Its Distributed ImplementationChristopher R. Houck, Gul Agha. 158-165
- On Rearrangeability of Omega-Omega NetworksAkram Abdennadher, Tse-Yun Feng. 159-165
- Optimal Parallel Algorithms for Some Problems on TreesMing-Shing Yu, Lin Yu Tseng, Jiunn-Horng Lin. 160-163
- Efficient Parallel Algorithms for Computing Articulation Points and Bridges of Interval GraphsCalvin Ching-Yuen Chen, Sajal K. Das. 164-167
- PAL: A Language for Parallel Asynchronous ComputationAmitabha Das, Louise E. Moser, P. M. Melliar-Smith. 166-173
- A Design for Self-Routing Nonblocking Interconnection NetworksAloke Guha. 166-169
- Asynchronous Communication of Multiple Markov Chains in Parallel Simulated AnnealingSoo-Young Lee, Kyung-Geun Lee. 169-176
- On Design and Performance Analysis of a Superscalar ArchitectureTakaaki Kato, Koji Suginuma, Nader Bagherzadeh. 171-178
- Common Subexpression InductionHenry G. Dietz. 174-182
- Efficient Parallelization of Simulated Annealing Using Multiple Markov Chains: An Application to Graph PartitioningKyung-Geun Lee, Soo-Young Lee. 177-180
- A Tagflow Architecture that Supports Dataflow and Strict-Sequential Instruction SchedulingYang-Chang Hong, Chihping Wang. 179-187
- Solving a Two-Dimensional Knapsack Problem on SIMD ComputersDarrell R. Ulm, Pearl Y. Wang. 181-184
- A Taxonomy of User-Annotated Programs for Distributed Memory ComputersHenry Thomas, Henk J. Sips, Edwin M. R. M. Paalvast. 184-191
- Application of a Parallel Heuristic Framework to the Set Covering ProblemIra Pramanick. 185-189
- Parallel Statistical Selection in MultiprocessorsArthur Ieumwananonthachai, Benjamin W. Wah. 190-194
- A General Framework for Analyzing Shared-Memory Parallel ProgramsJyh-Herng Chow, Williams Ludwell Harrison III. 192-199
- Low Cost Concurrent Error Detection in a VLIW Architecture Using Replicated InstructionsJohn G. Holm, Prithviraj Banerjee. 192-195
- The Signal Flow Model: A novel Data Driven Approach to Parallel ProcessingMuhammad F. Mudawwar, C. Y. Roger Chen. 196-200
- Message Ordering in Multiprocessors with Synchronous CommunicationMarios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz. 196-203
- Static Inter-Module Analysis for Determining Processor Co-ResidencyCarole M. McNamee, Ronald A. Olsson. 200-207
- Compile Time Parallel Resource Allocation for Unbounded Tree Structure Task GraphsJeff Baxter, Balkrishna Ramkumar, Janak H. Patel. 202-209
- Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal StorageRobert Cypher, Luis Gravano. 204-211
- Log Time Parsing on the MasPar MP-1Randall A. Helzerman, Mary P. Harper. 209-217
- Algorithm-Architecture Mapping Using Hypergraphs: Theory and Experimental ResultsJuan Li, Leah H. Jamieson. 210-219
- On Fault-Tolerant Routing in Interconnection DigraphsAbhijit Sengupta, Charles D. Elfe. 212-215
- An Efficient Heuristic for Application-Specific Routing on Mesh Connected MulticomputersXiaoxiong Zhong, Virginia Mary Lo. 216-219
- Experience with a Tuple-Space Approach for Parallel Compilation of LR LanguagesScott R. Cannon. 218-225
- Efficient Interprocessor Synchronization/Communication on a Dataflow Multiprocessor ArchitectureJean-Marc Monti, Guang R. Gao. 220-223
- Parallel Algorithms for PM2B-ASCEND Computations on a SIMD Hypercube Using Multiple Levels of Iteration-GroupingDavid Nassimi. 221-228
- Network Parallel Computing with a Command InterpreterPing-Sheng Tseng. 226-232
- A Scheduling Principle for Precedence Graphs with Communication DelayRamakrishna Thurimella, Yaacov Yesha. 229-236
- On the Viability of a Quantitative Model of System Reconfiguration Due to a FaultGene Saghi, Howard Jay Siegel, José A. B. Fortes. 233-242
- Analyzing Tradeoffs between Temporary Consistency and Concurrency with Rollbacks and AbortsDeron Liang, Satish K. Tripathi. 234-241
- Design of Time-Optimal Hardware-Efficient Divide-and-Conquer AlgorithmsHarish Sethu, Meghanad D. Wagh. 237-240
- Executing Nested Parallel Loops on Shared-Memory MultiprocessorsSadun Anik, Wen-mei W. Hwu. 241-244
- Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait SynchronizationRobert H. B. Netzer, Sanjoy Ghosh. 242-246
- Fault-Tolerant Self-Routing Permutation NetworksHasan Cam, José A. B. Fortes. 243-247
- Performance Prediction Based on Gate to Processor RatioMoon-Jung Chung, Yunmo Chung. 246-253
- Directed Tracing to Detect Race ConditionsEmmi Schatz, Barbara G. Ryder. 247-250
- Reliability of Multiple Bus Multiprocessor SystemsShakil Akhtar. 248-252
- Eager Sharing fo Efficient Massive ParallelismLarry D. Wittie, Gudjon Hermannsson, Ai Li. 251-255
- On Fault-Tolerant Computation of Orthogonal Transforms on Hypercube ComputersQing Yang, Hong Wang 0003. 253-256
- Discrete Event Simulation on Shared Memory Multiprocessors Using Global Simulation InformationJiajen M. Lin, Santosh G. Abraham. 254-261
- Mutation Testing of Software Using MIMD ComputerA. Jefferson Offutt, Roy P. Pargas, Scott V. Fichter, Prashant K. Khambekar. 257-266
- A Parallel Logic Simulation Algorithm Based on QueryTomohiro Kudoh, Tetsuro Kimura, Hideharu Amano, Takuya Terasawa. 262-266
- Design Methodology for Fault-Tolerant Systolic Array ArchitecturesMichael Ogbonna Esonu, Asim J. Al-Khalili, Salim Hariri. 267-274
- An Improved Parallel Processing Fault Simulator Algorithm: PLAtoA. Cruz, D. Sarma. 267-270
- Preemptive Scheduling of Independent Jobs on Partitionable Parallel ArchitecturesRamesh Krishnamurti, Bhagirath Narahari. 268-275
- Markov Analysis of Multiple-Disk Prefetching for External MergesortVinay S. Pai, Alejandro A. Schäffer, Peter J. Varman. 272-279
- Hnet: A High-performance Network Evaluation TestbedDavid Smitley, Frank F. Hady, Dan Burns. 276-279
- Compile-time Techniques for Processor Allocation in Macro Dataflow Graphs for MultiprocessorsG. N. Srinivasa Prasanna, Anant Agarwal. 279-283
- Fault-Tolerant Sorting Algorithm on Hypercube MulticomputersJang-Ping Sheu, Yuh-Shyan Chen, Chih-Yung Chang. 280-284
- A Preliminary Performance Evaluation of the Seamless Parallel Processing System ArchitectureSamuel A. Fineberg, Thomas L. Casavant. 280-284
- Perfectly Overlapped Sorting on a Linear ArrayYen-Chun Lin. 285-288
- Effects of Cache Traffic on Shared Bus Multiprocessor SystemsChung-Ho Chen, Arun K. Somani. 285-288
- Adaptive Binary Sorting Schemes and Associated Interconnection NetworksMinze V. Chien, A. Yavuz Oruç. 289-293
- The Synthesis of Array Functions and Its Use in Parallel ComputationDz-ching Ju, Chuan-lin Wu, Paul R. Carini. 293-296
- Constructing Height-Balanced Trees in ParallelNarsingh Deo, Amit Jain, Muralidhar Medidi. 297-300
- An Efficient Global Resource Constrained Technique for Exploiting Instruction Level ParallelismAlexandru Nicolau, Steven Novack. 297-301
- Array Covering: A Technique4 for Enabling Lloop ParallelizationViet N. Ngo, Gary Elsesser, Sourav Bhattacharya, Wei-Tek Tsai. 302-305
- Image Shrinking and Expanding on a PyramidJing-Fu Fu Jenq, Sartaj Sahni. 302-309
- A High Dimensional Array Assignment Method for Parallel Computing SystemsJianzhong Li, Jaideep Srivastava. 306-310
- Effect of Communication in a Parallel Genetic AlgorithmVenkataramana Kommu, Irith Pomeranz. 310-317
- Designing Conceptual Clustering for Parallel ImplementationPeter Wohl, Thomas W. Christopher. 318-325
- An Optimal Parallel Algorithm for a Core of a TreeWin-Tsung Lo, Shietung Peng. 326-329
- An Efficient Parallel Algorithm for Finding Compact SetsEliezer Dekel, Jie Hu, Wen Ouyang. 331-337
- Quick Determination of Subcubes in a Faulty HypercubeHsing-Lung Chen, Nian-Feng Tzeng. 338-345
- On the Availability of Parallel Protocol-Processing SystemsYennun Huang, T. V. Lakshman, Dipak Ghosal. 351-354
- Compacting Free Buddy Subcubes in a HypercubeYoung Man Kim, Ten-Hwang Lai, Yu-Chee Tseng. 355-358