Abstract
We consider the problem of designing monotone deterministic algorithms for scheduling tasks on related machines in order to minimize the makespan. Several recent papers showed that monotonicity is a fundamental property to design truthful mechanisms for this scheduling problem.
We give both theoretical and experimental results. For the case of two machines, when speeds of the machines are restricted to be powers of a given constant c > 0, we prove that algorithm Largest Processing Time is monotone for any c ≥ 2 while it is not monotone for c ≤ 1.78; algorithm List Scheduling, instead, is monotone only for c > 2.
For the case of m machines we restrict our attention to the class of “greedy-like” monotone algorithms defined in [AP04]. We propose the greedy–like algorithm Uniform_RR and we prove that it is monotone when speeds are powers of a given integer constant c >0 and it obtains an approximation ratio that is not worse than algorithm Uniform, proposed in [AP04]. We also experimentally compare performances of Uniform, Uniform_RR, LPT, and several other monotone and greedy–like heuristics.
Work supported by the European Project IST-2001-33135, Critical Resource Sharing for Cooperation in Complex Systems (CRESCCO).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ambrosio, P., Auletta, V.: Deterministic monotone algorithms for scheduling on related machines. Technical Report Università di Salerno (2004)
Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of FOCS, pp. 482–491 (2001)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Warts, O.: On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. Journal of ACM 44, 486–504
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 171–182. Springer, Heidelberg (2004)
Auletta, V., De Prisco, R., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 608–619. Springer, Heidelberg (2004)
Berman, P., Charikar, M., Karpinski, M.: On-Line load Balancing for Related Machines. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, Springer, Heidelberg (1997)
Cho, Y., Sahni, S.: Bounds for list scheduling on uniform processors. SIAM Journal of Computing 9(1) (1980)
Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17–33 (1971)
Gonzalez, T., Ibarra, O., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM Journal of Computing 6 (1977)
Groves, T.: Incentive in Teams. Econometrica 41, 617–631 (1973)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Tech. Journal 45, 1563–1581 (1966)
Graham, R.L.: Bound on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17, 416–429 (1969)
Hochbaum, D.S., Shmoys, D.B.: A Polynomial Approximation Scheme for Scheduling on uniform processors: Using the Dual Approximation Approach. SIAM Journal of Computing 17(3), 539–551 (1988)
Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce (EC), pp. 242–252 (2000)
Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of the 31st STOC, pp. 129–140 (1999)
Osborne, M.J., Rubinstein, A.: A course in Game Theory. MIT Press, Cambridge (1994)
Papadimitriou, C.H.: Algorithms, Games and the Internet. In: Proc. of the 33rd STOC (2001)
Ronen, A.: Solving Optimization Problems Among Selfish Agents. PhD thesis, Hebrew University in Jerusalem (2000)
Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambrosio, P., Auletta, V. (2005). Deterministic Monotone Algorithms for Scheduling on Related Machines. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)