Abstract
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-objective analysis, namely simultaneous optimization of the makespan and the reliability. We show that this problem can not be approximated by a single schedule. A similar problem has already been studied leading to a \(\big<\bar{2}, 1\big>\)-approximation algorithm (i.e. for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan). We provide an algorithm which has a much lower complexity. This solution is finally used to derive a (2 + ε, 1)-approximation of the Pareto set of the problem, for any ε> 0.
Chapter PDF
Similar content being viewed by others
Keywords
- Schedule Problem
- Approximation Algorithm
- Pareto Optimal Solution
- Unrelated Machine
- Good Compromise Solution
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bouteiller, A., Herault, T., Krawezik, G., Lemarinier, P., Cappello, F.: Mpich-v: a multiprotocol fault tolerant mpi. International Journal of High Performance Computing and Applications (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)
Gonzalez, T., Ibarra, O., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM Journal of Computing 6, 155–166 (1977)
Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing 17(3), 539–551 (1988)
Dongarra, J.J., Jeannot, E., Saule, E., Shi, Z.: Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In: Proc. of SPAA, pp. 280–288 (2007)
Dogan, A., Ozgüner, F.: Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 308–323 (2002)
Dogan, A., Ozgüner, F.: Bi-objective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing Systems. Comput. J. 48(3), 300–314 (2005)
Shmoys, D.B., Tardos, E.: Scheduling unrelated machines with costs. In: Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, pp. 448–454 (1993)
Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 621–633. Springer, Heidelberg (2006)
Ho, K.: Dual criteria optimization problems for imprecise computation tasks. In: Leung, J.Y.T. (ed.) Handbook of Scheduling (2004)
Voorneveld, M.: Characterization of pareto dominance. Operations Research Letters 31, 7–11 (2003)
Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Operations Research 52(2), 229–242 (2004)
Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. of FOCS, pp. 86–92 (2000)
Angel, E., Bampis, E., Gourvès, L.: Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Information processing letters 94 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeannot, E., Saule, E., Trystram, D. (2008). Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_94
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)