Altuntaş, Tolga Buğra

Loading...
Profile Picture
Name Variants
Job Title
Araş.Gör.
Email Address
Main Affiliation
01.01.09.07. Yazılım Mühendisliği Bölümü
Status
Former Staff
Website
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
Documents

1

Citations

1

Scholarly Output

1

Articles

0

Views / Downloads

0/0

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

0

Supervised Theses

1

Journals data is not available

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Master Thesis
    Sanal makine yerleştirme problemi için çok amaçlı optimizasyon çözümü
    (2024) Altuntaş, Tolga Buğra; Öz, Dindar
    Delivering different services over the Internet requires cloud computing. These services are managed by Cloud Service Providers using Virtual Machines that simulate physical machines in order to provide the required computing resources. Efficiently managing and allocating these resources is crucial for achieving optimal performance and cost-effectiveness. Nevertheless, the rapid expansion of cloud computing increased the complexity and scale of cloud environments. A key element of cloud computing is virtual machine placement (VMP), which makes sure that virtual machines are distributed among physical servers as efficiently as possible. Effective VMP strategies optimize data center performance and energy management, affecting operational cost and customer satisfaction. This work focuses on resource utilization and energy management on the multi-objective VMP problem. Extended Adapted Large Neighborhood Search (EALNS) algorithm is utilized to solve the problem. The EALNS algorithm uses a weight value to improve the spread of non-dominated solutions and create a better Pareto front. Five problem-specific destroy and repair operators are employed to adapt the EALNS algorithm to the VMP problem. To the best of our knowledge, this is the first work that uses the ALNS algorithm to solve a multi-objective VMP problem. The comparison experiments are done against three state-of-the-art multi-objective algorithms. The results show that the EALNS algorithm has great scalability and creates higher-quality Pareto fronts than its competitors.