Flexible Static Scheduling of Software with Logical Execution Time Constraints

2010 ◽  
Author(s):  
Patricia Derler ◽  
Stefan Resmerita
Keyword(s):  
Execution Time ◽  
Time Constraints ◽  
Static Scheduling

A Resource-Aware Dynamic Load-Balancing Parallelization Algorithm in a Farmer-Worker Environment

2012 ◽  
pp. 88-104
Author(s):  
M. Leeman
Keyword(s):  
Load Balancing ◽  
Dynamic Load ◽  
Execution Time ◽  
Time Frame ◽  
Parallel Programs ◽  
Time Constraints ◽  
Digital Television ◽  
Television Content ◽  
Content Processing ◽  
Resource Aware

This paper describes an algorithm for dynamically assigning tasks to processing entities in a world where each task has a set of resource or service requirements and each processing entity a set of resources or service capabilities. A task needs to be assigned to a node that offers all required services and the set of tasks is finished within a minimal execution time frame. Dependability and adaptability are inherent to the algorithm so that it accounts for the varying execution time of each task or the failure of a processing node. The algorithm is based on a dependable technique for farmer-worker parallel programs and is enhanced for modeling the time constraints in combination with the required configuration set in a multidimensional resources model. This paper describes how the algorithm is used for dynamically load balancing and parallelizing the nightly tests of a digital television content-processing embedded device.

Building Ant System for Multi-Faceted Test Case Prioritization

2022 ◽  
pp. 671-686
Author(s):  
Manoj Kumar Pachariya
Keyword(s):  
Experimental Study ◽  
Empirical Study ◽  
Execution Time ◽  
Optimal Solution ◽  
Time Constraints ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Ant System ◽  
Software Infrastructure

This article presents the empirical study of multi-criteria test case prioritization. In this article, a test case prioritization problem with time constraints is being solved by using the ant colony optimization (ACO) approach. The ACO is a meta-heuristic and nature-inspired approach that has been applied for the statement of a coverage-based test case prioritization problem. The proposed approach ranks test cases using statement coverage as a fitness criteria and the execution time as a constraint. The proposed approach is implemented in MatLab and validated on widely used benchmark dataset, freely available on the Software Infrastructure Repository (SIR). The results of experimental study show that the proposed ACO based approach provides near optimal solution to test case prioritization problem.

Building Ant System for Multi-Faceted Test Case Prioritization

2020 ◽  
Vol 8 (2) ◽  
pp. 23-37
Author(s):  
Manoj Kumar Pachariya
Keyword(s):  
Experimental Study ◽  
Empirical Study ◽  
Execution Time ◽  
Optimal Solution ◽  
Time Constraints ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Ant System ◽  
Software Infrastructure

This article presents the empirical study of multi-criteria test case prioritization. In this article, a test case prioritization problem with time constraints is being solved by using the ant colony optimization (ACO) approach. The ACO is a meta-heuristic and nature-inspired approach that has been applied for the statement of a coverage-based test case prioritization problem. The proposed approach ranks test cases using statement coverage as a fitness criteria and the execution time as a constraint. The proposed approach is implemented in MatLab and validated on widely used benchmark dataset, freely available on the Software Infrastructure Repository (SIR). The results of experimental study show that the proposed ACO based approach provides near optimal solution to test case prioritization problem.

Test case prioritization and selection technique in continuous integration development environments: a case study

2018 ◽  
Vol 7 (2.28) ◽  
pp. 332 ◽  
Author(s):  
Lei Xiao ◽  
Huaikou Miao ◽  
Ying Zhong
Keyword(s):  
Execution Time ◽  
Regression Testing ◽  
Time Constraints ◽  
Test Case ◽  
Test Cases ◽  
Test Case Prioritization ◽  
Selection Technique ◽  
Continuous Integration ◽  
Study Results

Regression testing is a very important activity in continuous integration development environments. Software engineers frequently integrate new or changed code that involves in a new regression testing. Furthermore, regression testing in continuous integration development environments is together with tight time constraints. It is also impossible to re-run all the test cases in regression testing. Test case prioritization and selection technique are often used to render continuous integration processes more cost-effective. According to multi objective optimization, we present a test case prioritization and selection technique, TCPSCI, to satisfy time constraints and achieve testing goals in continuous integration development environments. Based on historical failure data, testing coverage code size and testing execution time, we order and select test cases. The test cases of the maximize code coverage, the shorter execution time and revealing the latest faults have the higher priority in the same change request. The case study results show that using TCPSCI has a higher cost-effectiveness comparing to the manually prioritization.  

A Resource-Aware Dynamic Load-Balancing Parallelization Algorithm in a Farmer-Worker Environment

2011 ◽  
Vol 2 (1) ◽  
pp. 1-17
Author(s):  
M. Leeman
Keyword(s):  
Load Balancing ◽  
Execution Time ◽  
Time Frame ◽  
Parallel Programs ◽  
Dynamic Load Balancing ◽  
Time Constraints ◽  
Digital Television ◽  
Television Content ◽  
Content Processing ◽  
Resource Aware

This paper describes an algorithm for dynamically assigning tasks to processing entities in a world where each task has a set of resource or service requirements and each processing entity a set of resources or service capabilities. A task needs to be assigned to a node that offers all required services and the set of tasks is finished within a minimal execution time frame. Dependability and adaptability are inherent to the algorithm so that it accounts for the varying execution time of each task or the failure of a processing node. The algorithm is based on a dependable technique for farmer-worker parallel programs and is enhanced for modeling the time constraints in combination with the required configuration set in a multidimensional resources model. This paper describes how the algorithm is used for dynamically load balancing and parallelizing the nightly tests of a digital television content-processing embedded device.

scholarly journals Linear Approximation of Execution-Time Constraints

2003 ◽  
Vol 15 (4) ◽  
pp. 319-348 ◽  
Author(s):  
Karl Lermer ◽  
Colin J. Fidge ◽  
Ian J. Hayes
Keyword(s):  
Linear Approximation ◽  
Execution Time ◽  
Time Constraints
Sign in / Sign up

Export Citation Format

Share Document