Name
Abstract | ||
|---|---|---|
We consider the parallel computing environment where m organizations provide machines 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 situations, we formulate the a-cooperative multi-organization scheduling problem (alpha-MOSP), where alpha >= 1 is a parameter representing the degree of cooperativeness. alpha-MOSP minimizes the makespan under the multi-organization constraint that each organization does not allow the completion time of its own jobs to be delayed a times of that in the case where those jobs are executed by itself.First, we reveal the relation between the makespan and the degree of cooperativeness. We show that the multi-organization constraint may degrade the optimal makespan by m times for a = 1, while the degradation ratio is bounded by alpha/(alpha- 1) for a > 1. This implies that weak cooperation improves the makespan dramatically. Second, we study the complexity of a-MOSP. We show its strongly NP-hardness and inapproximability for the approximation factor less than max{(alpha + 1)/alpha, 3/2}. We also show the hardness of transformation from an optimal schedule under no multi-organization constraint to an optimal schedule for a-MOSP. This result is a witness for inexistence of a general polynomial-time transformation algorithm that preserves the approximation ratio. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1142/S0129626412500065 | PARALLEL PROCESSING LETTERS |
Keywords | Field | DocType |
Heterogeneous parallel computing environments, scheduling algorithm, multi-organization scheduling, approximation algorithm, computational complexity | Approximation algorithm,Mathematical optimization,Machine scheduling,Job shop scheduling,Scheduling (computing),Computer science,Cooperativeness,Johnson's rule,Computational complexity theory,Distributed computing,Bounded function | Journal |
Volume | Issue | ISSN |
22 | 2 | 0129-6264 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fukuhito Ooshita | 1 | 236 | 36.40 |
| Tomoko Izumi | 2 | 141 | 21.33 |
| Taisuke Izumi | 3 | 284 | 39.02 |