Abstract
We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignment based on Prioritising Traffic Flows) is proposed, which improves performance under heavy-tailed workloads for certain classes of traffic. TAPTF controls the influx of tasks to each host, enables service differentiation through the use of dual queues and prevents large tasks from unduly delaying small tasks via task migration. Analytical results show that TAPTF performs significantly better than existing approaches, where task sizes are unknown and tasks are non-preemptive (run-to-completion). As system load increases, the scope and the magnitude of the performance gain expands, exhibiting improvements of more than six times in some cases.
This project is fully supported by the ARC Discovery Grant no. DP0346545 awarded by the Australian Research Council (ARC) for 2003-2005 and Sun Microsystems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Harchol-Balter, M.: Task assignment with unknown duration. Journal of the ACM 49, 260–288 (2002)
Harchol-Balter, M., Li, C., Osogami, T., Scheller-Wolf, A., Squillante, M.S.: Analysis of task assignment with cycle stealing under central queue. In: Proceedings of 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 628–637 (2003)
Crovella, M., Taqqu, M., Bestavros, A.: Heavy-Tailed Probability Distributions in the World Wide Web. Chapman & Hall, Boca Raton (1998)
Gordon Irlam: Unix file survey (1993), Available at http://www.base.com/gordoni/ufs93.html
Harchol-Balter, M.: The effect of heavy-tailed job size distributions on computer system design. In: Proceedings of ASA-IMS Conference on Applications of Heavy Tailed Distributions in Economics, Engineering and Statistics (1999)
Harchol-Balter, M., Downey, A.B.: Exploiting process lifetime distributions for dynamic load balancing. ACM Transactions on Computer Systems 15, 253–285 (1997)
Crovella, M.E., Bestavros, A.: Self-similarity in World Wide Web traffic: evidence and possible causes. IEEE/ACM Transactions on Networking 5, 835–846 (1997)
Barford, P., Crovella, M.: Generating representative web workloads for network and server performance evaluation. In: Measurement and Modeling of Computer Systems, pp. 151–160 (1998)
Arlitt, M., Jin, T.: Workload characterization of the 1998 world cup web site. IEEE Network 14, 30–37 (2000)
Iyengar, A.K., Squillante, M.S., Zhang, L.: Analysis and characterization of large-scale web server access patterns and performance. World Wide Web 2, 85–100 (1999)
Broberg, J., Tari, Z., Zeephongsekul, P.: Task assignment based on prioritising traffic flows. Technical Report TR-04-05, Royal Melbourne Institute of Technology (2004)
Harchol-Balter, M., Crovella, M.E., Murta, C.D.: On choosing a task assignment policy for a distributed server system. Journal of Parallel and Distributed Computing 59, 204–228 (1999)
Crovella, M.E., Harchol-Balter, M., Murta, C.D.: Task assignment in a distributed system: Improving performance by unbalancing load. In: Proceedings of ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 268–269 (1998)
Schroder, B., Harchol-Balter, M.: Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness. In: 9th IEEE Symposium on High Performance Distributed Computing, pp. 211–220 (2000)
Ciardo, G., Riska, A., Smirni, E.: EQUILOAD: a load balancing policy for clustered web servers. Performance Evaluation 46, 101–124 (2001)
Research, W.: Mathematica version 5.0 (2003)
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
Broberg, J., Tari, Z., Zeephongsekul, P. (2005). Task Assignment Based on Prioritising Traffic Flows. In: Higashino, T. (eds) Principles of Distributed Systems. OPODIS 2004. Lecture Notes in Computer Science, vol 3544. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11516798_30
Download citation
DOI: https://doi.org/10.1007/11516798_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27324-0
Online ISBN: 978-3-540-31584-1
eBook Packages: Computer ScienceComputer Science (R0)