# New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

## Abstract

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

- Authors:

- Shomal University, Department of Industrial Engineering, Faculty of Engineering (Iran, Islamic Republic of)
- Oregon State University, School of Mechanical, Industrial, and Manufacturing Engineering (United States)
- University of Tehran, School of Industrial Engineering, College of Engineering (Iran, Islamic Republic of)

- Publication Date:

- OSTI Identifier:
- 22769371

- Resource Type:
- Journal Article

- Journal Name:
- Computational and Applied Mathematics

- Additional Journal Information:
- Journal Volume: 37; Journal Issue: 1; Other Information: Copyright (c) 2018 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 0101-8205

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 97 MATHEMATICAL METHODS AND COMPUTING; COMPUTER CODES; CONTROL; GENETIC ALGORITHMS; MATHEMATICAL MODELS; RESOURCE MANAGEMENT

### Citation Formats

```
Shahdi-Pashaki, S., Teymourian, Ehsan, and Tavakkoli-Moghaddam, Reza.
```*New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm*. United States: N. p., 2018.
Web. doi:10.1007/S40314-016-0362-4.

```
Shahdi-Pashaki, S., Teymourian, Ehsan, & Tavakkoli-Moghaddam, Reza.
```*New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm*. United States. doi:10.1007/S40314-016-0362-4.

```
Shahdi-Pashaki, S., Teymourian, Ehsan, and Tavakkoli-Moghaddam, Reza. Thu .
"New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm". United States. doi:10.1007/S40314-016-0362-4.
```

```
@article{osti_22769371,
```

title = {New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm},

author = {Shahdi-Pashaki, S. and Teymourian, Ehsan and Tavakkoli-Moghaddam, Reza},

abstractNote = {Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.},

doi = {10.1007/S40314-016-0362-4},

journal = {Computational and Applied Mathematics},

issn = {0101-8205},

number = 1,

volume = 37,

place = {United States},

year = {2018},

month = {3}

}