Skip to main content
Top
Published in: Cluster Computing 3/2019

21-03-2018

Optimal computing resource allocation algorithm in cloud computing based on hybrid differential parallel scheduling

Authors: Jing Wei, Xin-fa Zeng

Published in: Cluster Computing | Special Issue 3/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In order to improve the ability of resource allocation and scheduling in cloud computing, optimize resource allocation and improve the efficiency of cloud computing, an optimal computing resource allocation algorithm in cloud computing based on hybrid differential parallel scheduling is proposed. In this algorithm, the models of data structure and gird structure of computing resource allocation in cloud computing are constructed, and the sample clustering analysis method of resource information flow is used to classify the attributes of computing resources; the sliding window of computing resource allocation is divided into multiple sub-windows; characteristic quantities associated with computing resource allocation attributes are selected in neighbor samples as standard vector sets for adaptive pairing; the computing resources in cloud computing are done with singular value decomposition and the resource allocation is transformed into the least square problem; the hybrid differential parallel computing method is used for optimal solution finding of resource scheduling vector set to prevent the allocation results from falling into local optimal solution, so as to improve the global convergence of resource allocation. The simulation results show that when the method proposed in this paper is used for resource allocation in clouding computing, the clustering performance is high and the convergence control ability to computing resources with different attributes is high; the allocation speedup can reach 3.67, which is improved by 14.65 and 7.43% respectively compared with that in the traditional HEFT algorithm and HCNF algorithm; when the number of allocate nodes is 100, the overhead is only 5.6, which is reduced by 14.56 and 8.33% than that in traditional HEFT algorithm and HCNF algorithm. So it shows that the proposed method has a higher practical application performance for its shorter execution time and lower overhead.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bi, A.Q., Wang, S.T.: Transfer affinity propagation clustering algorithm based on Kullback-Leiber distance. JEIT 38(8), 2076–2084 (2016) Bi, A.Q., Wang, S.T.: Transfer affinity propagation clustering algorithm based on Kullback-Leiber distance. JEIT 38(8), 2076–2084 (2016)
2.
go back to reference Alahmad, B.N., Gopalakrishnan, S.: Energy efficient task partitioning and real-time scheduling on heterogeneous multiprocessor platforms with QoS requirements. Sustain. Comput. 1(4), 314–328 (2011) Alahmad, B.N., Gopalakrishnan, S.: Energy efficient task partitioning and real-time scheduling on heterogeneous multiprocessor platforms with QoS requirements. Sustain. Comput. 1(4), 314–328 (2011)
3.
go back to reference Chillet, D., Eiche, A., Pillement, S., et al.: Real-time scheduling on heterogeneous system-on-chip architectures using an optimised artificial neural network. J. Syst. Archit. 57(4), 340–353 (2011)CrossRef Chillet, D., Eiche, A., Pillement, S., et al.: Real-time scheduling on heterogeneous system-on-chip architectures using an optimised artificial neural network. J. Syst. Archit. 57(4), 340–353 (2011)CrossRef
4.
go back to reference Guo, X.Y.: Simulation and analysis on uncertain attenuation property of underwater acoustic signal for oil field pipe. Comput. Simul. 31(3), 118–121 (2014) Guo, X.Y.: Simulation and analysis on uncertain attenuation property of underwater acoustic signal for oil field pipe. Comput. Simul. 31(3), 118–121 (2014)
5.
go back to reference Femando, N., Hong, Y., Viterbo, E.: Flip-OFDM for unipolar communication systems. IEEE Trans. Commun. 60(12), 3726–3733 (2012)CrossRef Femando, N., Hong, Y., Viterbo, E.: Flip-OFDM for unipolar communication systems. IEEE Trans. Commun. 60(12), 3726–3733 (2012)CrossRef
6.
go back to reference Patricia, N., Caputo, B.: Learning to learn, from transfer learning to domain adaptation: a unifying perspective. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA, pp. 1442–1449 (2014) Patricia, N., Caputo, B.: Learning to learn, from transfer learning to domain adaptation: a unifying perspective. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA, pp. 1442–1449 (2014)
7.
go back to reference Wang, Z., Su, X.: Dynamically hierarchical resource-allocation algorithm in cloud computing environment. J. Supercomput. 71(7), 2748–2766 (2015)CrossRef Wang, Z., Su, X.: Dynamically hierarchical resource-allocation algorithm in cloud computing environment. J. Supercomput. 71(7), 2748–2766 (2015)CrossRef
8.
go back to reference Sun, L., Guo, C.H.: Incremental affinity propagation clustering based on message passing. IEEE Trans. Knowl. Data Eng. 26(11), 2731–2744 (2014)CrossRef Sun, L., Guo, C.H.: Incremental affinity propagation clustering based on message passing. IEEE Trans. Knowl. Data Eng. 26(11), 2731–2744 (2014)CrossRef
9.
go back to reference Ling, C.G., Wang, H.Z.: Optimization research on differential evolution algorithm and its application in clustering analysis. Modern Electron. Technol. 39(13), 103–107 (2016) Ling, C.G., Wang, H.Z.: Optimization research on differential evolution algorithm and its application in clustering analysis. Modern Electron. Technol. 39(13), 103–107 (2016)
10.
go back to reference Li, M.D., Zhao, H., Weng, X.W., et al.: Differential evolution based on optimal Gaussian random walk and individual selection strategies. Control Decis. 31(08), 1379–1386 (2016)MATH Li, M.D., Zhao, H., Weng, X.W., et al.: Differential evolution based on optimal Gaussian random walk and individual selection strategies. Control Decis. 31(08), 1379–1386 (2016)MATH
11.
go back to reference Patel, V.M., Nguyen, H.V.: VIDAL R.: latent space sparse and low-rank subspace clustering. IEEE J. Sel. Top. Signal Process. 9(4), 691–701 (2015)CrossRef Patel, V.M., Nguyen, H.V.: VIDAL R.: latent space sparse and low-rank subspace clustering. IEEE J. Sel. Top. Signal Process. 9(4), 691–701 (2015)CrossRef
12.
go back to reference Sun, L.J., Chen, X.D., Han, C., et al.: New fuzzy-clustering algorithm for data stream. JEIT 37(7), 1620–1625 (2015) Sun, L.J., Chen, X.D., Han, C., et al.: New fuzzy-clustering algorithm for data stream. JEIT 37(7), 1620–1625 (2015)
13.
go back to reference Bi, A.Q., Dong, A.M., Wang, S.T.: A dynamic data stream clustering algorithm based on probability and exemplar. J. Comput. Res. Dev. 53(5), 1029–1042 (2016) Bi, A.Q., Dong, A.M., Wang, S.T.: A dynamic data stream clustering algorithm based on probability and exemplar. J. Comput. Res. Dev. 53(5), 1029–1042 (2016)
14.
go back to reference Jiang, Y.Z., Chung, F.L., Wang, S.T., et al.: Collaborative fuzzy clustering from multiple weighted views. IEEE Trans. Cybern. 45(4), 688–701 (2015)CrossRef Jiang, Y.Z., Chung, F.L., Wang, S.T., et al.: Collaborative fuzzy clustering from multiple weighted views. IEEE Trans. Cybern. 45(4), 688–701 (2015)CrossRef
15.
go back to reference Wang, W.B.: Simulation of cloud computing resource optimization scheduling under the interference of debris resources. Comput. Simul. 33(7), 65–71 (2016) Wang, W.B.: Simulation of cloud computing resource optimization scheduling under the interference of debris resources. Comput. Simul. 33(7), 65–71 (2016)
16.
go back to reference Dai, L., Li, J.H.: An optimal resource allocation algorithm in cloud computing environment. Appl. Mech. Mater. 733(23), 779–783 (2015) Dai, L., Li, J.H.: An optimal resource allocation algorithm in cloud computing environment. Appl. Mech. Mater. 733(23), 779–783 (2015)
17.
go back to reference Hu, W., Li, K., Xu, J., et al.: Cloud-computing-based resource allocation research on the perspective of improved ant colony algorithm. In: IEEE International Conference on Computer Science and Mechanical Automation, pp. 76–80 (2016) Hu, W., Li, K., Xu, J., et al.: Cloud-computing-based resource allocation research on the perspective of improved ant colony algorithm. In: IEEE International Conference on Computer Science and Mechanical Automation, pp. 76–80 (2016)
18.
go back to reference Shao, Y.: Virtual resource allocation based on improved particle swarm optimization in cloud computing environment. Int. J. Grid Distrib. Comput. 8(1), 228–233 (2015) Shao, Y.: Virtual resource allocation based on improved particle swarm optimization in cloud computing environment. Int. J. Grid Distrib. Comput. 8(1), 228–233 (2015)
19.
go back to reference Liu, Y., Lee, M.J.: An adaptive resource allocation algorithm for partitioned services in mobile cloud computing. In: IEEE Service-Oriented System Engineering, pp. 209–215 (2015) Liu, Y., Lee, M.J.: An adaptive resource allocation algorithm for partitioned services in mobile cloud computing. In: IEEE Service-Oriented System Engineering, pp. 209–215 (2015)
Metadata
Title
Optimal computing resource allocation algorithm in cloud computing based on hybrid differential parallel scheduling
Authors
Jing Wei
Xin-fa Zeng
Publication date
21-03-2018
Publisher
Springer US
Published in
Cluster Computing / Issue Special Issue 3/2019
Print ISSN: 1386-7857
Electronic ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-018-2138-7

Other articles of this Special Issue 3/2019

Cluster Computing 3/2019 Go to the issue

Premium Partner