


default search action
1. ISPAN 1994: Kanazawa, Japan
- International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 1994, Kanazawa, Japan, December 14-16, 1994. IEEE Computer Society 1994, ISBN 0-8186-6507-6

- Howard Jay Siegel, John K. Antonio:

Views of mixed-mode computing and network evaluation. 1-8 - K. P. Lam:

A massively parallel implementation of pattern classifiers on SIMD and MIMD architectures. 9-16 - Lilla Böröczky, Paolo Cremonesi, Nello Scarabottolo:

Texture analysis for image processing on general-purpose parallel machines. 17-24 - Erich Schikuta

:
Parallel relational database algorithms revisited for range declustered data sets. 25-32 - Dang Van Hung:

An algorithm for maintaining consistent view of processes in distributed systems. 33-40 - Antonio Fernández, Kemal Efe

:
Bounds on the VLSI layout complexity of homogeneous product networks. 41-48 - Prasad R. Chalasani, Krishnaiyan Thulasiraman, M. A. Corneau:

Integrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm. 49-56 - Gen-Huey Chen, Hui-Ling Huang:

Cube-connected modules: a family of cubic networks. 57-64 - Frederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr.:

Building a better butterfly: the multiplexed metabutterfly. 65-72 - Jung-Heum Park, Kyung-Yong Chwa:

Recursive circulant: a new topology for multicomputer networks (extended abstract). 73-80 - R. F. Holt, Anthonie B. Ruighaver:

Performance of 4-dimensional PANDORA networks. 81-88 - Chi-Su Wang, Ruay Shiung Chang:

Parallel maximal cliques algorithms for interval graphs with applications. 89-96 - Yi-Wen Chen, Shi-Jinn Horng, Tzong-Wann Kao, Horng-Ren Tsai, Shun-Shan Tsai:

Parallel connectivity algorithms on permutation graphs. 97-104 - Lin Chen:

Parallel graph isomorphism detection with identification matrices. 105-112 - Felix P. Muga II:

Undirected circulant graphs. 113-118 - Kuei-Ming Lu, Keikichi Tamaru:

Processing nested loop structure with data-flow dependence on a CAM-based processor HAPP. 119-126 - Masayuki Katahira, Takehito Sasaki, Hong Shen, Hiroaki Kobayashi, Tadao Nakamura:

Software pipelining for Jetpipeline architecture. 127-134 - Yuetsu Kodama, Hirofumi Sakane, Mitsuhisa Sato, Shuichi Sakai, Yoshinori Yamaguchi:

Message-based efficient remote memory access on a highly parallel computer EM-X. 135-142 - Vipul Gupta, Eugen Schenfeld:

Combining message switching with circuit switching in the Interconnection Cached Multiprocessor Network. 143-150 - Sung-Ryul Kim, Kunsoo Park, Yookun Cho:

An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem. 151-158 - Aohan Mei, Yoshihide Igarashi:

A shortest path algorithm for banded matrices by a mesh connection without processor penalty. 159-166 - Xiao Zhou, Takao Nishizeki:

Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees. 167-174 - Claude G. Diderich, Marc Gengler, Stéphane Ubéda:

An efficient algorithm for solving the token distribution problem on k-ary d-cube networks. 175-182 - Guo-Jie Li:

NCIC's research and development in parallel processing. 183-188 - Qian-Ping Gu, Shietung Peng:

Advanced fault tolerant routing in hypercubes. 189-196 - Ramaraghavan Srinivasan, Vipin Chaudhary, Syed Masud Mahmud:

Contention sensitive fault-tolerant routing algorithms for hypercubes. 197-204 - Chu-Sing Yang, Shun-Yue Wu:

Cost-effective global fault-tolerant multiprocessors. 205-213 - Suresh Chalasani, Rajendra V. Boppana:

Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements. 214-221 - Satoshi Fujita, Masafumi Yamashita, Tadashi Ae:

Gossiping on mesh-bus computers by packets. 222-229 - Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos:

Optimal total exchange in linear arrays and rings. 230-237 - David S. L. Wei:

Quicksort and permutation routing on the hypercube and de Bruijn networks. 238-245 - Ravi Prakash, Dhabaleswar K. Panda:

Architectural issues in designing heterogeneous parallel systems with passive star-coupled optical interconnection. 246-253 - Hidehiko Tanaka:

Massively Parallel Processing Project as a Priority Area of Research for the Ministry of Education. 254-261 - Tadayuki Sakakibara, Katsuyoshi Kitai, Tadaaki Isobe, Shigeko Yazawa, Teruo Tanaka, Yoshiko Tamaki, Yasuhiro Inagami:

An interprocessor memory access arbitrating scheme for the S-3800 vector supercomputer. 262-269 - Tzi-cker Chiueh, Manish Verma, Sanjay A. Padubidri:

Efficient implementation techniques for vector memory systems. 270-277 - J. S. Lin, Fang-Rong Hsu, Richard C. T. Lee:

A parallel algorithm for the single step searching problem. 278-285 - Yong Meng Teo, Seng Chuan Tay:

Efficient algorithms for conservative parallel simulation of interconnection networks. 286-293 - Kuninobu Tanno, Akio Koyama, Said Mirza, Toshihiro Taketa, Syoichi Noguchi:

Performance evaluation of high-speed self-token ring LAN. 294-301 - Zsehong Tsai, Kangyei Yu, Feipei Lai:

A performance evaluation procedure for a class of growable ATM switches. 302-309 - Yulu Yang, Hideharu Amano:

Message transfer algorithms on the recursive diagonal torus. 310-317 - Kazuhiro Muramatsu, Shun Doi, Takumi Washio, Toshiyuki Nakata:

Cenju-3 parallel computer and its application to CFD. 318-325 - Chouki Aktouf, Oum-El-Kheir Benkahla, Chantal Robach:

Distributed validation of massively parallel machines. 326-333 - Glenn Jennings:

Compiler-chosen operator granularity in a functionally-programmed tagged token architecture. 334-341 - Ho-fung Leung, Bo-Ming Tong:

A logic semantics for a class of nondeterministic concurrent constraint logic programs. 342-349 - Thomas F. Knight Jr.:

Transit: reliable high speed interconnection technology. 350-357 - Xiao Sun, Fabrizio Lombardi:

Matrix multiplication on the MasPar using distance insensitive communication schemes. 358-365 - Vijay K. Jain, A. D. Snider:

Mathematic-physical engine: parallel processing for modeling and simulation of physical phenomena. 366-373 - Shousheng He, Mats Torkelson:

A systolic array implementation of common factor algorithm to compute DFT. 374-381 - Peter Sanders:

A detailed analysis of random polling dynamic load balancing. 382-389 - Dingchao Li, Hiromitsu Takagi, Naohiro Ishii:

Increase analysis in the total execution time of a parallel program. 390-397 - Michael A. Palis, Jing-Chiou Liou, David S. L. Wei:

A greedy task clustering heuristic that is provably good. 398-405 - Chengjiang Lin, Sanli Li:

Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systems. 406-412 - Ardsher Ahmed:

A novel hypercube with lower latency. 413-420 - Vladimir Beletsky, T. Popova, Alexander Chemeris:

Organization of a parallel virtual machine. 421-426 - Kei Hiraki, Hideharu Amano, Morihiro Kuga, Toshinori Sueyoshi, Tomohiro Kudoh, Hiroshi Nakashima, Hironori Nakajo, Hideo Matsuda, Takashi Matsumoto, Shin-ichiro Mori:

Overview of the JUMP-1, an MPP prototype for general-purpose parallel computations. 427-434 - Nobuo Saito, Hideyuki Tokuda, Tatsuya Hagino, Shuichi Oikawa, Akinori Yonezawa, Satoshi Matsuoka, Shigekazu Inohara, Yoshikatsu Tada, Hideki Sunahara, Shuji Ishii, Etsuya Shibayama, Yoichi Shinoda:

Comprehensive operating system for highly parallel machine. 435-442 - Makoto Amamiya, Masahiko Satoh, Akifumi Makinouchi, Ken-Ichi Hagiwara, Taiichi Yuasa, Hitoshi Aida, Kazunori Ueda, Keijiro Araki, Tetsuo Ida, Takanobu Baba:

Research on programming languages for massively parallel processing. 443-450

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














