scholarly journals HPEFT for Hierarchical Heterogeneous Multi-DAG in a Multigroup Scan UPA System

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 498
Author(s):  
Yuzhong Li ◽  
Wenming Tang ◽  
Guixiong Liu
Keyword(s):  
Signal Processing ◽  
Scheduling Algorithm ◽  
Frame Rate ◽  
Hierarchical Processing ◽  
Finish Time ◽  
System A ◽  
Time Period ◽  
Upa System ◽  
Ultrasonic Phased Array ◽  
Earliest Finish Time

Multidirected acyclic graph (DAG) workflow scheduling is a key problem in the heterogeneous distributed environment in the distributed computing field. A hierarchical heterogeneous multi-DAG workflow problem (HHMDP) was proposed based on the different signal processing workflows produced by different grouping and scanning modes and their hierarchical processing in specific functional signal processing modules in a multigroup scan ultrasonic phased array (UPA) system. A heterogeneous predecessor earliest finish time (HPEFT) algorithm with predecessor pointer adjustment was proposed based on the improved heterogeneous earliest finish time (HEFT) algorithm. The experimental results denote that HPEFT reduces the makespan, ratio of the idle time slot (RITS), and missed deadline rate (MDR) by 3.87–57.68%, 0–6.53%, and 13–58%, respectively, and increases relative relaxation with respect to the deadline (RLD) by 2.27–8.58%, improving the frame rate and resource utilization and reducing the probability of exceeding the real-time period. The multigroup UPA instrument architecture in multi-DAG signal processing flow was also provided. By simulating and verifying the scheduling algorithm, the architecture and the HPEFT algorithm is proved to coordinate the order of each group of signal processing tasks for improving the instrument performance.

scholarly journals EHEFT-R: multi-objective task scheduling scheme in cloud computing

2021 ◽  
Author(s):  
Honglin Zhang ◽  
Yaohua Wu ◽  
Zaixing Sun
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Solution Space ◽  
Finish Time ◽  
Task Scheduling Algorithm ◽  
Matching Efficiency ◽  
Earliest Finish Time ◽  
Core Issues

AbstractIn cloud computing, task scheduling and resource allocation are the two core issues of the IaaS layer. Efficient task scheduling algorithm can improve the matching efficiency between tasks and resources. In this paper, an enhanced heterogeneous earliest finish time based on rule (EHEFT-R) task scheduling algorithm is proposed to optimize task execution efficiency, quality of service (QoS) and energy consumption. In EHEFT-R, ordering rules based on priority constraints are used to optimize the quality of the initial solution, and the enhanced heterogeneous earliest finish time (HEFT) algorithm is used to ensure the global performance of the solution space. Simulation experiments verify the effectiveness and superiority of EHEFT-R.

scholarly journals Scalable workflow scheduling algorithm for minimizing makespan and failure probability

2019 ◽  
Vol 8 (1) ◽  
pp. 283-290
Author(s):  
Maslina Abdul Aziz ◽  
Izuan Hafez Ninggal
Keyword(s):  
Failure Probability ◽  
Critical Path ◽  
Scheduling Algorithm ◽  
Parallel Applications ◽  
Workflow Scheduling ◽  
System A ◽  
Conflicting Objectives ◽  
Simulation Results ◽  
Earliest Finish Time ◽  
Workflow Application

This paper presents an algorithm called Failure-Aware Workflow Scheduling (FAWS). The proposed algorithm discussed in this paper schedules parallel applications on homogeneous systems without sacrificing the two conflicting objectives: reliability and makespan. The proposed algorithm handles unexpected failure causes rescheduling of the failed task to available resources. In order to analyse the performance of the FAWS algorithm, it will be compared with the popular scheduling algorithm namely Heterogeneous Earliest Finish Time (or HEFT) and Critical Path (CP). A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). The FAWS algorithm aims to minimize the makespan, increases reliability and therefore boosts the performance of the whole system. A workflow generator was developed to generate large task graphs randomly and scheduled the parallel applications. Based on the simulation results, the proposed algorithm has improved the overall workflow scheduling effectiveness in comparison with existing algorithms.

scholarly journals Implementation and application of E-technologies in enterprise environment

2007 ◽  
Vol 55 (3) ◽  
pp. 67-74
Author(s):  
Roman Malo
Keyword(s):  
Short Time Period ◽  
Logical Model ◽  
System A ◽  
Theoretical System ◽  
Time Period ◽  
Business Area ◽  
Basic Concepts ◽  
Short Time ◽  
Base Platform

Nowadays, a problem of an e- technologies’ implementation represents one of the most important questions that are being solved within various subjects from business area. With respect of massive implementation of activities as e- commerce, e- payments and others the e- technologies’ implementation is the progressive way of these subjects’ expansion. However, due to relatively short time period in which enterprise subjects have solved there is a set of vague aspects going together with this problem. The paper analyses the area of e- technologies and defines relations between basic concepts. Following this theoretical system a few hypothesis are constructed and used as a base platform for a determination of the logical model for implementation of e- technologies in enterprise environment.

scholarly journals Event-Response Ellipses: A Method to Quantify and Compare the Role of Dynamic Storage at the Catchment Scale in Snowmelt-Dominated Systems

Water ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 1824 ◽  
Author(s):  
Jessica Driscoll ◽  
Thomas Meixner ◽  
Noah Molotch ◽  
Ty Ferre ◽  
Mark Williams ◽  
...  
Keyword(s):  
Water Balance ◽  
Quantitative Relation ◽  
Catchment Scale ◽  
System A ◽  
Time Period ◽  
Ellipse Method ◽  
Streamflow Response ◽  
Dynamic Storage ◽  
Event Response

A method for quantifying the role of dynamic storage as a physical buffer between snowmelt and streamflow at the catchment scale is introduced in this paper. The method describes a quantitative relation between hydrologic events (e.g., snowmelt) and responses (e.g., streamflow) by generating event-response ellipses that can be used to (a) characterize and compare catchment-scale dynamic storage processes, and (b) assess the closure of the water balance. Event-response ellipses allow for the role of dynamic, short-term storage to be quantified and compared between seasons and between catchments. This method is presented as an idealization of the system: a time series of a snowmelt event as a portion of a sinusoidal wave function. The event function is then related to a response function, which is the original event function modified mathematically through phase and magnitude shifts to represent the streamflow response. The direct relation of these two functions creates an event-response ellipse with measurable characteristics (e.g., eccentricity, angle). The ellipse characteristics integrate the timing and magnitude difference between the hydrologic event and response to quantify physical buffering through dynamic storage. Next, method is applied to eleven snowmelt seasons in two well-instrumented headwater snowmelt-dominated catchments with known differences in storage capacities. Results show the time-period average daily values produce different event-response ellipse characteristics for the two catchments. Event-response ellipses were also generated for individual snowmelt seasons; however, these annual applications of the method show more scatter relative to the time period averaged values. The event-response ellipse method provides a method to compare and evaluate the connectivity between snowmelt and streamflow as well as assumptions of water balance.

scholarly journals Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 172 ◽  
Author(s):  
Hoyoun Lee ◽  
Jinkyu Lee
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Schedulability Analysis ◽  
Timing Constraints ◽  
Limited Information ◽  
Time System ◽  
Real Time System ◽  
System A ◽  
The Future ◽  
Earliest Deadline

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.

Sign in / Sign up

Export Citation Format

Share Document