Abstract is missing.
- Deep Blue: One Small Step for a ComputerFeng-hsiung Hsu. 1 [doi]
- A New General Purpose Parallel Database SystemMohamad Afshar, J. Bates, Gavin M. Bierman, K. Moody. 2-8 [doi]
- A Parallel Pipelined Renderer for Time-Varying Volume DataTzi-cker Chiueh, Kwan-Liu Ma. 9-15 [doi]
- A Polynomial Time Algorithm for Reconfiguring the 1 1/2 Track-Switch Model with PE and Bus faultsTadayoshi Horita, Itsuo Takanami. 16-22 [doi]
- BaLinda: a simple parallel programming model with active objectsC. K. Yuen, M. D. Feng. 23-29 [doi]
- Wavelength Division Multiple Access Ring - Virtual Topology on a Simple Ring NetworkXiaoshe Dong, Tomohiro Kudoh, Hideharu Amano. 30-36 [doi]
- Features of Optical Interconnects in Distributed-Shared Memory Organized MIMD Architectures: The Ultimate GoalEdward E. E. Frietman, Ramon J. Ernst, Roy E. Crosbie, Masao Shimoji. 37-43 [doi]
- Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical InterconnectionsShin ichiro Tago, Shuichi Ueno. 44-48 [doi]
- A Pipelined TDM Optical Bus with Improved PerformanceSi-Qing Zheng, Yueming Li. 49-55 [doi]
- Critical Sections and Producer/Consumer Queues in Weak Memory SystemsLisa Higham, Jalal Kawash. 56-63 [doi]
- A Scalable Cache Coherent Architecture for Large-Scale Mesh-Connected MultiprocessorsYunseok Rhee, Joonwon Lee. 64-70 [doi]
- The Architecture of OCMP and its EvaluationKeizo Saisho, Takeshi Sano, Keniti Iwata, Akira Fukuda. 71-77 [doi]
- Exploiting Global Data Locality in Non-Blocking Multithreaded ArchitecturesWen-Yen Lin, Jean-Luc Gaudiot. 78-84 [doi]
- A Fast Algorithm for Complete Subcube RecognitionHal Burch, Fikret Erçal. 85-90 [doi]
- An Implementable Dynamic Automatic Self-Stabilizing ProtocolOlivier Flauzac, Vincent Villain. 91-97 [doi]
- Cover Model: A Framework for Design and Execution of Distributed ApplicationsV. P. Ivannikov, K. V. Dyshlevoi, V. E. Kamensky, A. V. Klimov, S. G. Manzheley, V. A. Omelchenko, L. B. Solovskaya, A. A. Vinokurov. 98-104 [doi]
- An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-TreesAbul Kashem, Xiao Zhou, Takao Nishizeki. 105-111 [doi]
- Hamiltonian-Laceability of Star GraphsSun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho. 112-117 [doi]
- The Horizontal Rotate Crossed Cube HCQ Interconnection NetworkSusumu Horiguchi, Masayuki Konuki. 118-124 [doi]
- A new shortest path routing algorithm and embedding cycles of crossed cubeChien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu. 125-131 [doi]
- Algorithms and Lower Bounds for P-Gossiping in Circulant NetworksEmilia A. Monakhova. 132-137 [doi]
- Fiber-Ribbon Pipeline Ring Network for High-Performance Distributed Computing SystemsMagnus Jonsson, Bertil Svensson, Mikael Taveniku, Anders Ahlander. 138-143 [doi]
- On Deciding Granularity for Optimal Speedup for Solving Data Parallel Problems with Clustered Distributed ComputingJung-Sing Jwo, Yu Chin Cheng, Chin-Yun Hsieh. 144-149 [doi]
- A High Performance Dynamic Token-Based Distributed Synchronization AlgorithmAlexander I-Chi Lai, Chin-Laung Lei. 150-156 [doi]
- Hardware Synchronization of Massively Parallel Processes in Distributed SystemsMikhail Makhaniok, Reinhard Männer. 157-164 [doi]
- On The Shuffle-Exchange Permutation NetworkDouglas W. Bass, Ivan Hal Sudborough. 165-171 [doi]
- On the Power of the Mesh with Hybrid BusesBiing-Feng Wang, Stephan Olariu. 172-178 [doi]
- Fault-Tolerant Hypercubes with Small DegreeToshinori Yamada, Shuichi Ueno. 179-185 [doi]
- UHC - A Massively Parallel and Distributed Realisation of Hierarchical Classifier NetworksK. P. Lam. 186-189 [doi]
- Efficiency of remote access caches in future SMP-based CC-NUMA multiprocessors: initial resultsEdward D. Moreno, Sergio Takeo Kofuji. 190-197 [doi]
- Efficient Implementation of Software Release Consistency on Asymmetric Distributed Shared MemoryJunpei Niwa, Tatsushi Inagaki, Takashi Matsumoto, Kei Hiraki. 198-201 [doi]
- Pleiades: A Prototype of Inter-Processor Network Generation SystemKenji Sayano, Tomonori Shirakawa. 202-206 [doi]
- WWW-Oriented System for Visualization, Animation and Investigation of Mapping AlgorithmsO. G. Monakhov, O. J. Chunikhin. 207-210 [doi]
- Processor Allocation in k-ary n-cube MultiprocessorsPo-Jen Chuang, Chih-Ming Wu. 211-214 [doi]
- A parallel algorithm for embedding large pyramids into smaller hypercubes with load balancingY.-W. Chen, K.-L. Chung. 215-218 [doi]
- A Parallel Algorithm with Embedded Load Balancing for Autocorrelation Matrix ComputationS. R. Subramanya. 219-222 [doi]
- RMESH Algorithms for Parallel String MatchingHsi-Chieh Lee, Fikret Erçal. 223-226 [doi]
- Collecting Cyclic Garbage in Distributed SystemsXinfeng Ye, John A. Keane. 227-231 [doi]
- Approximation AlgorithmsRichard C. T. Lee. 232 [doi]
- New Partitioning Schemes for Parallel Modified Gram-Schmidt OrthogonalizationSuely Oliveira, Takako Soma. 233-239 [doi]
- An efficient parallel algorithm for the planar mincut linear arrangement problem for treesSung Kwon Kim. 240-246 [doi]
- Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWsKai Kwong Lau, M. J. Kumar, N. R. Achuthan. 247-253 [doi]
- Parallel Approaches for Discovering Functional Dependencies from Data for Information System Design RecoveryWie Ming Lim, John V. Harrison. 254-260 [doi]
- Supporting Parallel Processing on the RHODOS Cluster of WorkstationsMichael Hobbs, Andrzej M. Goscinski. 261-267 [doi]
- Minimizing Communication Conflicts with Load-Skewing Task Assignment Techniques on Network of WorkstationsWei Xie, Wei-Ming Lin. 268-274 [doi]
- Research on cluster of workstationsDingxing Wang, Weimin Zheng, Jianxin Xiong. 275-281 [doi]
- Speech Support in Wireless, Multihop NetworksHsiao-Kuang Wu, Chia-Heng Hung, Mario Gerla, Rajive Bagrodia. 282-288 [doi]
- CASS: an efficient task management system for distributed memory architecturesJing-Chiou Liou, Michael A. Palis. 289-295 [doi]
- An Adaptive Processor Allocation Strategy for Mesh-Connected SystemsKyung-Hee Seo, Sung-Chun Kim. 296-302 [doi]
- Design and Evaluation of A Submesh Allocation Scheme for Two-Dimensional Mesh-Connected Parallel ComputersJ. Morris Chang. 303-309 [doi]
- Processor Allocation in the Star Graph Using Sg-lattice ModelFan Wu, Ching-Chi Hsu. 310-316 [doi]
- Color Optimal Self-Stabilizing Depth-First Token CirculationFranck Petit, Vincent Villain. 317-323 [doi]
- Clock Snooping and its Application in on-the-fly Data Race DetectionKoenraad De Bosschere, Michiel Ronsse. 324-330 [doi]
- A Knowledge Base for the Optimization of Parallel Query Execution PlansErich Schikuta, Peter Kirkovits. 331-337 [doi]
- Efficient parallel multiselection on hypercubesHong Shen. 338-343 [doi]
- A Genetic Algorithm for Optimal 3-Connected Telecommunication Network DesignsRunhe Huang, Jianhua Ma, D. Frank Hsu. 344-350 [doi]
- A Fast Approximation Algorithm for Maximum-Leaf Spanning TreeHsueh-I Lu, R. Ravi. 351-356 [doi]
- Effects of Chromosome Migration on a Parallel and Distributed Genetic AlgorithmTakashi Matsumura, Morikazu Nakamura, D. Miyazata, J. Okech, Kenji Onaga. 357-361 [doi]
- Modular design of a large sorting networkN. K. Sharma. 362-368 [doi]
- An Evolutionary Approach for Scheduling in Parallel Processor SystemsAlbert Y. Zomaya, Chris Ward, Benjamin S. Macey. 369-375 [doi]
- A method for estimating optimal unrolling times for nested loopsAkira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa. 376-382 [doi]
- A Simulation Study of Dynamic Load Balancing for Network-based Parallel ProcessingWentong Cai, Bu-Sung Lee, Alfred Heng, Li Zhu. 383-389 [doi]
- An Operation Placement and Scheduling Scheme for Cache and Communication Localities in Fine-Grain Parallel ArchitecturesYen-Kuang Chen, S. Y. Kung. 390-396 [doi]
- A Fair Congestion Control Scheme for LAN Interconnection via ATMMing-Hsing Chiu, Mostafa A. Bassiouni. 397-403 [doi]
- Node-to-Node Cluster Fault Tolerant Routing in HypercubesQian-Ping Gu, Shietung Peng. 404-409 [doi]
- An efficient class of SEC-DED-AUED codesD. K. Bhattacharryya, S. Nandi. 410-416 [doi]
- Wide-diameter of generalized undirected de Bruijn graph UG/sub B/(n, n/sup 2/)H. E. Escuardro, Felix P. Muga II. 417-420 [doi]
- The diameter of the generalized de Bruijn graph UG/sub B/(n, n(n/sup 2/+1))L. R. Nochefranca, P. W. Sy. 421-423 [doi]
- Radix R Parallel FFT Algorithms with a Global Interconnection Networks and Its EvaluationToshihiro Taketa, Kuninobu Tanno, Susumu Horiguchi. 424-428 [doi]
- The Barrier Synchronization Impact on the MPI-Programs Performance Using a Cluster of WorkstationsMartha Torres, Sergio Takeo Kofuji. 429-432 [doi]
- Optimal Software Multicast on Wormhole Switch-based NetworksKuo-Pao Fan, Chung-Ta King. 433-436 [doi]
- Toward more advanced usage of instruction level parallelism by a very large data path processor architectureH. Tanaka. 437-443 [doi]
- Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus systemYi Pan, Keqin Li, Si-Qing Zheng. 444-450 [doi]
- Performance analysis for dynamic tree embedding in k-partite networks by random walkHong Shen, Keqin Li, Yi Pan, Gilbert H. Young, Si-Qing Zheng. 451-457 [doi]
- A built-in self-reconfigurable scheme for 3D mesh arraysItsuo Takanami, Tadayoshi Horita. 458-464 [doi]
- A tampering protocol for reducing the coherence transactions in regular computationMasaru Takesue. 465-471 [doi]
- Reliable broadcasting and secure distributing in channel networksFeng Bao, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi. 472-478 [doi]
- Bit-Parallel Selfrouting Optoelectronic Switching Fabrics for Massively Parallel Wide-Format Data Processing: Principle and Optical ArchitectureV. B. Fyodorov. 479-486 [doi]
- A Decentralized Scheme for Multi-Node Broadcasting on HypercubesYoshiyuki Hayakawa, Satoshi Fujita, Masafumi Yamashita. 487-493 [doi]
- Efficient Tree-based Multicast in Wormhole-Routed 2D MeshesJenq-Shyan Yang, Chung-Ta King. 494-500 [doi]