Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.
15 October 2015 in International Journal of Biomathematics
Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases leads to an urgent need for accelerating these computations.DistVectalgorithm was introduced in the paper of Al-Neama et al. (in press) to present a recent approach for vectorizing distance matrix computing. It showed an efficient performance in both sequential and parallel computing. However, the multicore cluster systems, which are available now, with their scalability and performance/cost ratio, meet the need for more powerful and efficient performance. This paper proposesDistVect1as highly efficient parallel vectorized algorithm with high performance for computing distance matrix, addressed to multicore clusters. It reformulatesDistVect1vectorized algorithm in terms of clusters primitives. It deduces an efficient approach of partitioning and scheduling computations, convenient to this type of architecture. Implementations employ potential of both MPI and OpenMP libraries. Experimental results show that the proposed method performs improvement of around 3-fold speedup upon SSE2. Further it also achieves speedups more than 9 orders of magnitude compared to the publicly available parallel implementation utilized in ClustalW-MPI.
Cybercrime gained traction in the late 20th century. The capabilities of cyber-attackers have improved dramatically. One of the biggest challenges facing cybersecurity developers is safeguarding consumers' security and privacy. Interest in using AI approaches in cybersecurity has grown significantly because of the incredible proficiency these techniques have demonstrated across all domains. Even while machine learning algorithms are very effective at identifying malicious activity, there are still certain issues that lower performance accuracy. This paper has the novelty of deploying the Artificial Bee Colony (ABC) meta-heuristic algorithm with the K-Nearest Neighbors (KNN) classifier to detect cyber-attacks. It proposes a variant approach called KNN+Bee that detects attacks efficiently, achieving 99.86% overall accuracy. The NSL-KDD dataset of cyberattacks has been leveraged in the training and testing phases. The proposed approach has been contrasted with the most popular machine learning. According to experimental findings, the suggested model delves deeper into the identification of cyberattacks. It achieves unprecedented performance, outperforming other models in terms of precision, Recall, F-score and MCC. Furthermore, popular deep learning models have been implemented and examined on the same dataset. Results prove that GRU is the most accurate, reaching 99.71%.