Table of Contents

• Views of mixed-mode computing and network evaluationHoward Jay Siegel, John K. Antonio. 1-8 [doi]
• A massively parallel implementation of pattern classifiers on SIMD and MIMD architecturesK. P. Lam. 9-16 [doi]
• Texture analysis for image processing on general-purpose parallel machinesLilla Böröczky, Paolo Cremonesi, Nello Scarabottolo. 17-24 [doi]
• Parallel relational database algorithms revisited for range declustered data setsErich Schikuta. 25-32 [doi]
• An algorithm for maintaining consistent view of processes in distributed systemsDang Van Hung. 33-40 [doi]
• Bounds on the VLSI layout complexity of homogeneous product networksAntonio Fernández 0001, Kemal Efe. 41-48 [doi]
• Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithmPrasad R. Chalasani, Krishnaiyan Thulasiraman, M. A. Corneau. 49-56 [doi]
• Cube-connected modules: a family of cubic networksGen-Huey Chen, Hui-Ling Huang. 57-64 [doi]
• Building a better butterfly: the multiplexed metabutterflyFrederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr.. 65-72 [doi]
• Recursive circulant: a new topology for multicomputer networks (extended abstract)Jung-Heum Park, Kyung-Yong Chwa. 73-80 [doi]
• Performance of 4-dimensional PANDORA networksR. F. Holt, A. B. Ruighaver. 81-88 [doi]
• Parallel maximal cliques algorithms for interval graphs with applicationsChi-Su Wang, Ruay Shiung Chang. 89-96 [doi]
• Parallel connectivity algorithms on permutation graphsYi-Wen Chen, Shi-Jinn Horng, Tzong-Wann Kao, Horng-Ren Tsai, Shun-Shan Tsai. 97-104 [doi]
• Parallel graph isomorphism detection with identification matricesLin Chen 0001. 105-112 [doi]
• Undirected circulant graphsFelix P. Muga II. 113-118 [doi]
• Processing nested loop structure with data-flow dependence on a CAM-based processor HAPPKuei-Ming Lu, Keikichi Tamaru. 119-126 [doi]
• Software pipelining for Jetpipeline architectureMasayuki Katahira, Takehito Sasaki, Hong Shen, Hiroaki Kobayashi, Tadao Nakamura. 127-134 [doi]
• Message-based efficient remote memory access on a highly parallel computer EM-XYuetsu Kodama, Hirofumi Sakane, Mitsuhisa Sato, Shuichi Sakai, Yoshinori Yamaguchi. 135-142 [doi]
• Combining message switching with circuit switching in the Interconnection Cached Multiprocessor NetworkVipul Gupta, Eugen Schenfeld. 143-150 [doi]
• An O(log N log log N) time RMESH algorithm for the simple polygon visibility problemSung-Ryul Kim, Kunsoo Park, Yookun Cho. 151-158 [doi]
• A shortest path algorithm for banded matrices by a mesh connection without processor penaltyAohan Mei, Yoshihide Igarashi. 159-166 [doi]
• Optimal parallel algorithm for edge-coloring partial k-trees with bounded degreesXiao Zhou, Takao Nishizeki. 167-174 [doi]
• An efficient algorithm for solving the token distribution problem on k-ary d-cube networksClaude G. Diderich, Marc Gengler, Stéphane Ubéda. 175-182 [doi]
• NCIC's research and development in parallel processingGuo-Jie Li. 183-188 [doi]
• Advanced fault tolerant routing in hypercubesQian-Ping Gu, Shietung Peng. 189-196 [doi]
• Contention sensitive fault-tolerant routing algorithms for hypercubesRamaraghavan Srinivasan, Vipin Chaudhary, Syed Masud Mahmud. 197-204 [doi]
• Cost-effective global fault-tolerant multiprocessorsChu-Sing Yang, Shun-Yue Wu. 205-213 [doi]
• Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirementsSuresh Chalasani, Rajendra V. Boppana. 214-221 [doi]
• Gossiping on mesh-bus computers by packetsSatoshi Fujita, Masafumi Yamashita, Tadashi Ae. 222-229 [doi]
• Optimal total exchange in linear arrays and ringsVassilios V. Dimakopoulos, Nikitas J. Dimopoulos. 230-237 [doi]
• Quicksort and permutation routing on the hypercube and de Bruijn networksDavid S. L. Wei. 238-245 [doi]
• Architectural issues in designing heterogeneous parallel systems with passive star-coupled optical interconnectionRavi Prakash, Dhabaleswar K. Panda. 246-253 [doi]
• Massively Parallel Processing Project as a Priority Area of Research for the Ministry of EducationHidehiko Tanaka. 254-261 [doi]
• An interprocessor memory access arbitrating scheme for the S-3800 vector supercomputerTadayuki Sakakibara, Katsuyoshi Kitai, Tadaaki Isobe, Shigeko Yazawa, Teruo Tanaka, Yoshiko Tamaki, Yasuhiro Inagami. 262-269 [doi]
• Efficient implementation techniques for vector memory systemsTzi-cker Chiueh, Manish Verma, Sanjay A. Padubidri. 270-277 [doi]
• A parallel algorithm for the single step searching problemJ. S. Lin, Fang-Rong Hsu, Richard C. T. Lee. 278-285 [doi]
• Efficient algorithms for conservative parallel simulation of interconnection networksYong Meng Teo, Seng Chuan Tay. 286-293 [doi]
• Performance evaluation of high-speed self-token ring LANKoichi Tanno, Akio Koyama, S. Mirza, T. Taketa, Shoichi Noguchi. 294-301 [doi]
• A performance evaluation procedure for a class of growable ATM switchesZsehong Tsai, Kangyei Yu, Feipei Lai. 302-309 [doi]
• Message transfer algorithms on the recursive diagonal torusYulu Yang, Hideharu Amano. 310-317 [doi]
• Cenju-3 parallel computer and its application to CFDKazuhiro Muramatsu, Shun Doi, Takumi Washio, Toshiyuki Nakata. 318-325 [doi]
• Distributed validation of massively parallel machinesChouki Aktouf, Oum-El-Kheir Benkahla, Chantal Robach. 326-333 [doi]
• Compiler-chosen operator granularity in a functionally-programmed tagged token architectureGlenn Jennings. 334-341 [doi]
• A logic semantics for a class of nondeterministic concurrent constraint logic programsHo-Fung Leung, Bo-Ming Tong. 342-349 [doi]
• Transit: reliable high speed interconnection technologyThomas F. Knight Jr.. 350-357 [doi]
• Matrix multiplication on the MasPar using distance insensitive communication schemesXiao Sun 0002, Fabrizio Lombardi. 358-365 [doi]
• Mathematic-physical engine: parallel processing for modeling and simulation of physical phenomenaVijay K. Jain, A. D. Snider. 366-373 [doi]
• A systolic array implementation of common factor algorithm to compute DFTShousheng He, Mats Torkelson. 374-381 [doi]
• A detailed analysis of random polling dynamic load balancingPeter Sanders. 382-389 [doi]
• Increase analysis in the total execution time of a parallel programDingchao Li, H. Takagi, Naohiro Ishii. 390-397 [doi]
• A greedy task clustering heuristic that is provably goodMichael A. Palis, Jing-Chiou Liou, David S. L. Wei. 398-405 [doi]
• Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systemsChengjiang Lin, Sanli Li. 406-412 [doi]
• A novel hypercube with lower latencyA. Ahmed. 413-420 [doi]
• Organization of a parallel virtual machineV. Beletsky, T. Popova, A. Chemeris. 421-426 [doi]
• Overview of the JUMP-1, an MPP prototype for general-purpose parallel computationsKei Hiraki, Hideharu Amano, Morihiro Kuga, Toshinori Sueyoshi, Tomohiro Kudoh, Hiroshi Nakashima, Hironori Nakajo, Hideo Matsuda, Takashi Matsumoto, Shin-ichiro Mori. 427-434 [doi]
• Comprehensive operating system for highly parallel machineNobuo Saito, Hideyuki Tokuda, Tatsuya Hagino, Shuichi Oikawa, Akinori Yonezawa, Satoshi Matsuoka, Shigekazu Inohara, Yoshikatsu Tada, Hideki Sunahara, Shuji Ishii, Etsuya Shibayama, Yoichi Shinoda. 435-442 [doi]
• Research on programming languages for massively parallel processingMakoto Amamiya, Masahiko Satoh, Akifumi Makinouchi, K. Hagiwara, Taiichi Yuasa, H. Aida, K. Ueda, Keijiro Araki, T. Ida, T. Baba. 443-450 [doi]