Abstract
Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their tasks, the individual schedules always can be merged into a global feasible schedule? Unlike the traditional approaches to distributed scheduling we do not enforce a fixed schedule to every participating agent. Instead we guarantee flexibility by offering a set of schedules to choose from in such a way that every agent can choose its own schedule independently from the others. We show that in case of agents with unbounded concurrency, optimal make-span can be guaranteed. Whenever the agents have bounded concurrency optimality cannot be guaranteed, but we present an approximation algorithm that ensures a constant make-span ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sih, G.C., Lee, E.A.: Scheduling to account for interprocessor communication within interconnection-constrained processor networks. In: ICPP (1), pp. 9–16 (1990)
Topcuouglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)
Beaumont, O., Boudet, V., Robert, Y.: The iso-level scheduling heuristic for heterogeneous processors. In: Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing 2002, 9-11 Jan. 2002, pp. 335–350 (2002)
Maheswaran, M., Siegel, H.J.: A dynamic matching and scheduling algorithm for heterogeneous computing systems. In: HCW 1998: Proc. of the Seventh HCW, p. 57 (1998)
Walsh, W., Wellman, M., Wurman, P., MacKie-Mason, J.: Some economics of market-based distributed scheduling. In: Proceedings of 18th International Conference on Distributed Computing Systems 1998, 26-29 May 1998, pp. 612–621 (1998)
Li, J.: Strategic Negotiation Models for Grid Scheduling. PhD thesis, TU Dortmund (2007)
Hunsberger, L.: Algorithms for a temporal decoupling problem in multi-agent planning. In: Proc. of AAMAS-2003 (2002)
Garey, M., Johnson, D.: Computers and Intractability - a guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Yadati, C., Witteveen, C., Zhang, Y., Wu, M., Putre, H.L.: Autonomous scheduling. In: Proc. of the FCS 2008 (2008)
Cormen, T.T., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yadati, C., Witteveen, C., Zhang, Y., Wu, M., la Poutre, H. (2008). Autonomous Scheduling with Unbounded and Bounded Agents. In: Bergmann, R., Lindemann, G., Kirn, S., Pěchouček, M. (eds) Multiagent System Technologies. MATES 2008. Lecture Notes in Computer Science(), vol 5244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87805-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-87805-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87804-9
Online ISBN: 978-3-540-87805-6
eBook Packages: Computer ScienceComputer Science (R0)