Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2009-01-29 13:00
On Upper and Lower Bounds of Optimal Execution Time of Task Graph by Considering Communication Delays
Takashi Otsuka, Masato Nakahara, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Yuu Moriyama, Hirotoshi Tonou (Fujitsu TEN Limited) CST2008-41
Abstract (in Japanese) (See Japanese page) 
(in English) This paper deals with upper and lower bounds of optimal execution time of task graphs that are supposed to be executed in a model of multiprocessor system, in which communication times are taken into account. We firstly define a path-dependent minimum subnet whose execution time is the shortest when executed by a single processor. Based on this definition, we then define a critical subnet of task graphs, which is the minimum subnet with the maximum execution time. Analyzing the properties of the minimum subnet and the critical subnet, we finally give the upper and lower bounds of optimal execution time of task graphs.
Keyword (in Japanese) (See Japanese page) 
(in English) multiprocessor scheduling / communication time / minimum subnet / critical subnet / upper bound / lower bound / /  
Reference Info. IEICE Tech. Rep., vol. 108, Jan. 2009.
Paper #  
Date of Issue 2009-01-22 (CST) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF CST2008-41

Conference Information
Committee MSS  
Conference Date 2009-01-29 - 2009-01-30 
Place (in Japanese) (See Japanese page) 
Place (in English) Kanagawa Industrial Promotion Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Concurrent Systems 
Paper Information
Registration To MSS 
Conference Code 2009-01-CST 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Upper and Lower Bounds of Optimal Execution Time of Task Graph by Considering Communication Delays 
Sub Title (in English)  
Keyword(1) multiprocessor scheduling  
Keyword(2) communication time  
Keyword(3) minimum subnet  
Keyword(4) critical subnet  
Keyword(5) upper bound  
Keyword(6) lower bound  
Keyword(7)  
Keyword(8)  
1st Author's Name Takashi Otsuka  
1st Author's Affiliation Yamaguchi University (Yamaguchi Univ.)
2nd Author's Name Masato Nakahara  
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 Mitsuru Nakata  
4th Author's Affiliation Yamaguchi University (Yamaguchi Univ.)
5th Author's Name Yuu Moriyama  
5th Author's Affiliation Fujitsu TEN Limited (Fujitsu TEN Limited)
6th Author's Name Hirotoshi Tonou  
6th Author's Affiliation Fujitsu TEN Limited (Fujitsu TEN Limited)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2009-01-29 13:00:00 
Presentation Time 25 minutes 
Registration for MSS 
Paper # CST2008-41 
Volume (vol) vol.108 
Number (no) no.415 
Page pp.1-4 
#Pages 4 
Date of Issue 2009-01-22 (CST) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan