IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2005-08-22 13:00
On Approximate Computation of MaxPARAdeg for Acyclic Well-Structured Data-Flow Program Nets
Tomohiro Takai, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ)
Abstract (in Japanese) (See Japanese page) 
(in English) This paper discusses approximate computation of the maximum degree of parallelism, denoted $MaxPARAdeg$, for a subclass of dataflow program nets with SWITCH-nodes, called acyclic well-structured nets. We first show the definition and properties of acyclic well-structured nets. It is intractable to compute $MaxPARAdeg$ for acyclic well-structured nets. Thus we propose an approximate algorithm to compute $MaxPARAdeg$. Finally, we evaluate the approximate algorithm by comparing its approximate values with exact values of $MaxPARAdeg$ for 150 acyclic well-structured nets. The results show that our approximate algorithm is reasonable from the viewpoint of accuracy and computation time.
Keyword (in Japanese) (See Japanese page) 
(in English) data-flow program / program net / parallel degree / SWITCH-node / approximate algorithm / / /  
Reference Info. IEICE Tech. Rep., vol. 105, Aug. 2005.
Paper #  
Date of Issue 2005-08-15 (CST) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee MSS  
Conference Date 2005-08-22 - 2005-08-22 
Place (in Japanese) (See Japanese page) 
Place (in English) Aichi Prefectural University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Concurrent systems, etc. 
Paper Information
Registration To MSS 
Conference Code 2005-08-CST 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Approximate Computation of MaxPARAdeg for Acyclic Well-Structured Data-Flow Program Nets 
Sub Title (in English)  
Keyword(1) data-flow program  
Keyword(2) program net  
Keyword(3) parallel degree  
Keyword(4) SWITCH-node  
Keyword(5) approximate algorithm  
1st Author's Name Tomohiro Takai  
1st Author's Affiliation Yamaguchi University (Yamaguchi Univ)
2nd Author's Name Shingo Yamaguchi  
2nd Author's Affiliation Yamaguchi University (Yamaguchi Univ)
3rd Author's Name Qi-Wei Ge  
3rd Author's Affiliation Yamaguchi University (Yamaguchi Univ)
4th Author's Name Minoru Tanaka  
4th Author's Affiliation Yamaguchi University (Yamaguchi Univ)
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2005-08-22 13:00:00 
Presentation Time 25 minutes 
Registration for MSS 
Paper # CST2005-14 
Volume (vol) vol.105 
Number (no) no.237 
Page pp.1-6 
Date of Issue 2005-08-15 (CST) 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan