Advertisement

Job Scheduling for Maximal Throughput in Autonomic Computing Systems

  • Kevin Ross
  • Nicholas Bambos
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4124)

Abstract

Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, where classes of jobs/tasks are stored awaiting execution. At each point in time, local resources are allocated according to the backlog of waiting jobs. Service modes are selected corresponding to feasible configurations of computing (processors, CPU cycles, etc.), communication (slots, channels, etc.) and storage resources (shared buffers, memory places, etc.)

We present a family of distributed algorithms which maximize the system throughput by dynamically choosing service modes in response to observed buffer backlogs. This class of policies, called projective cone scheduling algorithms, are related to maximum pressure policies in constrained queueing networks, and are shown to maintain stability under any arrival combination within the network capacity. They operate without knowledge of the arrival rates and require minimal information sharing between regions.

Keywords

Arrival Rate Stability Domain Maximal Throughput Service Mode Autonomic Computing 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andrews, M., Zhang, L.: Achieving stability in networks of input-queued switches. ACM/IEEE Trans. on Networking 11(5), 357, 848 (2003)Google Scholar
  2. 2.
    Armony, M., Bambos, N.: Queueing dynamics and maximal throughput scheduling in switched processing systems. Queueing Systems 44(3), 209 (2003)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Dai, J.G., Lin, W.: Maximum pressure policies in stochastic processing networks. Operations Research 53(2), 197–218 (2005)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Dai, J.G., Prabhakar, P.: The throughput of data switches with and without speedup. In: IEEE INFOCOM, pp. 556–564 (2000)Google Scholar
  5. 5.
    Hariri, S.: Autonomic computing: research challenges and opportunities. In: IEEE International Conference on Pervasive Services, ICPS (2004)Google Scholar
  6. 6.
    Kapoor, V.: Services and autonomic computing: a practical approach for designing manageability. In: IEEE International Conference on Services Computing, vol. 2, pp. 41–48 (2005)Google Scholar
  7. 7.
    Leonardi, E., Mellia, M., Marsan, M.A., Neri, F.: On the throughput achievable by isolated and interconnected input-queueing switches under multiclass traffic. In: IEEE INFOCOM (2002)Google Scholar
  8. 8.
    Mastroleon, L., Bambos, N., Kozyrakis, C.C., Economou, D.: Autonomic power management schemes for internet servers and data centers. In: IEEE Global Telecommunications Conference (GLOBECOM), vol. 2, pp. 943–947 (2005)Google Scholar
  9. 9.
    McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. IEEE Transactions on Communications 47(8), 1260–1267 (1999)CrossRefGoogle Scholar
  10. 10.
    Neely, M.J., Modiano, E., Rohrs, C.E.: Dynamic power allocation and routing for time varying wireless networks. IEEE JSAC (2005)Google Scholar
  11. 11.
    Paleologo, G., Bambos, N.: Autonomic admission control for networked information servers. telecommunications network design and management. Operations Research and Computer Science Interfaces 23, 227–244 (2003)MathSciNetGoogle Scholar
  12. 12.
    Ranganathan, A., Campbell, R.H.: Autonomic pervasive computing based on planning. In: International Conference on Autonomic Computing, pp. 80–87 (2004)Google Scholar
  13. 13.
    Rolia, J., Zhu, X., Arlitt, M.: Resource access management for a utility hosting enterprise applications. In: IFIP/IEEE International Symposium on Integrated Network Management, pp. 549–562 (2003)Google Scholar
  14. 14.
    Ross, K., Bambos, N.: Local search scheduling algorithms for maximal throughput in packet switches. In: IEEE INFOCOM (2004)Google Scholar
  15. 15.
    Ross, K., Bambos, N.: Packet scheduling across networks of switches. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3421, pp. 849–856. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Seao, D., Ali, A., Lim, W., Rafique, N., Thottethodi, M.: Near-optimal worst-case throughput routing for two-dimensional mesh networks. In: International Conference on Computer Architecture, pp. 432–443 (2005)Google Scholar
  17. 17.
    Stolyar, A.: Maxweight scheduling in a generalized switch: State space collapse and equivalent workload minimization in heavy traffic. Annals of Applied Probability 4(1), 1–53 (2004)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Tassiulas, L., Bhattacharya, P.P.: Allocation of interdependent resources for maximal throughput. Stochastic Models 16(1) (1999)Google Scholar
  19. 19.
    Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37(12), 1936–1948 (1992)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Towles, B., Dally, W.J., Boyd, S.: Routing ii: Throughput-centric routing algorithm design. In: ACM Symposium on parallel algorithms and architectures (2003)Google Scholar
  21. 21.
    Walsh, W.E., Tesauro, G., Kephart, J.O., Das, R.: Utility functions in autonomic systems. In: International Conference on Autonomic Computing, pp. 70–77 (2004)Google Scholar
  22. 22.
    White, S.R., Hanson, J.E., Whalley, I., Chess, D.M., Kephart, J.O.: An architectural approach to autonomic computing. In: International Conference on Autonomic Computing, pp. 2–9 (2004)Google Scholar
  23. 23.
    Zhang, L.J., Li, H., Lam, H.: Services computing; grid applications for today. IT Professional, 5–7 (July-August 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kevin Ross
    • 1
  • Nicholas Bambos
    • 2
  1. 1.UCSC School of Engineering 
  2. 2.Stanford University School of Engineering 

Personalised recommendations