Parallel Job Execution to Minimize Overall Execution Time and Individual Schedule Time Using Modified Credit-Based Firefly Algorithm

Author(s):  
Hardeep Kaur ◽  
Anil Kumar
2013 ◽  
Vol 43 (3) ◽  
pp. 440-454 ◽  
Author(s):  
Feng Liang ◽  
Yunzhen Liu ◽  
Hai Liu ◽  
Shilong Ma ◽  
Bettina Schnor

Author(s):  
Leena Singh ◽  
Shailendra Narayan Singh ◽  
Sudhir Dawra

Background: In today’s era, modifications in a software is a common requirement by customers. When changes are made to existing software, re-testing of all the test cases is required to ensure that the newly introduced changes do not have any unwanted effect on the behavior of the software. However, re-testing of all the test cases would not only be time consuming but also expensive. Therefore, there is a need for a technique that reduces the number of tests to be performed. Regression testing is one of the ways to reduce the number of test cases. Selection technique is one such method which seeks to identify the test cases that are relevant to some set of recent changes. Objective: It is evident that most of the studies have used different selection techniques and have focused only on one parameter for achieving reduced test suite size without compromising the performance of regression testing. However, to the best of our knowledge, no study has taken two or more parameters of coverage, and/or execution time in a single testing. This paper presents a hybrid technique that combines both regression test selection using slicing technique and minimization of test cases using modified firefly algorithm with combination of parameters coverage and execution time in a single testing. Methods: A hybrid technique has been described that combines both selection and minimization. Selection of test cases is based upon slicing technique while minimization is done using firefly algorithm. Hybrid technique selects and minimizes the test suite using information on statement coverage and execution time. Results: The proposed technique gives 43.33% much superior result as compared to the other hybrid approach in terms of significantly reduced number of test cases. It shows that the resultant test cases were effective enough to cover 100% of the statements, for all the programs. The proposed technique was also tested on four different programs namely Quadratic, Triangle, Next day, Commission respectively for test suite selection and minimization which gave comparatively superior result in terms of reduction (%) in number of test cases required for testing. Conclusion: The combination of parameters used in slicing based approach, reduces the number of test cases making software testing an economical, feasible and time saving option without any fault in the source code. This proposed technique can be used by software practitioners/experts to reduce time, efforts and resources for selection and minimization of test cases.


1997 ◽  
Vol 07 (01) ◽  
pp. 89-100 ◽  
Author(s):  
Timothy Brecht ◽  
Xiaotie Deng ◽  
Nian Gu

We study dynamic multiprocessor allocation policies for parallel jobs, which allow the preemption and reallocation of processors to take place at any time. The objective is to minimize the completion time of the last job to finish executing (the makespan). We characterize a parallel job using two parameter. The job's parallelism, Pi, which is the number of tasks being executed in parallel by a job, and its execution time, li, when Pi processors are allocated to the job. The only information available to the scheduler is the parallelism of jobs. The job execution time is not known to the scheduler until the job's execution is completed. We apply the approach of competitive analysis to compare preemptive scheduling policies, and are interested in determining which policy achieves the best competitive ratio (i.e., is within the smallest constant factor of optimal). We devise an optimal competitive scheduling policy for scheduling two parallel jobs on P processors. Then, we apply the method to schedule N parallel jobs on P processors. Finally we extend our work to incorporate jobs for which the number of parallel tasks changes during execution (i.e., jobs with multiple phases of parallelism).


2021 ◽  
Author(s):  
Gomathi Ramalingam

Abstract Querying and retrieving Semantic Web data is a challenging task due to the increment in its volume. Many query languages were designed to retrieve Semantic Web data. A popular querying method of communication in Semantic Web is SPARQL. The query languages were designed with some optimization strategies, and it was found in literature that these query languages were not able to handle large volume of data efficiently. In this research, a Modified Firefly Algorithm (MFA) is applied to optimize the SPARQL queries so that it can retrieve data from a large Semantic Web repository efficiently by reducing query execution time. Every query will have multiple query plans generated with different cost values. The challenge is to choose the best query plan which reduces the query cost and query execution time. The proposed algorithm uses the best query plan in the previous iteration to calculate the distance between two query plans using the radius parameter. The proposed algorithm generates a query plan which is a global optimal solution. MFA is evaluated using the BioPortal dataset with triples containing breast cancer. Experimental analysis is conducted to identify the significant improvement in performance of the proposed work with the existing nature inspired query optimization algorithms. The efficiency of MFA is compared with other algorithms in terms of query execution time and the performance is evaluated.


The adaptive firefly algorithm (AFA) is developed based on an elitism operator. Elitism operators can perform the function of updating the effectiveness of diversification in a search algorithm. In this study, a strategy was proposed to upgrade the FA concerning static issues. Most traditionally, for evolutionary algorithms, elitism suggests that the best solution found is utilized to work for the next generation. Elitism involves the replication of a small set of the fittest candidate solutions, which remain unaltered, into succeeding generations. The condition can radically impact execution time by ensuring that the El waste no time on re-finding newly-disposed partial solutions. Candidates who stay protected and unmodified via elitism all meet the requirements for parent selection in terms of rearing the remainder of the succeeding generation. This study used different tuning parameters, such as the number of fireflies, iterations and switching probability. To ensure that AFA could perform for t-way testing as useful as other strategies to generate the best performance. Considering the standard covering array (N, 2,𝟓 𝟕 ) it demonstrates the tuning parameters for AFA to improve elitism. In this paper, the Findings show that AFA, as well as t-way testing, can deliver the minimum requirements and sufficient results


2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.


CCIT Journal ◽  
2015 ◽  
Vol 9 (1) ◽  
pp. 13-26
Author(s):  
Indri Handayani ◽  
Qurotul Aini ◽  
Yessy Oktavyanti

      Progress of technology and its developed is going so rapidly nowadays and it provide big affect on human life, some of them were education and daily life. Due to its development we also know the other form of calendar which is in digital form that we usually found in gadgets such as handphone or tablets and surely it is portable. Rinfo which is an email supporting facilities for the needs of Raharja College may help Pribadi Raharja in coordination and communication about task and/or event. Rinfo has some applications that integrated with Rinfo itself, such as RinfoGroup, RinfoSites, RinfoDocs, RinfoDrive, RinfoH and RinfoCal. RinfoCal is an calendar application that can be use as schedule time reminder application and it will send any reminder not only to one person but some or couple persons. RinfoCal may sent an pop-up notification or email notification. This paper will discuss about what is RinfoCal, how to use it, what’s the purpose of using RinfoCal, benefit of RinfoCal and so on. But, instead of its benefit, there are also some shortages including many people who using Rinfo doesn’t get the benefit of RinfoCal because they just pretending that RinfoCal is just an usual calendar.  This paper also present six problems from conventional reminder that will solved by RinfoCal fews are just doing reminders only once at a time or just remembering only one person, a mind mapping to simplify the analyze of problem and make the best solution, eight literature reviews that had been done to help analyzing problems of research. 


Author(s):  
Chauhan Usha ◽  
Singh Rajeev Kumar

Digital Watermarking is a technology, to facilitate the authentication, copyright protection and Security of digital media. The objective of developing a robust watermarking technique is to incorporate the maximum possible robustness without compromising with the transparency. Singular Value Decomposition (SVD) using Firefly Algorithm provides this objective of an optimal robust watermarking technique. Multiple scaling factors are used to embed the watermark image into the host by multiplying these scaling factors with the Singular Values (SV) of the host image. Firefly Algorithm is used to optimize the modified host image to achieve the highest possible robustness and transparency. This approach can significantly increase the quality of watermarked image and provide more robustness to the embedded watermark against various attacks such as noise, geometric attacks, filtering attacks etc.


Sign in / Sign up

Export Citation Format

Share Document