DACLD allows a swarm of agents with a relatively low-level of intelligence to perform complex tasks, and has the characteristic of distributed framework, multi-tasks with execution order, multi-state, adaptive response threshold and multi-individual response.
OmpSs is a programming model that provides a simple and powerful way of annotating sequential programs to exploit heterogeneity and task parallelism based on runtime data dependency analysis, dataflow scheduling and out-of-order task execution; it has greatly influenced Version 4.0 of the OpenMP standard.
It interprets S code, which specifies the temporal order of task execution.
On the other hand, in a task scheduling problem, the objective is to determine the "best" order of task execution for each sensor node.
Table 1 The structure of the tuples in GridTS (langlemathit{mboxTICKETmbox, ticket} rangle)—represents the tickets used to enforce an order on task execution.
There are two molecular structures in DMSCRO: one is used to encode the execution order of the tasks in a DAG job, and the other to encode the task-to-computing-node mapping.
We then propose a two-stage heuristic that determines the assignment, replication, operating frequency, and execution order of tasks to minimize the makespan while satisfying the real-time, reliability, and temperature constraints based on the analysis of the effects of task assignment on makespan, reliability, and temperature.
As a result, the processor's temperature, and thus the performance as well, depends on the order of the task execution.
Thus, the job requires two rounds (also called waves) of task execution in the reserved slots in order to finish.
Authors proposed SAH-DB (a task scheduling algorithm based on delay-bound constraint) in order to improve the task execution concurrency: when a task is received, all the resources (CPU, memory, and network) are sorted in a descending order based on the resources processing capacity, then the task is dispatched to resources with the minimum execution time.
