Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
The Journal of Supercomputing
Published in: The Journal of Supercomputing 11/2017

17-05-2017

Memory allocation algorithm for cloud services

Authors: Anwar Al-Yatama, Imtiaz Ahmad, Naelah Al-Dabbous

Published in: The Journal of Supercomputing | Issue 11/2017

Log in

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

search-config
loading …

Abstract

Memory allocation has a major influence on multiuser systems, cloud-based services, virtual machines, and other computer systems. Memory allocation is a process that assigns physical or virtual memory space to programs and services as efficiently and quickly as possible. Economical memory allocation management needs allocation strategies with minimum wastage. In this paper, we introduce a new memory allocation algorithm based on sequential fits and zoning for on-demand (online) cloud services. The memory is divided into multiple zones, where a subgroup of relative request sizes compete in reverse order. We use simulation to compare our new mechanism with existing memory allocation methods that have been deployed using Amazon Elastic Compute Cloud as a test bed. The proposed algorithm is more efficient, and the average saving for the normalized revenue loss is about 7% better than best-fit and 15% better than first-fit memory allocation. In addition, we show that proposed algorithm is robust and faster and has a fairness index that is superior to that of existing techniques.
previous article Improvement of workload balancing using parallel loop self-scheduling on Intel Xeon Phi
next article The cost-effective fault detection and fault location approach for communication channels in NoC

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

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!

inform now

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!

inform 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!

inform now
Footnotes
1
Real user request data have not been publicly released by cloud service providers yet [42].
 
Literature
1.
Maguluri S, Srikant R, Ying L (2012) Stochastic models of load balancing and scheduling in cloud computing clusters. In: IEEE INFOCOM, Hong Kong, pp 702–710
2.
Manvi SS, Shyam GK (2014) Resource management for Infrastructure as a Service (IaaS) in cloud computing: a survey. J Netw Comput Appl 41:424–440CrossRef
3.
Madni S, Abd Latiff M, Coulibaly Y, Abdulhamid S (2016) Resource scheduling for Infrastructure as a Service (IaaS) in cloud computing. J Netw Comput Appl 68:173–200CrossRef
4.
Ben-Yehuda OA, Ben-Yehuda M, Schuster A, Tsafrir D (2014) The rise of RaaS: the resource-as-a-service cloud. Commun ACM 57(7):76–84CrossRef
5.
Barham P, Dragovic B, Fraser K, Hand S, Harris T, Ho A, Neugebauer R, Pratt I, Warfield A (2003) Xen and the art of virtualization. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles and Practice, pp 164–177
6.
Kivity A, Kamay Y, Laor D, Lublin U, Liguori A (2007) KVM: The Linux virtual machine monitor. In: Proceedings of the Linux Symposium, pp 225–230
7.
Waldspurger CA (2002) Memory resource management in VMware ESX Server. In: Proceedings of the 2002 Symposium on Operating Systems Design and Implementation
8.
Ding Y, Xu H, Li P, Ding J (2016) Review of virtual memory optimization in cloud environment. In: International Conference on Intelligent Networking and Collaborative Systems, pp 53–58
9.
Costea S, Barbu M, Muraru C, Rughinis R (2013) Resource allocation heuristics for the miriaPOD platform. In: Networking in Education and Research, 2013 RoEduNet International Conference 12th Edition, vol 1, no 6, pp 26–28
10.
Weinstock C, Wulf W (1988) QuickFit: an efficient algorithm for heap storage allocation. ACM SIGPLAN 23(10):141–144CrossRef
11.
Albers S, Mitzenmacher M (1998) Average-case analyses of first fit and random fit bin packing. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp 290–299
12.
Bays C (1977) A comparison of next-fit, first-fit, and best-fit. Commun ACM 20(3):191–192CrossRef
13.
14.
Younis M (2012) Memory allocation technique for segregated free list based on genetic algorithm. J Al-Nahrain Univ 15(2):161–168
15.
Sun X, Wang J, Chen X (2007) An improvement of TLSF algorithm. In: 15th IEEE-NPSS Real-Time Conference, vol 1, no 5, 29 April–4 May 2007
16.
Masmano M, Ripoll I, Crespo A, Real J (2004) TLSF: a new dynamic memory allocator for real-time systems. In: 16th Euromicro Conference on Real-Time Systems, 30 June–2 July, pp 79–88
17.
18.
Ferreira T, Matias R, Macedo A, Araujo L (2011) An experimental study on memory allocators in multicore and multithreaded applications. In: International Conference on Parallel and Distributed Computing Applications and Technologies, Gwangju, pp 92–98
19.
Elias D, Matias R, Fernandes Ma, Borges L (2014) Experimental and theoretical analyses of memory allocation algorithms. In: 29th Annual ACM Symposium on Applied Computing (SAC’14), New York, NY, USA, pp 1545–1546
20.
Chung Y, Moon S (2000) Memory allocation with lazy fits. In: International Symposium on Memory Management, Minneapolis, Minnesota, pp 65–70
21.
Wilson PR, Johnstone MS, Neely M, Boles D (1995) Dynamic storage allocation: a survey and critical review. In: International Workshop on Memory Management, vol 986, Kinross, Scotland. Springer, Berlin, pp 1–116
22.
Johnstone MS, Wilson PR (1997) The memory fragmentation problem solved? In: Proceedings of the First International Symposium on Memory Management, pp 26–36
23.
Hasan Y, Chang M (2005) A study of best-fit memory allocators. Comput Lang Syst Struct 31(1):35–48
24.
Risco-Martin JL, Colemenar JM, Atienza D, Hidalgo JI (2011) Simulation of high-performance memory allocators. Microprocess Microsyst 35(8):755–765CrossRef
25.
Park H, Choi J, Lee D, Noh SH (2015) iBuddy: inverse buddy for enhancing memory allocation/deallocation performance on multi-core systems. IEEE Trans Comput 64(3):720–732CrossRefMathSciNet
26.
27.
Selman AH, Aburas A, Selman S (2014) Intelligent memory allocation based on fuzzy logic. Southeast Eur J Soft Comput 3(1):18–25
28.
Liao X, Jin H, vol Yu S, Zhang Y (2015) A novel memory allocation scheme for memory energy reduction in virtualization environment. J Comput Syst Sci 81(1):3–15CrossRefMATHMathSciNet
29.
Elias D, Matias R, Fernandes M, Borges L (2014) Experimental and theoretical analyses of memory allocation algorithms. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, Gyeongju, Korea, March 24–28, pp 1545–1546
30.
Ben-Yehuda OA, Posener E, Ben-Yehuda M, Schuster A, Mualem A (2014) Ginseng: market-driven memory allocation. In: Proceedings of the 10th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, Salt Lake City, UT, USA, March 1–2, pp 41–52
31.
Korf R (2002) A new algorithm for optimal bin packing. In: 18th National Conference on Artificial intelligence, Menlo Park, CA, USA, pp 731–736
32.
Alyatama A (2014) Dynamic spectrum allocation in orthogonal frequency-division multiplexing optical networks. J Eng Res 2(3):109–129
33.
Kolhar M, Abd El-atty SM, Rahmath M (2016) Storage allocation scheme for virtual instances of cloud computing. Neural Comput Appl
34.
35.
36.
Winston W (1991) Operations research: applications and algorithms, 2nd edn. PWS-KENT, BostonMATH
37.
Gera A, Xia C (2011) Learning curves and stochastic models for pricing and provisioning cloud computing services. Serv Sci 3(1):99–109CrossRef
38.
Khazaei H, Miic J, Miic V, Mohammadi N (2013) Modeling the performance of heterogeneous IaaS cloud centers. In: IEEE 33rd International Conference on Distributed Computing Systems Workshops (ICDCSW), pp 232–237
39.
Khazaei H (2013) Performance modeling of cloud computing centers. Ph.D thesis, University of Manitoba Winnipeg, Manitoba, Canada
40.
Jain R, Chiu M, Hawe W (1984) A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. DEC Research Report TR-301
41.
Shore J (1975) On the external storage fragmentation produced by first-fit and best-fit allocation strategies. Commun ACM 18:433–440CrossRefMATH
42.
Mashayekhy L, Nejad M, Grosu D, Vasilakos AV (2016) An online mechanism for resource allocation and pricing in clouds. IEEE Trans Comput 65(4):1172–1184CrossRefMATHMathSciNet
43.
Lea J, Alyatama A (1995) Bandwidth quantization and states reduction in the broadband ISDN. IEEE/ACM Trans Netw 3(3):352–360
Metadata
Title
Memory allocation algorithm for cloud services
Authors
Anwar Al-Yatama
Imtiaz Ahmad
Naelah Al-Dabbous
Publication date
17-05-2017
Publisher
Springer US
Published in
The Journal of Supercomputing / Issue 11/2017
Print ISSN: 0920-8542
Electronic ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-017-2069-8

Other articles of this Issue 11/2017

The Journal of Supercomputing 11/2017 Go to the issue

OriginalPaper

Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering

OriginalPaper

Novel parity-preserving reversible logic array multipliers

OriginalPaper

A fast Hough Transform algorithm for straight lines detection in an image using GPU parallel computing with CUDA-C

OriginalPaper

Soft error resilience of Big Data kernels through algorithmic approaches

OriginalPaper

Exploring correlation for fast skyline computation

OriginalPaper

The cost-effective fault detection and fault location approach for communication channels in NoC

Premium Partner

    Image Credits