Overload problem research on aperiodic real-time tasks

In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.

Adaptive Resource Planning for AI Workloads with Variable Real-Time Tasks

AI(Artificial Intelligence)workloads are proliferating in modernreal-time systems.As the tasks of AI workloads fluctuate over time,resourceplanning policies used for traditional fixed real-time tasks should be reexamined.In particular,it is difficult to immediately handle changes inreal-time tasks without violating the deadline constraints.To cope with thissituation,this paper analyzes the task situations of AI workloads and findsthe following two observations.First,resource planning for AI workloadsis a complicated search problem that requires much time for optimization.Second,although the task set of an AI workload may change over time,thepossible combinations of the task sets are known in advance.Based on theseobservations,this paper proposes a new resource planning scheme for AIworkloads that supports the re-planning of resources.Instead of generatingresource plans on the fly,the proposed scheme pre-determines resourceplans for various combinations of tasks.Thus,in any case,the workload isimmediately executed according to the resource plan maintained.Specifically,the proposed scheme maintains an optimized CPU(Central Processing Unit)and memory resource plan using genetic algorithms and applies it as soonas the workload changes.The proposed scheme is implemented in the opensourcesimulator SimRTS for the validation of its effectiveness.Simulationexperiments show that the proposed scheme reduces the energy consumptionof CPU and memory by 45.5%on average without deadline misses.

Assigning Real-Time Tasks in Environmentally Powered Distributed Systems

Harvesting energy for execution from the environment (e.g., solar, wind energy) has recently emerged as a feasible solution for low-cost and low-power distributed systems. When real-time responsiveness of a given application has to be guaranteed, the recharge rate of obtaining energy inevitably affects the task scheduling. This paper extends our previous works in?[1] [2] to explore the real-time task assignment problem on an energy-harvesting distributed system. The solution using Ant Colony Optimization (ACO) and several significant improvements are presented. Simulations compare the performance of the approaches, which demonstrate the solutions effectiveness and efficiency.

An Efficient Real-Time Fault-Tolerant Scheduling Algorithm Based on Multiprocessor Systems

In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit （ERMBF） based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.

Algorithm Design of CPCI Backboard's Interrupts Management Based on VxWorks'Multi-Tasks

This paper begins with a brief introduction of the embedded real-time operating system VxWorks and CompactPCI standard, then gives the programming interfaces of Peripheral Controller Interface （PCI） configuring, interrupts handling and multi-tasks programming interface under VxWorks, and then emphasis is placed on the software frameworks of CPCI interrupt management based on multi-tasks. This method is sound in design and easy to adapt, ensures that all possible interrupts are handled in time, which makes it suitable for data acquisition systems with multi-channels, a high data rate, and hard real-time high energy physics.

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.

A Multi-Task Deep Learning Framework for Simultaneous Detection of Thoracic Pathology through Image Classification

Thoracic diseases pose significant risks to an individual's chest health and are among the most perilous medical diseases. They can impact either one or both lungs, which leads to a severe impairment of a person’s ability to breathe normally. Some notable examples of such diseases encompass pneumonia, lung cancer, coronavirus disease 2019 (COVID-19), tuberculosis, and chronic obstructive pulmonary disease (COPD). Consequently, early and precise detection of these diseases is paramount during the diagnostic process. Traditionally, the primary methods employed for the detection involve the use of X-ray imaging or computed tomography (CT) scans. Nevertheless, due to the scarcity of proficient radiologists and the inherent similarities between these diseases, the accuracy of detection can be compromised, leading to imprecise or erroneous results. To address this challenge, scientists have turned to computer-based solutions, aiming for swift and accurate diagnoses. The primary objective of this study is to develop two machine learning models, utilizing single-task and multi-task learning frameworks, to enhance classification accuracy. Within the multi-task learning architecture, two principal approaches exist soft parameter sharing and hard parameter sharing. Consequently, this research adopts a multi-task deep learning approach that leverages CNNs to achieve improved classification performance for the specified tasks. These tasks, focusing on pneumonia and COVID-19, are processed and learned simultaneously within a multi-task model. To assess the effectiveness of the trained model, it is rigorously validated using three different real-world datasets for training and testing.

Multi-tasking to Address Diversity in Language Learning

With focus now placed on the learner, more attention is given to his learning style, multiple intelligence and developing learning strategies to enable him to make sense of and use of the target language appropriately in varied contexts and with different uses of the language. To attain this, the teacher is tasked with designing, monitoring and processing language learning activities for students to carry out and in the process learn by doing and reflecting on the learning process they went through as they interacted socially with each other. This paper describes a task named"The Fishbowl Technique"and found to be effective in large ESL classes in the secondary level in the Philippines.

Gini Coefficient-based Task Allocation for Multi-robot Systems With Limited Energy Resources

Nowadays, robots generally have a variety of capabilities, which often form a coalition replacing human to work in dangerous environment, such as rescue, exploration, etc. In these operating conditions, the energy supply of robots usually cannot be guaranteed. If the energy resources of some robots are consumed too fast, the number of the future tasks of the coalition will be affected. This paper will develop a novel task allocation method based on Gini coefficient to make full use of limited energy resources of multi-robot system to maximize the number of tasks. At the same time, considering resources consumption,we incorporate the market-based allocation mechanism into our Gini coefficient-based method and propose a hybrid method,which can flexibly optimize the task completion number and the resource consumption according to the application contexts.Experiments show that the multi-robot system with limited energy resources can accomplish more tasks by the proposed Gini coefficient-based method, and the hybrid method can be dynamically adaptive to changes of the work environment and realize the dual optimization goals.

Multi-task Coalition Parallel Formation Strategy Based on Reinforcement Learning

代理人联盟是代理人协作和合作的一种重要方式。形成一个联盟，代理人能提高他们的能力解决问题并且获得更多的实用程序。在这份报纸，新奇多工联盟平行形成策略被介绍，并且多工联盟形成的过程是一个 Markov 决定过程的结论理论上被证明。而且，学习的加强被用来解决多工联盟平行的代理人行为策略，和这个过程形成被描述。在多工面向的领域，策略罐头有效地并且平行形式多工联盟。

A Distributed Algorithm for Parallel Multi-task Allocation Based on Profit Sharing Learning

经由联盟形成的任务分配是在多代理人系统(妈) 的几应用程序域的基本研究挑战，例如资源分配，灾难反应管理等等。怎么以一种分布式的方式分配许多未解决的任务到一些代理人，主要处理。在这篇论文，我们在自我组织、自我学习的代理人之中建议一个分布式的平行多工分配算法。处理状况，我们在二维的房间地理上驱散代理人和任务，然后介绍为寻找它的任务由的一个单个代理人的分享学习的利润(PSL ) 不断自我学习。我们也在代理人之中为通讯和协商介绍策略分配真实工作量到每个 tasked 代理人。最后，评估建议算法的有效性，我们把它与 Shehory 和 Krau 被许多研究人员在最近的年里讨论的分布式的任务分配算法作比较。试验性的结果证明建议算法罐头快速为每项任务形成一个解决的联盟。而且，建议算法罐头明确地告诉我们每个 tasked 代理人的真实工作量，并且能因此为实际控制任务提供一本特定、重要的参考书。

Pedestrian Attributes Recognition in Surveillance Scenarios with Hierarchical Multi-Task CNN Models

Pedestrian attributes recognition is a very important problem in video surveillance and video forensics. Traditional methods assume the pedestrian attributes are independent and design handcraft features for each one. In this paper, we propose a joint hierarchical multi-task learning algorithm to learn the relationships among attributes for better recognizing the pedestrian attributes in still images using convolutional neural networks(CNN). We divide the attributes into local and global ones according to spatial and semantic relations, and then consider learning semantic attributes through a hierarchical multi-task CNN model where each CNN in the first layer will predict each group of such local attributes and CNN in the second layer will predict the global attributes. Our multi-task learning framework allows each CNN model to simultaneously share visual knowledge among different groups of attribute categories. Extensive experiments are conducted on two popular and challenging benchmarks in surveillance scenarios, namely, the PETA and RAP pedestrian attributes datasets. On both benchmarks, our framework achieves superior results over the state-of-theart methods by 88.2% on PETA and 83.25% on RAP, respectively.

Face Detection Detection, Alignment Alignment, Quality Assessment and Attribute Analysis with Multi-Task Hybrid Convolutional Neural Networks

This paper proposes a universal framework,termed as Multi-Task Hybrid Convolutional Neural Network(MHCNN),for joint face detection,facial landmark detection,facial quality,and facial attribute analysis.MHCNN consists of a high-accuracy single stage detector(SSD)and an efficient tiny convolutional neural network(T-CNN)for joint face detection refinement,alignment and attribute analysis.Though the SSD face detectors achieve promising results,we find that applying a tiny CNN on detections further boosts the detected face scores and bounding boxes.By multi-task training,our T-CNN aims to provide five facial landmarks,facial quality scores,and facial attributes like wearing sunglasses and wearing masks.Since there is no public facial quality data and facial attribute data as we need,we contribute two datasets,namely FaceQ and FaceA,which are collected from the Internet.Experiments show that our MHCNN achieves face detection performance comparable to the state of the art in face detection data set and benchmark(FDDB),and gets reasonable results on AFLW,FaceQ and FaceA.

Task Assignment for Forest Fire Suppression by Multiple UAVs

This paper presents a scenario of forest fire suppression using UAVs （Unmanned Aerial Vehicles） and addresses task assignment algorithm to coordinate UAVs. Forest fires are a major problem in many nations and fast extinguishing forest fires brings a lot of ecological advantages so proper use of firefighting resources is very critical. In this sense, multi UAVs forest fire suppression system can be effective way to prevent fire outbreaks. In multi agent system, an appropriate task assignment according to the SA （Situational Awareness） is the most essential to conduct mission. We should consider real time re-planning or re-scheduling of multi UAVs team because environmental situations such as wind are changeable and that changes affect the forest fire spreading. Furthermore, we have to think about convergence to a consistent SA because it may take too much time. CBBA （Consensus-Based Bundle Algorithm） is robust decentralized task assignment tool so it can be implemented in real time re-planning application. A simulation model which is the main topic in this paper shows that multi UAVs can be properly operated to suppress forest fires even if there are unpredictable random factors and partial disconnection. The simulation model includes concrete operating scenarios and recursive task re-assign algorithm until fires in the whole area are suppressed.

Genetic Algorithm Based Combinatorial Auction Method for Multi-Robot Task Allocation

An improved genetic algorithm is proposed to solve the problem of bad real-time performance or inability to get a global optimal/better solution when applying single-item auction （SIA） method or combinatorial auction method to multi-robot task allocation. The genetic algorithm based combinatorial auction （GACA） method which combines the basic-genetic algorithm with a new concept of ringed chromosome is used to solve the winner determination problem （WDP） of combinatorial auction. The simulation experiments are conducted in OpenSim, a multi-robot simulator. The results show that GACA can get a satisfying solution in a reasonable shot time, and compared with SIA or parthenogenesis algorithm combinatorial auction （PGACA） method, it is the simplest and has higher search efficiency, also, GACA can get a global better/optimal solution and satisfy the high real-time requirement of multi-robot task allocation.

Energy-Efficient Deterministic Fault-Tolerant Scheduling for Embedded Real-Time Systems

By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The scbedulability of the system was analyzed through checkpointing and the energy saving was considered via dynamic voltage and frequency scaling. Simulation results showed that the proposed algorithm had better performance compared with the existing voltage allocation techniques. The proposed technique saves 51.5% energy over FT-Only and 19.9% over FT ＋ EC on average. Therefore, the proposed method was more appropriate for aperiodic tasks in embedded real-time systems.

Optimal Micro⁃Task Scheduling for Multi⁃Hop D2D⁃Enabled Mobile Edge Computing

Mobile Edge Computing(MEC)is a promising solution to tackle the upcoming computing tsunami in 5G/6G era by effectively utilizing the idle resource at the mobile edge.In this work,a multi⁃hop D2D⁃enabled MEC scenario was studied,where mobile devices at network edge connect and share resources with each other via multi⁃hop D2D.The research focus was on the micro⁃task scheduling problem in the multi⁃hop D2D⁃enabled MEC system,where each task was divided into multiple sequential micro⁃tasks,such as data downloading micro⁃task,data processing micro⁃task,and data uploading micro⁃task,according to their functionalities as well as resource requirements.A joint Task Failure Probability and Energy Consumption Minimization(TFP⁃ECM)problem was proposed,aiming at minimizing the task failure probability and the energy consumption jointly.To solve the problem,several linearization methods were proposed to relax the constraints and convert the original problem into an integer linear programming(ILP).Simulation results show that the proposed solution outperformed the existing solutions(with indivisible tasks or without resource sharing)in terms of both total cost and task failure probability.

Identification and Analysis of Multi-tasking Product Information Search Sessions with Query Logs

Purpose： This research aims to identify product search tasks in online shopplng ana analyze the characteristics of consumer multi-tasking search sessions. Design/methodology/approach： The experimental dataset contains 8,949 queries of 582 users from 3,483 search sessions. A sequential comparison of the Jaccard similarity coefficient between two adjacent search queries and hierarchical clustering of queries is used to identify search tasks. Findings： （1） Users issued a similar number of queries （1.43 to 1.47） with similar lengths （7.3-7.6 characters） per task in mono-tasking and multi-tasking sessions, and （2） Users spent more time on average in sessions with more tasks, but spent less time for each task when the number of tasks increased in a session. Research limitations： The task identification method that relies only on query terms does not completely reflect the complex nature of consumer shopping behavior.Practical implications： These results provide an exploratory understanding of the relationships among multiple shopping tasks, and can be useful for product recommendation and shopping task prediction. Originality/value： The originality of this research is its use of query clustering with online shopping task identification and analysis, and the analysis of product search session characteristics.

MODEL-BASED DEVELOPMENT OF REAL-TIME SOFTWARE SYSTEM FOR ELECTRONIC UNIT PUMP SYSTEM

A real-time operating system （RTOS）, also named OS, is designed based on the hardware platform of MC68376, and is implemented in the electronic control system for unit pump in diesel engine. A parallel and time-based task division method is introduced and the multi-task software architecture is built in the software system for electronic unit pump （EUP） system. The V-model software development process is used to control algorithm of each task. The simulation results of the hardware-in-the-loop simulation system （HILSS） and the engine experimental results show that the OS is an efficient real-time kernel, and can meet the real-time demands of EUP system; The built multi-task software system is real-time, determinate and reliable. V-model development is a good development process of control algorithms for EUP system, the control precision of control system can be ensured, and the development cycle and cost are also decreased.

Variation-Aware Task Mapping on Homogeneous Fault-Tolerant Multi-Core Network-on-Chips

A variation-aware task mapping approach is proposed for a multi-core network-on-chips with redundant cores, which includes both the design-time mapping and run-time scheduling algorithms. Firstly, a design-time genetic task mapping algorithm is proposed during the design stage to generate multiple task mapping solutions which cover a maximum range of chips. Then, during the run, one optimal task mapping solution is selected. Additionally, logical cores are mapped to physically available cores. Both core asymmetry and topological changes are considered in the proposed approach. Experimental results show that the performance yield of the proposed approach is 96% on average, and the communication cost, power consumption and peak temperature are all optimized without loss of performance yield.