Coordinated Task Scheduling, Allocation and Synchronization on Multiprocessors

Allocation problem has always been one of the fundamental issues of building the applications in real-time computing systems. For real-time applications, the allocation problem should directly address the issues of task and communication scheduling. In this context, the allocation of tasks has to fully utilize the available processors and the scheduling of tasks has to meet the specified timing constraints. Clearly, the execution of tasks under the allocation and schedule has to satisfy the precedence, resources, and other synchronization constraints among them. Recently, the timing requirements of the real-time systems emerge that the relative timing constraints are imposed on the consecutive executions of each task and the inter-task temporal relationships are specified across task periods. In this paper we consider the allocation and scheduling problem of the periodic tasks with such timing requirements. Given a set of periodic tasks, we consider the least common multiple (LCM) of the task periods. Each task is extended to several instances within the LCM. The scheduling window for each task instance is derived to satisfy the timing constraints. We develop a simulated annealing algorithm as the overall control algorithm. An example problem of the sanitized version of the Boeing 777 Aircraft Information Management System is solved by the algorithm. Experimental results show that the algorithm solves the problem in a reasonable time complexity.

Task allocation and scheduling models for distributed digital signal processing are presented. The notions of block-type and stream-type tasks in signal processing application are introduced, and models for sequential and parallel I/O are presented. By extending the traditional models, more accurate schedules can be obtained. Those models can be further enhanced by allowing additional restrictions on the number of parallel I/O ports and the amount of parallelism on memory access. The deterministic nature of digital signal processing algorithms allows for more computationally intensive and accurate task allocation techniques to be performed at compile time. By applying a branch and bound algorithm, the task allocation problem can easily be solved for a variety of scheduling models and various system restrictions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

In this paper, we tackle the problem of minimizing the power consumption of multiple-processors-core system using multiple variable supply voltages. Given a set of tasks and their dependency, and a set of target processors, we propose a method which carries out task allocation on processors, task scheduling and voltage assignment for each task concurrently. The problem is formulated as a mixed integer nonlinear programming (MINLP) optimization problem and optimal solution can be obtained. The MINLP problem is solved by the branch and bound algorithm. To reduce the run time, we propose two modifications of the formulation. Experimental results show that significant power reduction is achieved using the proposed approach.

One of the most frequent issues in multiple robot implementation is task allocation with the lowest path cost. Our study addresses the multi‐robot task allocation challenge with path costs, the lowest computing time, and task distribution. Furthermore, it is usual for a robot's processing capabilities to be restricted to operate in various target environments. As a consequence, adequate processing power consumption would demonstrate the system's efficiency. Task allocation and path planning issues must be addressed regularly to ensure multi‐robot system operation. Task allocation and path planning issues must be addressed regularly to ensure multi‐robot system operation. The above‐mentioned serious challenge gets more complicated when system factors such as robots and tasks multiply. As previously stated, this article solves the issue using a fuzzy‐based optimum path and reverse auction‐based methods. The detailed simulation results indicate that the suggested methods can solve task allocation with the lowest path cost. A comparative study is conducted between the suggested algorithm and two existing commonly used techniques, the auction‐based and the Hungarian algorithms. Finally, the suggested method was run in real‐time on a TurtleBot2 robot. The findings show the suggested algorithm's efficiency and simplicity of implementation.

On a dynamic and decentralized energy-aware technique for multi-robot task allocation

Temperature affects not only the reliability but also the performance, power, and cost of the embedded system. This paper proposes a thermal-aware task allocation and scheduling algorithm for embedded systems. The algorithm is used as a sub-routine for hardware/software co-synthesis to reduce the peak temperature and achieve a thermally even distribution while meeting real time constraints. The paper investigates both power-aware and thermal-aware approaches to task allocation and scheduling. The experimental results show that the thermal-aware approach outperforms the power-aware schemes in terms of maximal and average temperature reductions. To the best of our knowledge, this is the first task allocation and scheduling algorithm that takes temperature into consideration.

SUMMARYThis paper investigates task allocation for multiple robots by applying the game theory-based negotiation approach. Based on the initial task allocation using a contract net-based approach, a new method to select the negotiation robots and construct the negotiation set is proposed by employing the utility functions. A negotiation mechanism suitable for the decentralized task allocation is also presented. Then, a game theory-based negotiation strategy is proposed to achieve the Pareto-optimal solution for the task reallocation. Extensive simulation results are provided to show that the task allocation solutions after the negotiation are better than the initial contract net-based allocation. In addition, experimental results are further presented to show the effectiveness of the approach presented.

A multirobot system has cooperative team of robots designed to enhance efficiency of its operations. One of the critically investigated problems of multirobot system is the multirobot task allocation (MRTA) issue. The main objective of MRTA is to assign tasks to the most suitable robot based on its functions and capability as well as availability. In this paper, a task-oriented, auction-based task allocation framework is presented and tested through simulations and real-world experiments. The developed framework consists of a novel heuristic-based task allocation algorithm and communication module. It is implemented in a multirobot system, allowing tasks to be dynamically assigned to the robots as they achieve given tasks. The implemented framework shows robustness in its flexibility to the task and environment requirements such as resource and energy requirements and size of the environment. The framework involved a task allocation algorithm, which consists of bid generation and bid selection process, and a TCP/IP-based client-server communication module. The results from both simulations and real-world experiments matched, producing optimum results in task allocation.

In the era of digital intelligence, this paper studies the task allocation algorithm of distributed large data stream group computing, and reasonably allocates the task of group computing to meet the needs of massive computing and analysis of distributed large data stream. According to the idea of swarm intelligence perception and crowdsourcing platform, the task allocation model of distributed large data stream group computing is constructed to realize the task allocation of group computing. A distributed large data stream group computing task model and a user model are constructed, user attributes are initialized by using the accuracy of the answers submitted by users, the possibility that users can participate in the group computing task is predicted by a logistic regression algorithm, so that user candidate sequences participating in the computing task can be obtained, and the accuracy of the user’s real topics and corresponding topics can be grasped by capturing the candidate users’ real topics and evaluating the accuracy algorithm. Select the users who meet the subject area, update the candidate user sequence, and filter the users again on the basis of fully considering the factors such as information gain, user integrity and cost, so as to get the final user sequence and complete the task allocation of group computing. Experiments show that this method can solve the problem of distributed large data flow group computing task allocation, achieve high accuracy, reduce the cost, and effectively improve the information gain.

Task allocation is one of the cor e steps to effectively exploit the capabilities of cooperative control of multiple Uninhabited Aerospace Vehicle (UAV) teams. Task allocation is an NP -complete problem. In this paper, we present a new task allocation algorithm that is based on the principl es of genetic algorithm (GA). GA is a class of adaptive search algorithms derived from biological population genetics. We discuss the adaptation and implementation of the GA search strategy to the task allocation problem in the cooperative control of multi ple UAVs. Simulation results indicate that the GA strategy is a feasible approach for the task allocation problem .

Optimising stochastic task allocation and scheduling plans for mission workers subject to learning-forgetting, fatigue-recovery, and stress-recovery effects

The recent trend in the Internet of Things (IoT) is bringing innovations in almost every field of science. IoT is mainly focused on the connectivity of things via the Internet. IoT’s integration tools are developed based on the Do It Yourself (DIY) approach, as the general public lacks technical skills. This paper presents a thermal comfort system based on tasks allocation mechanism in smart homes. This paper designs and implements the tasks allocation mechanism based on virtual objects composition for IoT applications. We provide user-friendly drag and drops panels for the new IoT users to visualize both task composition and device virtualization. This paper also designs tasks generation from microservices, tasks mapping, task scheduling, and tasks allocation for thermal comfort applications in smart home. Microservices are functional units of services in an IoT environment. Physical devices are registered, and their corresponding virtual objects are initialized. Tasks are generated from the microservices and connected with the relevant virtual objects. Afterward, they are scheduled and finally allocated on the physical IoT device. The task composition toolbox is deployed on the cloud for users to access the application remotely. The performance of the proposed architecture is evaluated using both real-time and simulated scenarios. Round trip time (RTT), response time, task dropping and latency are used as the performance metrics. Results indicate that even for worst-case scenarios, values of these metrics are negligible, which makes our architecture significant, better and ideal for task allocation in IoT network.

Based on the task allocation problem in customer collaborative design ,which is a new product innovation mode, the task allocation was realized by using a task allocation mechanism based on the negotiation and a protocol was proposed for task allocation. Considering the effecting factors of the collaborative design, a decision-making algorithm based on the comprehensive evaluation was proposed in order to realize the optimal allocation of the task.

Hybrid ant genetic algorithm for efficient task scheduling in cloud data centers

In this paper, we address the task allocation problem in a network of computational nodes, where each node is connected to a limited set of neighboring nodes. This issue is common in a variety of real-world distributed computing systems, such as edge, cloud, and grid computing. We have developed and compared five distinct local distributed task allocation (DTA) algorithms. These algorithms are termed “local” because they are designed to function in a distributed environment, where each node independently makes task allocation decisions. The decision-making process is based on simple rules that depend solely on locally available information from neighboring nodes. The goal of these algorithms is to achieve efficient task allocation without the need for a central controller, which is a key requirement in large-scale distributed systems today. Simulation results show that two algorithms, “local diffusion” (LD) and “local probabilistic” (LP), outperform the others in terms of performance metrics, with nearly identical results. However, in certain scenarios with a high task volume, LD slightly outperforms LP. When considering the algorithmic overhead, the LP algorithm is ultimately found to be the most efficient among all the tested algorithms.