In this paper, we are trying to find a algorithm for scheduling DAG (Directed Acyclic Graph) tasks in heterogeneous embedded systems to minimize energy consumption while meeting the reliability requirement. Like many ...
详细信息
ISBN:
(纸本)9781665435741
In this paper, we are trying to find a algorithm for scheduling DAG (Directed Acyclic Graph) tasks in heterogeneous embedded systems to minimize energy consumption while meeting the reliability requirement. Like many traditional algorithms, we divide the task scheduling algorithm into two phases, the task priority calculation phase and the task allocation phase. In the task priority calculation phase, we proposes a priority calculation algorithm IOD based on the difference in task's input and output data. In the task allocation stage, we proposes a task allocation algorithm based on fault-tolerant technology of task replication and DVFS technology. Combining the two phase, we get three scheduling algorithms, IODS, IODQ and IODR. In the experimental part, we compare the performance of the algorithm proposed in this paper with existing research algorithms (EFSRG algorithm and HRRM algorithm). The analysis of experimental results shows that the IODS algorithm is a better choice.
High-Level Synthesis (HLS) is a process of designing digital circuit from high-level language descriptions and thus is applied for shorten time to market. Operation scheduling is one of the critical step in HLS. It de...
详细信息
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are som...
详细信息
ISBN:
(纸本)9781728175652
Time-critical requirements of real time systems are provided by software applications running on real time operating systems. These software tasks must be scheduled based on software and hardware events. There are some services (priority based preemption etc.) in real time operating systems to control software tasks. But in some situations there is a need for scheduling algorithms in real time systems. This need arises especially when time-critical software tasks need to run at different working periods and on a specific timeline. Different scheduling algorithms can be selected to meet the requirements of the system. The flight software that runs on the real-time operating system, especially on satellite platforms, is responsible for time-critical tasks. Main goals of this paper are providing analyze of scheduling algorithms using in real time operating systems, giving the method which is used to apply scheduling algorithms in a real time operating system and providing performance results of these scheduling algorithms obtained as a result of this application. In addition, it is mentioned that which of these algorithms are preferred in space domain.
Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein...
详细信息
ISBN:
(纸本)9781728191270
Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein all nodes in the network transmit data to a common base station is a common paradigm for such applications. Time slotted networks which support deterministic scheduling, such as 802.15.4e Time Slotted Channel Hopping (TSCH) multiple access (MAC) protocol, are well suited for such applications. In this paper, we consider a joint relay selection and scheduling problem for convergecast on a multihop wireless network using single channel TSCH MAC protocol. The objective of the problem is to reduce both the number of relay nodes required for network connectivity as well as the slot-frame duration for a periodic deterministic convergecast schedule. For tree networks with half-duplex constraints we obtain a lower bound on the minimum slot-frame duration and show that the relay selection and scheduling problem can be decoupled. We propose a heuristic scheduling algorithm which is shown to achieve the above lower bound using simulations. For the NP-hard relay selection problem, we propose a polynomial time relay selection algorithm with an improved approximation ratio. The performance of our relay selection and scheduling algorithms are studied via simulations on randomly generated graphs.
Starlink constellations are currently the largest LEO WAN and have seen considerable interest from the research community. In this paper, we use high-frequency and high-fidelity measurements to uncover evidence of hie...
详细信息
Coflow is a network abstraction used to represent communication patterns in data centers. The coflow scheduling problem encountered in large data centers is a challenging NP-hard problem. This paper tackles the schedu...
详细信息
In the context of heterogeneous distributed systems like modern High-Performnace Computing (HPC) that must respond to unpredictable requests of variable complexity with variable resource requirements (processing power...
详细信息
In the context of heterogeneous distributed systems like modern High-Performnace Computing (HPC) that must respond to unpredictable requests of variable complexity with variable resource requirements (processing power as well as storage capacity), a classical scheduling algorithm would not be suitable. Therefore, hybrid dynamic scheduling approaches have been adopted. These later have the ability to adapt over time based on the knowledge gained from the results of previous work. Several techniques are thus used to optimize these algorithms such as resources clustering. In this paper, we propose a comparative study of some of most popular algorithms in order to highlight the situations in which each algorithm is more suitable. We evaluate their performance and evolution in a realistic setting of CloudSim tool without neglecting load-balancing, and measure these performance metrics at runtime.
The exponential rise in the use of IoT devices has produced a growing risk of Denial of Service (DoS) attacks on IoT infrastructure. DoS attacks can prevent critical services from reaching legitimate users by targetin...
详细信息
ISBN:
(数字)9798350309652
ISBN:
(纸本)9798350309669
The exponential rise in the use of IoT devices has produced a growing risk of Denial of Service (DoS) attacks on IoT infrastructure. DoS attacks can prevent critical services from reaching legitimate users by targeting communication protocols such as Message Queuing Telemetry Transport (MQTT). Prior research has touched on algorithms to detect DoS attacks on the MQTT protocol, but the discussion of broker recovery from DoS attacks is not prevalent in the literature. This paper proposes the use and adaptation of efficient scheduling algorithms for minimizing tardy processing time to enhance the on-time delivery of backed-up queries to MQTT brokers following DoS attacks.
Traditional real-time scheduling algorithms are developed employing a standard framework to satisfy the requirements for a rapid execution time, high performance, and low power consumption. However, real-time control ...
详细信息
Traditional real-time scheduling algorithms are developed employing a standard framework to satisfy the requirements for a rapid execution time, high performance, and low power consumption. However, real-time control is gaining significance for a variety of applications, including manufacturing, data processing systems, aviation, and others. The goal of the current effort is to find the optimal functional analysis of the system while considering performance efficiency and processor use into account as critical components for tasks to be successfully executed within the allocated time. In this study, real-time scheduling methodologies and multiprocessor system scheduling algorithms are compared in order to determine the characteristics that are most useful for classification. The work load should be distributed equitably among the system's various processors in order to prevent faulty operations in an embedded system. Real-time scheduling algorithms are often built utilizing a standard framework in order to meet the demands for lowest execution time, minimal power consumption, and maximum performance. Users can implement new algorithms on various simulation tools.
scheduling system for an expatriate assignment needs an effective and efficient way to be designed since the expatriates reside outside their countries to do their assignments in very limited time. The problem of this...
详细信息
暂无评论