Service Time Distribution of Tasks using Adapt-policy

Authors

  • Ramyadevi.K  Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India
  • Anitha. B  Dhanalakshmi College of Engineering, Chennai, Tamilnadu, India

Keywords:

Adaptive task assignment, locality aware task assignment policies, non-parametric density estimation, on-line density estimation, performance, optimisation

Abstract

Task assignment in server farms We propose an adaptive task assignment policy named as ADAPT-POLICY, which is based on the conception of many static-based task assignment policies ADAPT-POLICY defines a setof policies for a given system taking into account the specific properties of the system. They have different execution characteristics under different workload conditions The objective is to use the task assignment policy with the best performance . Which task assignment policy performs the best depends on the traffic conditions that vary over time. ADAPT-POLICY determines the best task assignment using the service time distribution of tasks (and various other traffic properties), which is estimated and then it adaptively changes the task assignment policy to suit the most recent traffic conditions. The experimental results show that ADAPTPOLICY can result in significant performance improvements over both static and dynamic task assignment policies.

References

 [1] M. Harchol-Balter, M. Crovella, and C.D. Murta, “On Choosing a Task Assignment Policy for a Distributed Server System,” J. Parallel and Distributed Computing, vol. 59, no. 2, pp. 204-228, 1999.

[2] M. Jayasinghe, Z. Tari, and P. Zeephongsekul, “Performance Analysis of Multi-Level Time Sharing Task Assignment Policies on Cluster-Based Systems,” Proc. IEEE Int’l Conf. Cluster Computing, pp. 265-274, 2010.

[3] M.E. Crovella, M. Harchol-Balter, and C. Murta, “Task Assignment in a Distributed System: Improving Performance by Unbalancing Load,” ACM SIGMETRICS Performance Evaluation Rev., pp. 268-269, June 1998.

[4] Q. Zhang and W. Sun, “Workload-Aware Load Balancing for Clustered Web Servers,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 3, pp. 219-233, Mar. 2005.

[5] Q.J. Lin, D. Chen, and Y.C. Liu, “Non-Stationary and Small-Time Scaling Behavior of Internet Traffic,” Proc. Int’l Conf. Comm., Circuits and Systems, vol. 3, pp. 1717-1721, June 2006.

[6] Z.-L. Zhang, V. Ribeiro, S. Moon, and C. Diot, “Small-Time Scaling Behaviors of Internet Backbone Traffic: An Empirical Study,” Proc. INFOCOM ’03, vol. 3, pp. 1826-1836, 2003.

[7] Z. Zhang and W. Fan, “Web Server Load Balancing: A  Queueing Analysis,” European J. Operational Research, vol. 186, no. 2, pp. 681- 693, 2008.

[8] M. Harchol-Balter, “Task Assignment with Unknown Duration,”

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2015-02-25

Issue

Volume 1, Issue 1, January-February-2015

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Ramyadevi.K, Anitha. B, " Service Time Distribution of Tasks using Adapt-policy, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1, Issue 1, pp.280-282, January-February-2015.