| Presentation | 2004-10-28 Parallel Data Transfer Algorithm Enabling Minimum Application Turnaround Time Hiroshi YAMAMOTO, Masato TSURU, Yuji OIE, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In parallel computing based on the master/worker model in grid computing environment, in order to minimize the application turnaround time, some multiple-round scheduling algorithms have been proposed, in which the master dispatches its work to workers in a multiple round manner to overlap computation and communication. Those existing methods assume symmetrical environments where both the network attached by the master and that attached by workers have the same transmission capacity. However, in actual environments which have heteroge-neous capacities, the existing methods cannot minimize the turnaround time. Therefore, in this study, we propose a new scheduling algorithm which determines how to divide the application data to be processed, and when to send them to multiple workers by considering that the master can transfer them to multiple workers in parallel. It is analytically shown that this proposed algorithm can extremely reduce the adverse effect of the data transmission time between the master and workers on the application turnaround time, and can achieve the turnaround time close to the lower bound. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Master/Worker Model / Divisible Workload / UMR / Parallel Data Transfer |
| Paper # | IA2004-17 |
| Date of Issue |
| Conference Information | |
| Committee | IA |
|---|---|
| Conference Date | 2004/10/21(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Internet Architecture(IA) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Parallel Data Transfer Algorithm Enabling Minimum Application Turnaround Time |
| Sub Title (in English) | |
| Keyword(1) | Master/Worker Model |
| Keyword(2) | Divisible Workload |
| Keyword(3) | UMR |
| Keyword(4) | Parallel Data Transfer |
| 1st Author's Name | Hiroshi YAMAMOTO |
| 1st Author's Affiliation | Dept. of Computer Science and Electronics, Kyushu Institute of Technology() |
| 2nd Author's Name | Masato TSURU |
| 2nd Author's Affiliation | Dept. of Computer Science and Electronics, Kyushu Institute of Technology |
| 3rd Author's Name | Yuji OIE |
| 3rd Author's Affiliation | Dept. of Computer Science and Electronics, Kyushu Institute of Technology |
| Date | 2004-10-28 |
| Paper # | IA2004-17 |
| Volume (vol) | vol.104 |
| Number (no) | 377 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |