yassir samadi

Mr. yassir samadi


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018
Verified
Conference Paper
Closed access
YSyassir samadi
yassir samadi
MZMostapha Zbakh
Mostapha Zbakh
CTClaude Tadonki
Claude Tadonki
Cloud computing is one of the most widely spreaded platforms for executing tasks through virtual machines as processing elements. However, there are various issues that need to be addressed in order to be efficiently utilized for workflow applications. One of the fundamental issues in cloud computing is related to task scheduling. Optimal scheduling of tasks in cloud computing is an NP-complete optimization problem, and many algorithms have been proposed to solve it. Furthermore, the existing algorithms fail to either meet the user's Quality of Service (QoS) requirements such as minimizing the makespan and satisfying budget constraints, or to incorporate some basic principles of cloud computing such as elasticity and heterogeneity of computing resources. Among these algorithms, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in short time for tasks scheduling in heterogeneous systems. Generally, the HEFT algorithm yields good tasks execution time, but its drawback is that there is no load balancing. In this paper, an enhancement of Heterogeneous Earliest Finish Time (E-HEFT) algorithm under a user-specified financial constraint is proposed to achieve a well balanced load across the virtual machines while trying to minimize the makespan of a given workflow application. To evaluate the performance of the enhancement algorithm, we compare our algorithm with some existing scheduling algorithms. Experimental results show that our algorithm outperforms other algorithms by reducing the makespan and improving load balance among virtual machines.

12 November 2017 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
YSyassir samadi
yassir samadi
MZMostapha Zbakh
Mostapha Zbakh
CTClaude Tadonki
Claude Tadonki

1 May 2016
Verified
Conference Paper
Closed access
YSyassir samadi
yassir samadi
MZMostapha Zbakh
Mostapha Zbakh
CTClaude Tadonki
Claude Tadonki
Big Data is currently a hot topic for companies and scientists around the world, due to the emergence of new technologies, devices and communication means like social network sites, which led to a noticeable increase of the amount of data produced every year, even every day. In addition, traditional algorithms and technologies are inefficient to process, analyze and store this vast amount of data. So, to solve this problem, Big Data frameworks are needed. In this paper, we present and discuss a performance comparison between two popular Big Data frameworks. Hadoop and Spark, which are used to efficiently process vast amount of data in parallel and distributed mode on a large clusters. Hibench benchmark suite is used to compare the performance of these two frameworks based on the criteria as execution time, throughput and speedup. Our experimental results show that Spark is more efficient than Hadoop to deal with large amount of data. However, spark requires higher memory allocation, since it loads processes into memory and keeps them in caches for a while, just like standard databases. So the choice depends on performance level and memory constraints.

28 July 2018
Verified
Book Chapter
Closed access
PDF file
YSyassir samadi
yassir samadi
ZMZbakh Mostapha
Zbakh Mostapha
TCTadonki Claude
Tadonki Claude

11 September 2018 in International Journal of Computers and Applications
Verified
Journal Article
Closed access
YSyassir samadi
yassir samadi
MZMostapha Zbakh
Mostapha Zbakh
CTClaude Tadonki
Claude Tadonki
The increasing demand of cloud computing motivates researchers to make cloud environments more efficient for its users and more profitable for the providers. More and more datacenters are being built to cater customers' needs. However, datacenters consume large amounts of energy, and this draws negative attention. Therefore, cloud providers are confronted with great pressures to reduce the energy consumed by datacenters. To address this issue, efficient algorithms to reduce energy consumption and to guarantee the quality of service are needed. In this paper, we propose a load balancing algorithm named DT-MG, which aims to reduce energy consumption and maximize the efficiency of the available resources. First, we used the Matching Game Theory model for assigning tasks to datacenters. We then study the optimal operation of the resources by migrating all the tasks of the physical machine under sub-regime to other physical machine, followed by their systematic switch to standby mode. Experimental results prove that the proposed approach reduces energy consumption and the number of task migration while maintaining the service level agreement in comparison with some existing techniques.

29 March 2017
Verified
Conference Paper
Open access
PDF file
YSyassir samadi
yassir samadi
MZMostapha Zbakh
Mostapha Zbakh
In this paper, we discuss a load balancing strategy in heterogeneous cloud environments. Load balancing of data processing takes a very important place in cloud computing for several years. Load balancing on cloud systems is critical problem that is difficult to cope with, especially on the emerging heterogeneous clusters. In this aspect, we propose a threshold-based load balancing algorithm that balances the load among datacenters in cloud environments as well as minimizing remote communication among datacenters. The proposed approach is divided into two phases. Firstly, we specify the load threshold of each datacenter based on its processing speed and storage capacity. Secondly, we maintain load balancing among datacenters based on this threshold while the proposed approach takes into consideration the heterogeneity of datacenters. The results show that our approach improve efficiently the load balancing among datacenters.