Arabi Keshk

Cloud task scheduling based on ant colony optimization

Cloud computing is the development of distributed computing, parallel computing and grid computing, or defined as the commercial implementation of these computer science concepts. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm compared with different scheduling algorithms FCFS and round-robin, has been presented. The main goal of these algorithms is minimizing the makespan of a given tasks set. Ant colony optimization is random optimization search approach that will be used for allocating the incoming jobs to the virtual machines. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the ant colony optimization outperformed FCFS and round-robin algorithms.

Virtual Machine Placement Based on Ant Colony Optimization for Minimizing Resource Wastage

Cloud computing is concept of computing technology in which user uses remote server for maintain their data and application. Resources in cloud computing are demand driven utilized in forms of virtual machines to facilitate the execution of complicated tasks. Virtual machine placement is the process of mapping virtual machines to physical machines. This is an active research topic and different strategies have been adopted in literature for this problem. In this paper, the problem of virtual machine placement is formulated as a multi-objective optimization problem aiming to simultaneously optimize total processing resource wastage and total memory resource wastage. After that ant colony optimization algorithm is proposed for solving the formulated problem. The main goal of the proposed algorithm is to search the solution space more efficiently and obtain a set of non-dominated solutions called the Pareto set. The proposed algorithm has been compared with the well-known algorithms for virtual machine placement problem existing in the literature. The comparison results elucidate that the proposed algorithm is more efficient and significantly outperforms the compared methods on the basis of CPU resource wastage and memory resource wastage.

A new methodology for Web testing

As Web sites becoming a fundamental component of businesses, quality of service will be one of the top management concerns. Users, normally, does not care about site failures, traffic jams, network bandwidth, or other indicators of system failures. To an online customer, quality of service means fast, predictable response service, level of a Web site noted in a real time. User measures the quality by response time, availability, reliability, predictability, and cost. Poor quality implies that the customer will no longer visit the site and hence the organization may loose business. The issues that affects the quality are, broken pages and faulty images, CGI-bin error messages, complex colour combinations, no back link, multiple and frequent links, etc. So we try to build a good program that can scan web site for broken links, broken images, broken pages and other common web sit e faults. Because web site cannot test as a whole in one attempt we rely in our implementation to decompose the behavior of the web site into testable components then mapping these components onto testable objects. Then we prove by using Jmeter performance testing tool that broken components on a web site has a bad effect in its performance.

Fast Dynamic Algorithm for Sequence Alignment Based On Bioinformatics

alignment is widely used in Bioinformatics for Genome Sequence difference identification. It is the main problem of computational biology. Any sequence of Deoxyribonucleic acid (DNA), Ribonucleic acid (RNA), and protein can be alignment by many algorithms called bioinformatics algorithms. This paper presents a new implemented algorithm for sequence alignment based on concepts from bioinformatics algorithms .The implemented algorithm is called fast dynamic algorithm for sequence alignment (FDASA). This implemented algorithm based on making a matrix of M×N (M is the length of the first sequence, N is the length of the second sequence), After that filling the three main diagonal without filling the unused data and at the same time get the optimal solution; so that the execution time is decreased, the performance is high and the memory location decreased. The implementation introduced in this paper made a comparison between the dynamic algorithms Needleman- Wunsch algorithm, Smith-Waterman and our algorithm FDASA to test the execution time. The results show that our algorithm FDASA decreased the execution time when compared with Needleman-Wunsch and Smith-Waterman algorithms.

Automated testing of java menu-based GUIs using XML visual editor

A common method for GUI testing is the capture and replay (CR) technique. While the commonly used of CR technique can not be used until an application under test (AUT) is completely developed. In this paper we propose a specification-driven approach to test menu-based Java GUI programs as an alternative to the CR technique. We introduce a GUI-event test specification language based on XML from which an automated test engine is generated. The popularity of XML as a scripting language is ease of use and its standard format. Along with our visual test scripts editor have made writing a test script using our proposed method is easy task. Beside the ability to test AUT before being completely developed, we have implemented another visual module that can generate the test specification file for an already existing AUT by using only the executable file of the program (.class). The engine generates GUI events and captures its responses automatically to verify the results of the test cases, which are written to a test log file. This engine supports the menu-based GUIs that became very popular these days in programs interfaces.

Cloud Computing Online Scheduling

Cloud computing has gained a lot of attention to be used as a computing model for a variety of application domains. Task scheduling is the fundamental issue in this environment. To utilize cloud efficiently, a good task scheduling algorithm is needed to assign tasks to resources in cloud. Cloud task can be divided into two categories such as on-line mode service and the batch mode service. In this paper, online cloud task scheduling based on virtual machine adaptive fault tolerance and load balancing using ant colony algorithm is proposed. The main contribution of this work is that load balancing factor is added and the system tolerates the faults by tacking the decision on the basis of reliability of the virtual machines in scheduling process. The proposed scheduling strategy was simulated using the Cloudsim toolkit package. Experimental results show that the proposed algorithm achieved the better load balance than Join-shortest-queue (JSQ) and Modified Ant Colony Optimization (MACO) algorithms.

Improving the performance of mobile applications using cloud computing

Recently, smartphones set to become the fastest spreading technology. Although smartphones support wide range of applications like augmented reality, face detection, image processing and speech recognition, they are resource-constrained devices with limited computation power and energy. Therefore, researchers trend to solve this problem by offloading these applications or part of it to execute remotely on rich resource such as cloud computing. This paper will introduce a novel framework to improve the performance of mobile applications and save battery consumption. This framework offloads only the intensive methods. The offloading process depends on the module so-called dynamic offloader. This module decides at runtime whether the applications methods will run locally on the mobile or offload to the cloud. The experimental studies are applied on three different applications and the results show that the proposed framework improves the performance and saves energy of mobile applications.

Ensuring the Quality Testing of Web Using a New Methodology

As Web sites becoming a fundamental component of businesses, quality of service will be one of the top management concerns. Users, normally, does not care about site failures, traffic jams, network bandwidth [1], or other indicators of system failures. To an online customer, quality of service means fast, predictable response service, level of a Web site noted in a real time. User measures the quality by response time, availability, reliability, predictability, and cost. Poor quality implies that the customer will no longer visit the site and hence the organization may loose business. The issues that affect the quality are broken pages and faulty images, CGI-bin error messages, complex colour combinations, no back link, multiple and frequent links, etc. So we try to build a good program that can scan Web site for broken links, broken images, broken pages and other common Web site faults. As Web site cannot test as a whole in one attempt we rely on decomposing the behavior of the Web site into testable components and mapping these components onto testable objects. Moreover we verify our method by using Jmeter tool [2] to measure the performance of Web, which indicate that broken components on a Web site has a bad effect in its performance.

Software-based BIST for Analog to Digital Converters in SoC

Embedded software based self testing has recently become focus of intense research for microprocessor and memories in SoC. In this paper, we used the testing microprocessor and memory for developing software-based self-testing of analog to digital converters in SoC. The advantage of this methodology include at speed testing, low cost, and small test time. Simulation results show that the proposed method can detect not only catastrophic faults but also some parametric faults.

Development of remotely secure e-voting system

Due to the importance of the election process, it is developed to be performed electronically in a secure manner by using electronic voting (e-voting), this leads to find a way to do to grantee this requirements. Electronic voting should be developed to achieve requirements of election process with a relative high degree of security and accuracy. In this paper a secure remote e-voting system is developed trying to achieve all security requirements. The security strategy is based on the homomorphic encryption technique which can be considered the most suitable method for such application.