Abstract
For effective use of parallelizing compilers, an interactive environment which allows users to instruct the way of parallelization is needed. As the first step to build such an environment, we have developped a program visualization system named Nara View. The system provides two powerful methods for 3D visualization of program structure and data dependence. 3D visualization of program structure illustrates a hierarchical loop structure of given programs and suggests which parts of the program have been parallelized. 3D visualization of data dependence explains each data dependence on any variable or array element which is accessed at a specific loop. By using these methods, users can easily understand which part of the program should be more parallelized. We also show several examples to demonstrate the efficiency of these methods.
Original language | English |
---|---|
Title of host publication | High Performance Computing - International Symposium, ISHPC 1997, Proceedings |
Editors | Keijiro Araki, Makoto Amamiya, Constantine Polychronopoulos, Kazuki Joe |
Publisher | Springer Verlag |
Pages | 231-242 |
Number of pages | 12 |
ISBN (Print) | 3540637664, 9783540637660 |
DOIs | |
Publication status | Published - Jan 1 1997 |
Event | International Symposium on High Performance Computing, ISHPC 1997 - Fukuoka, Japan Duration: Nov 4 1997 → Nov 6 1997 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1336 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | International Symposium on High Performance Computing, ISHPC 1997 |
---|---|
Country | Japan |
City | Fukuoka |
Period | 11/4/97 → 11/6/97 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Naraview : An interactive 3d visualization system for parallelization of programs. / Sasakura, Mariko; Joe, Kazuki; Araki, Keijiro.
High Performance Computing - International Symposium, ISHPC 1997, Proceedings. ed. / Keijiro Araki; Makoto Amamiya; Constantine Polychronopoulos; Kazuki Joe. Springer Verlag, 1997. p. 231-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1336).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Naraview
T2 - An interactive 3d visualization system for parallelization of programs
AU - Sasakura, Mariko
AU - Joe, Kazuki
AU - Araki, Keijiro
PY - 1997/1/1
Y1 - 1997/1/1
N2 - For effective use of parallelizing compilers, an interactive environment which allows users to instruct the way of parallelization is needed. As the first step to build such an environment, we have developped a program visualization system named Nara View. The system provides two powerful methods for 3D visualization of program structure and data dependence. 3D visualization of program structure illustrates a hierarchical loop structure of given programs and suggests which parts of the program have been parallelized. 3D visualization of data dependence explains each data dependence on any variable or array element which is accessed at a specific loop. By using these methods, users can easily understand which part of the program should be more parallelized. We also show several examples to demonstrate the efficiency of these methods.
AB - For effective use of parallelizing compilers, an interactive environment which allows users to instruct the way of parallelization is needed. As the first step to build such an environment, we have developped a program visualization system named Nara View. The system provides two powerful methods for 3D visualization of program structure and data dependence. 3D visualization of program structure illustrates a hierarchical loop structure of given programs and suggests which parts of the program have been parallelized. 3D visualization of data dependence explains each data dependence on any variable or array element which is accessed at a specific loop. By using these methods, users can easily understand which part of the program should be more parallelized. We also show several examples to demonstrate the efficiency of these methods.
UR - http://www.scopus.com/inward/record.url?scp=84958623151&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84958623151&partnerID=8YFLogxK
U2 - 10.1007/BFb0024219
DO - 10.1007/BFb0024219
M3 - Conference contribution
AN - SCOPUS:84958623151
SN - 3540637664
SN - 9783540637660
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 231
EP - 242
BT - High Performance Computing - International Symposium, ISHPC 1997, Proceedings
A2 - Araki, Keijiro
A2 - Amamiya, Makoto
A2 - Polychronopoulos, Constantine
A2 - Joe, Kazuki
PB - Springer Verlag
ER -