STATIC AND DYNAMIC RESOURCE ALLOCATION STRATEGIES IN HIGH PERFORMANCE HETEROGENEOUS COMPUTING APPLICATION

RAGINI KARWAYUN, Dr. K. P. Yadav, Dr. H. S. Sharma

Abstract


More and more computing services are running in clouds as the number and scope of internet services are increasing exponentially. Major objective of cloud computing is to give users virtually unlimited pay per use computing resources without any concern for managing the underlying infrastructure. But this results in huge increase in size of computing environment which makes it very difficult to measure the performance of allocation strategies that use the description of underlying infrastructure and resource dependency graphs for making decisions. Both dynamic and static allocation strategies have their share of advantages and drawbacks. In this paper we will try to define a hybrid scheme for resource allocation that will use the positive features of both schemes to give better performance.

Keywords


Scheduling, Resource Allocation, Dynamic Scheduling strategies;

Full Text:

PDF

References


R. Eswari and S. Nickolas, "Path-based Heuristic Task Scheduling Algorithm for Heterogeneous Distributed Computing Systems", International Conference on Advances in Recent Technologies in Communication and Computing, 2010.

H. Arabnejad, J. Barbosa, " List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table", IEEE Transactions on Parallel & Distributed Systems, Vol. 25, PP. 682-694, March 2013.

H.Topcuoglu, S. Hariri, and M.Y.Wu, "Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing", IEEE Trans. Parallel and Distributed Systems,March 2002, Vol. 13, No.3, pp. 260-274.

Aida A. Nasr, Nirmeen A. El-Bahnasawy and Ayman El-Sayed “Task Scheduling Algorithm for High Performance Heterogeneous Distributed Computing Systems” International Journal of Computer Applications (0975 – 8887) Volume 110 – No. 16, January 2015.

Olivier Beaumont, Lionel Eyraud-Dubois, Abdou Guermouche, Thomas Lambert. Comparison of Static and Dynamic Resource Allocation Strategies for Matrix Multiplication. 26th IEEE International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2015, Oct 2015, Florianopolis, Brazil.

M. Jing and L. Kenli, "Energy-Aware Scheduling Algorithm with Duplication on Heterogeneous Computing Systems," Publish in: Grid Computing (GRID), ACM/IEEE 13th International Conference, Page: 122 -129, Sept. 2012.

T. Gautier, X. Besseron, and L. Pigeon, “Kaapi: A thread scheduling runtime system for data flow computations on cluster of multi-processors,” in PASCO ’07. New York, NY, USA: ACM, 2007.

C. Boeres, A. Lima, and V. Rebello, “Hybrid task scheduling: integrating static and dynamic heuristics,” in 15th Symposium on Computer Architecture and High Performance Computing, 2003. Proceedings, Nov. 2003, pp. 199–206.

J. V. F. Lima, T. Gautier, V. Danjean, B. Raffin, and N. Maillard,“Design and analysis of scheduling strategies for multi-cpu and multigpu architectures,” Parallel Computing, vol. 44, pp. 37–52, 2015.

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, “Minimizing communication in linear algebra,” SIAM Journal on Matrix Analysis and Applications, vol. 32, no. 3, pp. 866–901, Jul. 2011, arXiv:0905.2485. [Online]. Available: http://arxiv.org/abs/0905.2485

O. Beaumont, V. Boudet, F. Rastello, and Y. Robert, “Partitioning a square into rectangles: Np-completeness and approximation algorithms,” Algorithmica, vol. 34, no. 3, pp. 217–239, 2002.

ThomasA. Henzinger, Anmol V. Singh, Vasu Singh and ThomasWies,” Static scheduling in clouds”

O. Beaumont and L. Marchal, “Analysis of dynamic scheduling strategies for matrix multiplication on heterogeneous platforms,” in HPDC’14. ACM, 2014.

H.-J. Lee, J. P. Robertson, and J. A. Fortes, “Generalized cannon’s algorithm for parallel matrix multiplication,” in Proceedings of the 11th international conference on Supercomputing. ACM, 1997, pp. 44–51.

O. Beaumont, V. Boudet, F. Rastello, and Y. Robert, “Partitioning a square into rectangles: Np-completeness and approximation algorithms,” Algorithmica, vol. 34, no. 3, pp. 217–239, 2002.

H. Nagamochi and Y. Abe, “An approximation algorithm for dissecting a rectangle into rectangles with specified areas,” Discrete Applied Mathematics, vol. 155, no. 4, pp. 523 – 537, 2007.

A. Fügenschuh, K. Junosza-Szaniawski, and Z. Lonc, “Exact and approximation algorithms for a soft rectangle packing problem,” Optimization,vol. 63, no. 11, pp. 1637–1663, 2014.

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, “Minimizing communication in linear algebra,” SIAM Journal on Matrix Analysis and Applications, vol. 32, no. 3, pp. 866–901, Jul. 2011, arXiv:0905.2485. [Online]. Available: http://arxiv.org/abs/0905.2485




DOI: https://doi.org/10.26483/ijarcs.v9i1.5265

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 International Journal of Advanced Research in Computer Science