| Presentation | 2008-09-11 An analysis of a generalized multi-organization scheduling on unrelated parallel machines Fukuhito OOSHITA, Tomoko IZUMI, Taisuke IZUMI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider the grid where each organization provides a machine and several jobs to be executed. While cooperation of organizations is required to minimize the global makespan, each organization also expects the faster completion of its own jobs primarily and thus it is not necessarily cooperative. To handle the above situations, we newly introduce the α-cooperative multi-organization scheduling problem (α-MOSP), where α≧1 is a parameter representing the degree of cooperation. The α-MOSP minimizes the makespan under the cooperation constraint that each organization does not allow the completion time of its own jobs to be delayed α times of that in the case where those jobs are executed by itself. In this paper, we first investigate the relation between α and the quality of the global makespan. For α=1 (i.e., the completely uncooperative case), we show an instance where the cooperation constraint degrades the optimal makespan by m times, where m is the number of organizations. In contrast, for α>1, we can construct an algorithm transforming any unconstrained schedule to one satisfying the cooperation constraint. This algorithm bounds the degradation ratio by α/(α-1), which implies that weak cooperation improves the makespan dramatically. Second, we give some complexity results of α-MOSP. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | grid computing / heterogeneous parallel computing environment / scheduling algorithm / approximation algorithm |
| Paper # | COMP2008-32 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2008/9/4(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 | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An analysis of a generalized multi-organization scheduling on unrelated parallel machines |
| Sub Title (in English) | |
| Keyword(1) | grid computing |
| Keyword(2) | heterogeneous parallel computing environment |
| Keyword(3) | scheduling algorithm |
| Keyword(4) | approximation algorithm |
| 1st Author's Name | Fukuhito OOSHITA |
| 1st Author's Affiliation | Graduate School of Information Science and Technology, Osaka University() |
| 2nd Author's Name | Tomoko IZUMI |
| 2nd Author's Affiliation | Center of Social Contribution and Collaboration, Nagoya Institute of Technology |
| 3rd Author's Name | Taisuke IZUMI |
| 3rd Author's Affiliation | Graduate School of Engineering, Nagoya Institute of Technology |
| Date | 2008-09-11 |
| Paper # | COMP2008-32 |
| Volume (vol) | vol.108 |
| Number (no) | 206 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |