Earticle

초록

영어

Resource management is traditionally addressed by policies implemented inside the resource provider. Here we study the problem with an attitude that is specular but complementary, which consists in designing a distributed client-side access regulation algorithm that improves the utilization of an elastic resource. The introduction of elastic resources — a feature of the cloud computing paradigm — complicates their management since, when the workload applied on the resource varies (for instance with the number of users) the resource automatically follows such variations with its capacity. But the presence of an extra computational cost related with capacity variations motivates a non linear, lazy response, that penalizes dynamic environments. Hence the interest for an algorithm that shapes the production of service requests on the client side. To make our investigation more adherent to a practical environment, we introduce a real time requirement: each client must have access to the service at least every ꠔ time units. Examples of this requirement, that features a bounded degree of asynchrony, are found, for instance, in network streaming applications: stream chunks must feed the input buffer at the destination. The algorithm we investigate is based on the random walk of a token. To eval- uate the range of applicability of the algorithm, we define an analytic model of its stochastic behavior — described by a non-Markov process — and then we compare its performance with a benchmark algorithm, representative of an effective solution that is often used in practice.

목차

Abstract
 1 Introduction
 2 System model
 3 Random scheduling
 4 Random walk
 5 Discussion and comparison
  5.1 Response to churns
  5.2 Multiple tokens: why not?
 5.3 Timing issues
 6 Conclusions
 Acknowledgments
 Appendix - Proof of the theorem
 References

키워드

저자

• Augusto Ciuffoletti [ Department of Computer Science - University of Pisa - Italy ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605