scholarly journals Uncertainty-aware workflow migration among edge nodes based on blockchain

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Zhanyang Xu ◽  
Qingfan Geng ◽  
Hao Cao ◽  
Chuanjian Wang ◽  
Xihua Liu
Keyword(s):  
Genetic Algorithm ◽  
Graph Theory ◽  
Energy Consumption ◽  
Directed Acyclic Graph ◽  
Processing Time ◽  
Resource Provisioning ◽  
Workflow Scheduling ◽  
Acyclic Graph ◽  
Time And Energy ◽  
Workflow Tasks

Abstract Workflow is one of the most typical applications in distributed computing, which makes a variety of complex computing work orderly. However, assigning workflow tasks to nodes in the process of multi-node collaboration is still a challenge, because there are some unpredictable emergencies, i.e., uncertainty, in the process of workflow scheduling. The paper proposes a blockchain-powered resource provisioning (BPRP) method to solve the above problems. Technically, we use the directed acyclic graph in the graph theory to represent the workflow task and optimize the workflow scheduling strategy in the presence of uncertainty. The processing time and energy consumption of workflow tasks are also optimized by using non-dominated sorting genetic algorithm III (NSGA-III). Finally, we carry out experimental simulations to verify the effectiveness of the proposed method.

scholarly journals Scheduling Workflow Applications with Makespan and Reliability Constraints

2018 ◽  
Vol 12 (2) ◽  
pp. 482 ◽  
Author(s):  
Maslina Abdul Aziz ◽  
Jemal H. Abawajy ◽  
Morshed Chowdhury
Keyword(s):  
Quality Of Service ◽  
Directed Acyclic Graph ◽  
Processing Time ◽  
Workflow Scheduling ◽  
Acyclic Graph ◽  
Workflow System ◽  
Qos Parameters ◽  
Scheduling Management ◽  
Workflow Application

In the last few years, workflows are becoming richer and more complex. Workflow scheduling management system to be robust, flexible with multicriteria scheduling algorithms. It needs to satisfy the Quality of Service (QoS) parameters. However, QoS parameters and workflow system objectives are often contradictory. In our analysis, we derived an efficient strategy to minimize the overall processing time for scheduling workflows modelled by using Directed Acyclic Graph (DAG). We studied the problem of workflow scheduling that lead to optimizing makespan and reliability. The proposed algorithm handles unsuccessful job execution or resource failure by dynamically scheduling workflows to available resources. Based on the experiments results, our proposed Failure-Aware Workflow Scheduling (FAWS) Algorithm can significantly optimize the makespan and minimize the reliability by rescheduling the failed task to the unused resources. The effectiveness of the FAWS algorithm was validated based on a simulation-driven analysis based on the workflow application.

Problem-Independent Approach to Multiprocessor Dependent Task Scheduling

2012 ◽  
Vol 58 (4) ◽  
pp. 369-379 ◽  
Author(s):  
Dawid Król ◽  
Dawid Zydek ◽  
Leszek Koszałka
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Task Scheduling ◽  
Directed Acyclic Graph ◽  
Simulation Experiments ◽  
New Approach ◽  
Acyclic Graph ◽  
Graph Task

Abstract This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.

scholarly journals Commentary - Methods to find all the edges on any of the shortest paths between two given nodes of a directed acyclic graph

2021 ◽  
Vol 7 ◽  
Author(s):  
Deepak Ahire ◽  
Omkar Jadhav
Keyword(s):  
Dynamic Programming ◽  
Graph Theory ◽  
Directed Acyclic Graph ◽  
Shortest Paths ◽  
The Other ◽  
Use Case ◽  
Counting Problems ◽  
Acyclic Graph ◽  
Questions And Answers ◽  
Community Portal

This article puts forth all the existing methods proposed by the various authors of the Stack Exchange community to find all the edges on any shortest path between two given nodes of a directed acyclic graph. For a directed acyclic graph with N number of nodes, an exponential number of paths are possible between any two given nodes and, thus, it is not feasible to compute every path and find the shortest ones in polynomial time to generate a set of all edges that contribute or make any of the shortest paths. The methods discussed in this article are not limited only to this specific use case, but have a much broader scope in graph theory, dynamic programming and counting problems. Generally, various other questions and answers, raised on the community portal having similar scope to those that the users specifically seek, do not receive sufficient hits and, hence, enough attention and votes for various reasons worth contemplating. Therefore, this article also aims to highlight the various scopes of the methods discussed in this article and acknowledge the efforts of the authors, moderators and contributors of the Stack Exchange community for their expertise and time to write precise answers and share their opinions and advice. Finally, it also appeals to all the other beneficiaries in the community to use their privileges responsibly and upvote the posted answers, if they helped solve their queries, as one upvote is free of cost.

Study on Custom Service Combination Based on BPEL

2012 ◽  
Vol 605-607 ◽  
pp. 2451-2456
Author(s):  
Yang Jun Cai ◽  
Zhao Le
Keyword(s):  
Web Service ◽  
Business Process ◽  
Directed Acyclic Graph ◽  
Processing Time ◽  
Business Logic ◽  
Service Description ◽  
Description Language ◽  
Business Process Execution Language ◽  
Acyclic Graph ◽  
Business Process Execution

A custom service combination based on Business Process Execution Language was put forward. It mainly studied one-off recipient and keeping the business logic order unchanged. It was proposed a solution that made the serial workflow realize the local parallelism from three aspects such as message dependency, a directed acyclic graph to workflow, and the implicit message dependency. The algorithm of implementation was also discussed. A custom service combination application of ‘stocking house transactions’ and ‘stocking house mortgage’ showed the feasibility and validity of this algorithm. The system generates the BPEL by analyzing various business stakeholders’ Web Service Description Language interface thereby determining the dependence of each business order, together with maintaining the existing business logic. The BPEL enhances the local parallel processing, and makes the overall processing time reduced.

scholarly journals Using of a weighted directed acyclic graph for major repairs of real estate objects: the optimal combination of energy-efficient measures introduction

2021 ◽  
Vol 258 ◽  
pp. 09051
Author(s):  
Elena Gorbaneva ◽  
Valery Mishchenko ◽  
Kristina Sevryukova ◽  
Elena Ovchinnikova
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Directed Acyclic Graph ◽  
Housing Stock ◽  
Residential Buildings ◽  
Large Cities ◽  
Acyclic Graph ◽  
Apartment Buildings ◽  
Energy Consumption Analysis ◽  
Efficient Measures

Energy consumption analysis by regions of the world for the period from 2005 to 2019 showed that the growth of energy consumption is only increasing every year and requires certain energy-efficient measures. The largest energy consumption is in the construction sector, namely in residential buildings, which is associated with the large cities urbanization. Energy consumption depends not only on the energy efficiency of the temperature and lighting control systems, but also on the efficiency of the buildings in which they operate. Based on this, the housing stock of the city of Voronezh, which was conditionally divided into “old apartment buildings” and “new apartment buildings” (depending on the building period) was considered. Multi-apartment buildings were considered, taking into account various characteristics in order to identify the actual characteristics that affect energy consumption. Based on the data obtained, a statistical analysis of energy consumption in old apartment buildings and new ones, respectively, was carried out. On the basis of the research an algorithm was proposed for the energy-efficient measures introduction when planning major repairs in apartment buildings (AB) using a weighted directed acyclic graph.

scholarly journals Economical Speed for Optimizing the Travel Time and Energy Consumption in Train Scheduling using a Fuzzy Multi-Objective Model

2021 ◽  
Author(s):  
Ahmad Reza Jafarian-Moghaddam
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Pollutant Emissions ◽  
Scheduling Problems ◽  
Train Scheduling ◽  
Multi Objective ◽  
Consumption Ratio ◽  
Proposed Model ◽  
Objective Model ◽  
Time And Energy

AbstractSpeed is one of the most influential variables in both energy consumption and train scheduling problems. Increasing speed guarantees punctuality, thereby improving railroad capacity and railway stakeholders’ satisfaction and revenues. However, a rise in speed leads to more energy consumption, costs, and thus, more pollutant emissions. Therefore, determining an economic speed, which requires a trade-off between the user’s expectations and the capabilities of the railway system in providing tractive forces to overcome the running resistance due to rail route and moving conditions, is a critical challenge in railway studies. This paper proposes a new fuzzy multi-objective model, which, by integrating micro and macro levels and determining the economical speed for trains in block sections, can optimize train travel time and energy consumption. Implementing the proposed model in a real case with different scenarios for train scheduling reveals that this model can enhance the total travel time by 19% without changing the energy consumption ratio. The proposed model has little need for input from experts’ opinions to determine the rates and parameters.

scholarly journals An Optimal Footprint Based Coverage Planning for Hydro Blasting Robots

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1194
Author(s):  
Thejus Pathmakumar ◽  
Madan Mohan Rayguru ◽  
Sriharsha Ghanta ◽  
Manivannan Kalimuthu ◽  
Mohan Rajesh Elara
Keyword(s):  
Genetic Algorithm ◽  
Mobile Robots ◽  
Numerical Simulations ◽  
Labour Force ◽  
Successful Implementation ◽  
Multi Objective Optimization ◽  
Metallic Surfaces ◽  
Industrial Sites ◽  
Experimental Trials ◽  
Time And Energy

The hydro blasting of metallic surfaces is an essential maintenance task in various industrial sites. Its requirement of a considerable labour force and time, calls for automating the hydro blasting jobs through mobile robots. A hydro blasting robot should be able to cover the required area for a successful implementation. If a conventional robot footprint is chosen, the blasting may become inefficient, even though the concerned area is completely covered. In this work, the blasting arm’s sweeping angle is chosen as the robot’s footprint for hydro blasting task, and a multi-objective optimization-based framework is proposed to compute the optimal sweeping arc. The genetic algorithm (GA) methodology is exploited to compute the optimal footprint, which minimizes the blasting time and energy simultaneously. Multiple numerical simulations are performed to show the effectiveness of the proposed approach. Moreover, the strategy is successfully implemented on our hydro blasting robot named Hornbill, and the efficacy of the proposed approach is validated through experimental trials.

Sign in / Sign up

Export Citation Format

Share Document