An adaptable cluster structure of (SM)2 -II

Chizuko Saito; Hideharu Amano; Tomohiro Kudoh; Hideo Aiso

doi:10.1007/3-540-16811-7_153

An adaptable cluster structure of (SM)² -II

Chizuko Saito, Hideharu Amano, Tomohiro Kudoh, Hideo Aiso

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

In analyzing electronic circuits, it is usually necessary to solve a sparse coefficient matrix comprised of simultaneous linear equations. In order to treat these problems effectively, we have developed a dedicated parallel machine called (sm)²-II (’the Sparse Matrix Solving Machine’ version II). (sm)²-II is composed of multiple clusters, each consisting of multiple PUs (Processing Units) connected by a special communication mechanism called RSM (Receiver Selectable Multicast). Here, we propose an adaptive cluster structure and evaluate its performance. The characteristics of typical problems are analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.

Original language	English
Title of host publication	CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings
Editors	Wolfgang Handler, Rolf Jeltsch, Otto Lange, Dieter Haupt, Wilfried Juling
Publisher	Springer Verlag
Pages	53-60
Number of pages	8
ISBN (Print)	9783540168119
DOIs	https://doi.org/10.1007/3-540-16811-7_153
Publication status	Published - 1986 Jan 1
Event	2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986 - Aachen, Germany Duration: 1986 Sept 17 → 1986 Sept 19

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	237 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986
Country/Territory	Germany
City	Aachen
Period	86/9/17 → 86/9/19

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-16811-7_153

Cite this

Saito, C., Amano, H., Kudoh, T., & Aiso, H. (1986). An adaptable cluster structure of (SM)² -II. In W. Handler, R. Jeltsch, O. Lange, D. Haupt, & W. Juling (Eds.), CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings (pp. 53-60). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 237 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-16811-7_153

An adaptable cluster structure of (SM)² -II. / Saito, Chizuko; Amano, Hideharu; Kudoh, Tomohiro et al.
CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings. ed. / Wolfgang Handler; Rolf Jeltsch; Otto Lange; Dieter Haupt; Wilfried Juling. Springer Verlag, 1986. p. 53-60 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 237 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Saito, C, Amano, H, Kudoh, T & Aiso, H 1986, An adaptable cluster structure of (SM)² -II. in W Handler, R Jeltsch, O Lange, D Haupt & W Juling (eds), CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 237 LNCS, Springer Verlag, pp. 53-60, 2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986, Aachen, Germany, 86/9/17. https://doi.org/10.1007/3-540-16811-7_153

Saito C, Amano H, Kudoh T, Aiso H. An adaptable cluster structure of (SM)² -II. In Handler W, Jeltsch R, Lange O, Haupt D, Juling W, editors, CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings. Springer Verlag. 1986. p. 53-60. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-16811-7_153

Saito, Chizuko ; Amano, Hideharu ; Kudoh, Tomohiro et al. / An adaptable cluster structure of (SM)² -II. CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings. editor / Wolfgang Handler ; Rolf Jeltsch ; Otto Lange ; Dieter Haupt ; Wilfried Juling. Springer Verlag, 1986. pp. 53-60 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ec1e130ba6954367bd29b572d3f534bf,

title = "An adaptable cluster structure of (SM)2 -II",

abstract = "In analyzing electronic circuits, it is usually necessary to solve a sparse coefficient matrix comprised of simultaneous linear equations. In order to treat these problems effectively, we have developed a dedicated parallel machine called (sm)2-II ({\textquoteright}the Sparse Matrix Solving Machine{\textquoteright} version II). (sm)2-II is composed of multiple clusters, each consisting of multiple PUs (Processing Units) connected by a special communication mechanism called RSM (Receiver Selectable Multicast). Here, we propose an adaptive cluster structure and evaluate its performance. The characteristics of typical problems are analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.",

author = "Chizuko Saito and Hideharu Amano and Tomohiro Kudoh and Hideo Aiso",

year = "1986",

month = jan,

day = "1",

doi = "10.1007/3-540-16811-7_153",

language = "English",

isbn = "9783540168119",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "53--60",

editor = "Wolfgang Handler and Rolf Jeltsch and Otto Lange and Dieter Haupt and Wilfried Juling",

booktitle = "CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings",

note = "2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986 ; Conference date: 17-09-1986 Through 19-09-1986",

}

TY - GEN

T1 - An adaptable cluster structure of (SM)2 -II

AU - Saito, Chizuko

AU - Amano, Hideharu

AU - Kudoh, Tomohiro

AU - Aiso, Hideo

PY - 1986/1/1

Y1 - 1986/1/1

N2 - In analyzing electronic circuits, it is usually necessary to solve a sparse coefficient matrix comprised of simultaneous linear equations. In order to treat these problems effectively, we have developed a dedicated parallel machine called (sm)2-II (’the Sparse Matrix Solving Machine’ version II). (sm)2-II is composed of multiple clusters, each consisting of multiple PUs (Processing Units) connected by a special communication mechanism called RSM (Receiver Selectable Multicast). Here, we propose an adaptive cluster structure and evaluate its performance. The characteristics of typical problems are analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.

AB - In analyzing electronic circuits, it is usually necessary to solve a sparse coefficient matrix comprised of simultaneous linear equations. In order to treat these problems effectively, we have developed a dedicated parallel machine called (sm)2-II (’the Sparse Matrix Solving Machine’ version II). (sm)2-II is composed of multiple clusters, each consisting of multiple PUs (Processing Units) connected by a special communication mechanism called RSM (Receiver Selectable Multicast). Here, we propose an adaptive cluster structure and evaluate its performance. The characteristics of typical problems are analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.

UR - http://www.scopus.com/inward/record.url?scp=84909753805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84909753805&partnerID=8YFLogxK

U2 - 10.1007/3-540-16811-7_153

DO - 10.1007/3-540-16811-7_153

M3 - Conference contribution

AN - SCOPUS:84909753805

SN - 9783540168119

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 53

EP - 60

BT - CONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings

A2 - Handler, Wolfgang

A2 - Jeltsch, Rolf

A2 - Lange, Otto

A2 - Haupt, Dieter

A2 - Juling, Wilfried

PB - Springer Verlag

T2 - 2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986

Y2 - 17 September 1986 through 19 September 1986

ER -