Increase analysis in the total execution time of a parallel program

Author(s):  
Dingchao Li ◽  
H. Takagi ◽  
N. Ishii
1988 ◽  
Vol 11 (1) ◽  
pp. 1-19
Author(s):  
Andrzej Rowicki

The purpose of the paper is to consider an algorithm for preemptive scheduling for two-processor systems with identical processors. Computations submitted to the systems are composed of dependent tasks with arbitrary execution times and contain no loops and have only one output. We assume that preemptions times are completely unconstrained, and preemptions consume no time. Moreover, the algorithm determines the total execution time of the computation. It has been proved that this algorithm is optimal, that is, the total execution time of the computation (schedule length) is minimized.


2021 ◽  
Vol 11 (3) ◽  
pp. 72-91
Author(s):  
Priyanka H. ◽  
Mary Cherian

Cloud computing has become more prominent, and it is used in large data centers. Distribution of well-organized resources (bandwidth, CPU, and memory) is the major problem in the data centers. The genetically enhanced shuffling frog leaping algorithm (GESFLA) framework is proposed to select the optimal virtual machines to schedule the tasks and allocate them in physical machines (PMs). The proposed GESFLA-based resource allocation technique is useful in minimizing the wastage of resource usage and also minimizes the power consumption of the data center. The proposed GESFL algorithm is compared with task-based particle swarm optimization (TBPSO) for efficiency. The experimental results show the excellence of GESFLA over TBPSO in terms of resource usage ratio, migration time, and total execution time. The proposed GESFLA framework reduces the energy consumption of data center up to 79%, migration time by 67%, and CPU utilization is improved by 9% for Planet Lab workload traces. For the random workload, the execution time is minimized by 71%, transfer time is reduced up to 99%, and the CPU consumption is improved by 17% when compared to TBPSO.


2014 ◽  
Vol 607 ◽  
pp. 872-876 ◽  
Author(s):  
Xiao Guang Ren

Computational Fluid Dynamics (CFD) is widely applied for the simulation of fluid flows, and the performance of the simulation process is critical for the simulation efficiency. In this paper, we analyze the performance of CFD simulation application with profiling technology, which gets the portions of the main parts’ execution time. Through the experiment, we find that the PISO algorithm has a significant impact on the CFD simulation performance, which account for more than 90% of the total execution time. The matrix operations are also account for more than 60% of the total execution time, which provides opportunity for performance optimization.


2014 ◽  
Vol 571-572 ◽  
pp. 17-21
Author(s):  
Rong Huang ◽  
An Ping Xiong ◽  
Yang Zou

MapReduce is one of the core framework of Hadoop, it’s computing performance has been widely concerned and researched. In heterogeneous environment, unreasonable map task assignments and inefficient resource utilization lead to multiple backup tasks and the job total execution time is poor.For these problems, this paper proposes a new map task assignment strategy, which is map task dynamic balancing strategy based on file label. The strategy marks on job according to the different types, estimates node computing capabilities and historical processing efficiency of each label task, ensures map task which was assigned can execute successfully. Experiments show that, the strategy can effectively reduce number of backup tasks in map phase, and to some extent optimize the total execution time of the job.


2019 ◽  
Vol 19 (4) ◽  
pp. 186-192
Author(s):  
A. P. Demichkovskyi

The purpose of the study was to define informative indicators of technical and tactical actions of qualified rifle shooting athletes. Materials and methods. The study involved MSU (number of athletes n = 10), CMSU (number of athletes n = 9). To solve the tasks set, the following research methods were used: analysis and generalization of scientific and methodological literature, pedagogical observation. Pedagogical observation was used to study the peculiarities of technical and tactical indicators of qualified athletes, as well as their motor abilities; methods of mathematical statistics were used to process the experimental data. Results. A detailed analysis of competitive activity made it possible to determine that the shot phases “Aiming”, “Shot execution – active shot”, “Preparation for the shot” are informative indicators of technical and tactical actions of qualified rifle shooting athletes. The study determined time parameters of the phases during competitive activity. The difference between the average indicators of the athletes with different sports qualifications is at the limit of 2.55 seconds, which suggests that the duration of the restorative processes of the shooter’s body affects the performance of each shot.  Conclusions. A detailed analysis of air rifle shooting among men during competitive activity allowed to determine the difference in technical and tactical fitness between the athletes with different sports qualifications of MSU and CMSU levels: “Aiming” – MSU 950.56 seconds, CMSU 1017.91 seconds; “Shot execution – active shot” – MSU 964.45 seconds, CMSU 952.36 seconds; “Preparation for the shot” – MSU 1678.66 seconds, CMSU 1855.19 seconds, “Total execution time” – MSU 3593.68 seconds, CMSU 3825.47 seconds.


2021 ◽  
Author(s):  
Mahboubeh Shamsi ◽  
Abdolreza Rasouli Kenari ◽  
Roghayeh Aghamohammadi

Abstract On a graph with a negative cost cycle, the shortest path is undefined, but the number of edges of the shortest negative cost cycle could be computed. It is called Negative Cost Girth (NCG). The NCG problem is applied in many optimization issues such as scheduling and model verification. The existing polynomial algorithms suffer from high computation and memory consumption. In this paper, a powerful Map-Reduce framework implemented to find the NCG of a graph. The proposed algorithm runs in O(log k) parallel time over O(n3) on each Hadoop nodes, where n; k are the size of the graph and the value of NCG, respectively. The Hadoop implementation of the algorithm shows that the total execution time is reduced by 50% compared with polynomial algorithms, especially in large networks concerning increasing the numbers of Hadoop nodes. The result proves the efficiency of the approach for solving the NCG problem to process big data in a parallel and distributed way.


2020 ◽  
Vol 32 (18) ◽  
pp. 14817-14838
Author(s):  
Danlami Gabi ◽  
Abdul Samad Ismail ◽  
Anazida Zainal ◽  
Zalmiyah Zakaria ◽  
Ajith Abraham ◽  
...  

Abstract With growing demand on resources situated at the cloud datacenters, the need for customers’ resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers’ expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers’ expectations while providing guaranteed performance of the whole cloud computing environment.


2005 ◽  
Vol 14 (03) ◽  
pp. 605-617 ◽  
Author(s):  
SUNG WOO CHUNG ◽  
HYONG-SHIK KIM ◽  
CHU SHIK JHON

In scalable CC-NUMA multiprocessors, it is crucial to reduce the average memory access time. For applications where the second-level (L2) cache is large enough, we propose a split L2 cache to utilize the surplus space. The split L2 cache is composed of a traditional LRU cache and an RVC (Remote Victim Cache) which only stores the data of remote memory address range. Thus, it reduces the average L2 cache miss time by keeping remote blocks that would be discarded otherwise. Though the split cache does not reduce the miss rates, it is observed to reduce the total execution time effectively by up to 27%.It even outperform an LRU cache of double size.


2010 ◽  
Vol 19 (07) ◽  
pp. 1543-1557
Author(s):  
WEI HU ◽  
TIANZHOU CHEN ◽  
QINGSONG SHI ◽  
SHA LIU

Multithreaded programming has become the dominant paradigm in computer architecture, mainly in the form of multi-core processors. The performance bottleneck of a multithreaded program is its critical path, whose length is its total execution time. As the number of cores within a processor increases, Network-on-Chip (NoC) has been proposed as a promising approach for inter-core communication. In order to optimize the performance of a multithreaded program running on an NoC based multi-core platform, we design and implement the critical-path driven router, which prioritizes inter-thread communication on the critical path when routing packets. The experimental results show that the critical-path driven router improves the execution time of the test case by 14.8% compared to the ordinary router.


Sign in / Sign up

Export Citation Format

Share Document