Along with the growing diversity and complexity of real-time embedded systems, it is becoming common that different types of tasks, periodic tasks and aperiodic tasks, reside in a system. In such systems, it is import...
详细信息
A parallel optimisation technique for large join queries is presented. The technique processes the search space of query execution plans twice: the first scan is based on iterative improvement;the second scan uses the...
详细信息
From the perspective of the characteristics of the elevator group control system, this paper selects the shortest distance algorithm as a scheduling strategy, and constructs elevator running model. On this basis, this...
详细信息
In order to reduce the energy consumption of communications network and optimize the system control of necessary maintenance, the effective service strategy for optimal service-system performance are considered. A Geo...
详细信息
It is well-known that maximum weight scheduling, with link weights which are either functions of queue lengths or the ages of the Head-of-Line (HoL) packets in each queue, maximizes the throughput region of wireless n...
详细信息
It is well-known that maximum weight scheduling, with link weights which are either functions of queue lengths or the ages of the Head-of-Line (HoL) packets in each queue, maximizes the throughput region of wireless networks with persistent flows. In particular, with only persistent flows, it does not matter for throughput optimality whether one uses queue lengths or HoL ages as weights. In this paper, we show the following interesting result: when some flows in the network are dynamic (i.e., they arrive and depart from the network and are not persistent), then HoL-age-based scheduling algorithms are throughput-optimal while it has previously been shown that queue-length-based algorithms are not. This reveals that, age-based algorithms are universal in the sense that their throughput optimality does not depend on whether the arriving traffic is persistent or not. We also present a distributed implementation of the proposed age-based algorithm using CSMA techniques, where each flow only knows its own age and carrier sensing information. Finally, we support our analytical results through simulations. The proof of throughput optimality may be interesting in its own right: it uses a novel Lyapunov function which is the sum of the ages of all the packets in the network.
Cloud provides convenient and on demand network access for computing resources available over internet. Individuals and organizations can access the software and hardware such as network, storage, server and applicati...
详细信息
ISBN:
(纸本)9781467382878
Cloud provides convenient and on demand network access for computing resources available over internet. Individuals and organizations can access the software and hardware such as network, storage, server and applications which are located remotely easily with the help of Cloud Service. The tasks/jobs submitted to this cloud environment needs to be executed on time using the resources available so as to achieve proper resource utilization, efficiency and lesser makespan which in turn requires efficient task scheduling algorithm for proper task allocation. In this paper, we have introduced an Optimized Task scheduling Algorithm which adapts the advantages of various other existing algorithms according to the situation while considering the distribution and scalability characteristics of cloud resources.
Behavior Tree (BT) is a behavior modeling tool derived from computer game design. It has the advantages of modularity, hierarchy, reactivity, and readability, which can be used to model the behavior of agents and impl...
详细信息
ISBN:
(纸本)9781665481106
Behavior Tree (BT) is a behavior modeling tool derived from computer game design. It has the advantages of modularity, hierarchy, reactivity, and readability, which can be used to model the behavior of agents and implement task-switching functionalities. Parallel task execution in behavior trees may encounter resource conflicts similar to those in concurrent programming. To solve the problem of resource conflicts in parallel executions of BT, the actions are usually set execution priority in advance. However, this method is not optimal for scheduling parallel tasks in many BT applications. In this paper, we propose to integrate several classic resource scheduling algorithms into a popular BT framework and evaluate it by multiple experiments. The BT resource scheduling mechanism expands the architecture of the classic behavior tree.
We study the problem of efficiently scheduling a computational DAG on multiple processors. The majority of previous works have developed and compared algorithms for this problem in relatively simple models;in contrast...
详细信息
This paper proposes a dynamic network slicing and resource scheduling algorithm for 6G networks, combining Message Passing Neural Networks (MPNN) and Deep Q-Learning (DQN). The algorithm uses MPNN to extract features ...
详细信息
ISBN:
(数字)9798350363760
ISBN:
(纸本)9798350363777
This paper proposes a dynamic network slicing and resource scheduling algorithm for 6G networks, combining Message Passing Neural Networks (MPNN) and Deep Q-Learning (DQN). The algorithm uses MPNN to extract features from network nodes and links, updating their states through a message-passing mechanism. DQN then predicts the Q-value of each action based on these features, enabling fine-grained resource allocation. This approach dynamically adjusts both intra-slice and inter-slice resource allocations, significantly enhancing network resource utilization and service quality. Extensive simulations demonstrate the algorithm's ability to maintain stable resource allocation over longer time scales while improving real-time service performance on shorter time scales. Results indicate that the algorithm significantly outperforms existing methods in resource utilization, task completion rate, and service quality.
We study distributed link scheduling for throughput maximization in wireless networks. The majority of results on link scheduling assume binary interference models for simplicity. While the physical interference model...
详细信息
ISBN:
(纸本)9781467307734;9781467307758
We study distributed link scheduling for throughput maximization in wireless networks. The majority of results on link scheduling assume binary interference models for simplicity. While the physical interference model reflects the physical reality more precisely, the problem becomes notoriously harder under the physical interference model. There have been just a few existing results on centralized link scheduling under the physical interference model, though distributed schedulings are more practical. In this paper, by leveraging the partition and shifting strategies and the pick-and-compare scheme, we present the first distributed link scheduling algorithm that can achieve a constant fraction of the optimal capacity region subject to physical interference constraints in the linear power setting for multihop wireless networks.
暂无评论