检索结果-内蒙古大学图书馆

International Symposium on Advanced Computing and Communication (ISACC)

作者： Sk Md Abidar Rahaman Md Azharuddin Department of Computer Science and Engineering Aliah University Kolkata India

The wireless sensor networks' (WSNs') sensor nodes' (SNs') limited energy is a crucial factor to take into account since it can result in data loss or even the entire network failing. In order to address energy shortages or meet energy demands, wireless power transfer (WPT) was introduced as a means to overcome this problem. With WPT, SNs can have their battery power restored by recharging them through one or more chargers, thereby extending their lifespan. Planning a charging schedule for a mobile charger (MC) is an NP-hard issue. As part of our research, we present a priority-based charging scheduling algorithm that can be used on wireless rechargeable sensor networks (WRSNs). The suggested algorithm primarily considers the SNs' remaining energy and the timing of charging requests. To demonstrate the suggested algorithm's higher performance, we simulate it and compare the results with those of other commonly used approaches.

关键词： Wireless communication Wireless sensor networks Schedules scheduling algorithms Simulation Wireless power transfer Timing

来源：评论

学校读者我要写书评

暂无评论

Node Resource Balance scheduling Algorithm of Power Internet of Things Based on Big Data 21

Node Resource Balance Scheduling Algorithm of Power Internet...

引用

21st IEEE International Conference on Communication Technology, ICCT 2021

作者： Li, Wei Meng, Lingli Zhang, Xin Wang, Dawei Wang, Lixia Science and Technology Internet Department State Grid Liaoning Electric Power Co. LTD. Shenyang China Audit Center State Grid Liaoning Electric Power Co. LTD. Shenyang China Marketing Service Center State Grid Liaoning Electric Power Co. LTD. Shenyang China

ISBN: (纸本)9781665432061

Power Internet of things is the application of Internet of things in smart grid, which will effectively integrate communication infrastructure resources and power system infrastructure resources, and provide important technical support for power grid generation, transmission, transformation, distribution, power consumption and other links. However, the existing scheduling algorithm has the problem that the node information level is not clear, which leads to the task span is too long. Therefore, a resource balancing scheduling algorithm of power Internet of things node based on big data is designed. Get the edge coefficient of power Internet of things node, release different degrees of pheromone according to the size of fitness function, extract resource scheduling characteristics, clarify the constraints between resources, sort the node information priority by big data, improve the task grouping scheduling strategy, set resource balanced scheduling module management function, and realize the algorithm design. Experimental results: compared with the other two existing scheduling algorithms, the average task span time-consuming of the designed scheduling algorithm is 83.390s, 123.300s and 124.952s respectively, which proves that the scheduling algorithm integrated with big data technology has more perfect performance. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Combining Lagrangian Relaxation and Neural Network to Solve Single-machine scheduling Problem

Combining Lagrangian Relaxation and Neural Network to Solve ...

引用

IEEE International Conference on Mechatronics, Robotics and Automation (ICMRA)

作者： Hao Huang Jiping Tao Department of Automation Xiamen University Xiamen China

ISBN: (数字)9798350307535

ISBN: (纸本)9798350307542

The single-machine scheduling problem involves arranging a set of jobs on a single machine, where jobs have different weights, arrival times, and processing times. This paper presents an integer programming model aimed at minimizing the total weighted tardiness. It uses a Lagrangian relaxation-based scheduling algorithm and proposes an algorithm that leverages a neural network to approximate Lagrangian multipliers for obtaining an approximate solution. This algorithm represents job information with a discrete time series vector, uses multi-head attention mechanism for encoding and decoding, and derives a Lagrangian multiplier sequence to determine job processing sequences after feasible operations. Experimental results show that this algorithm is faster and achieves better results compared to using the subgradient method with Lagrangian relaxation for solving scheduling problems. Moreover, the model exhibits strong generalization performance within a certain scale, effectively reducing training costs.

关键词： Training Attention mechanisms scheduling algorithms Neural networks Time series analysis Supervised learning Approximation algorithms Vectors Single machine scheduling Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity precoding and scheduling algorithms for full-dimension MIMO systems

Reduced complexity precoding and scheduling algorithms for f...

引用

2014 IEEE Global Communications Conference

作者： Yan Xin Young-Han Nam Yang Li Jianzhong Charlie Zhang Samsung Research America Dallas (SRA-D) Richardson TX USA

Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia researchers and industry practitioners. Compared with legacy cellular communication systems, FD-MIMO systems can achieve significantly higher spectral efficiency with high order multi-user MIMO (MU-MIMO) transmissions. However, as high-order MU-MIMO also incurs high precoding and scheduling complexity, it is critical to reduce complexity of these operations in order to realize throughput potential of FD-MIMO systems in practice. In this paper, we propose a reduced complexity algorithm to realize the high performance precoding technique, signal-to-leakage plus noise ratio (SLNR) precoding, and propose an efficient scheduling algorithm to enable high-order MU-MIMO transmissions in FD-MIMO systems. We further demonstrate the effectiveness of the proposed algorithms by using system level simulations.

关键词： Measurement Complexity theory Throughput scheduling algorithms Vectors MIMO Matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Cubesat Task scheduling Method Considering Operational Reliability

SSRN

引用

SSRN 2023年

作者： Zhang, Jingjing He, Chenyang Zhang, Yan Qi, Xianjun Yang, Xi School of Electrical Engineering and automation Hefei University of Technology Hefei China Anhui Province Key Laboratory of Renewable Energy Utilization and Energy Saving Hefei University of Technology Hefei China Key Lab. of Aperture Array and Space Application Hefei China

Task scheduling is an effective method to increase the value of satellite missions, which can greatly improve satellite resource management and quality of service. Based on the priority-based task scheduling model, this paper proposes a CubeSat scheduling method that takes operational reliability into account, considering the impact of scheduling results on its reliable operation. In this method, the available energy and the time window are used as scheduling resources, and the average charge state of the lithium battery and the number of task start-ups are defined as two index to measure its reliability. To meet the mission requirements and energy availability of PV and battery constraints, the scheduling model is constructed whose objective function includes mission priority and reliability index. Branch and bound (BB) method and Analytical hierarchy process (AHP) method are used to solve the scheduling problem. The example analysis compares different scheduling results and verifies the effectiveness of the proposed scheduling method. Compared with the existing methods, it comprehensively considers the mission value and operational reliability of the CubeSat, improves the energy reserve level of the CubeSat, reduces the surge current caused by the start-up of the task, and can provide guidance for its task scheduling. © 2023, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Age of Information Based scheduling Algorithm in a Shared Channel with Energy and Link Capacity Constraints

SSRN

引用

SSRN 2023年

作者： Hao, Wei Hou, Chen The College of Information and Electrical Engineering China Agricultural University Beijing100083 China

For data collection systems, it is important to rationally allocate link capacity to each source node so that the base station can receive fresh data. In recent years, a metric called age of information (AoI) has appeared to measure the freshness of the received information. In this paper, we build a model in which multiple source nodes with energy constraints transmit samples to a base station via a shared capacity-constrained channel. Then, with the objective of minimizing average weighted AoI in data collection systems, we propose a strategy where each source node has two buffers to store its latest partially transmitted sample and its complete latest collected sample, respectively. We establish the AoI model, sample transmission model and energy consumption model for the two buffers, and design a scheduling algorithm TBSA (Two-buffers strategy algorithm) in this strategy. Finally, the proposed algorithm has been compared with the other four scheduling algorithms by simulation. The results show that the proposed algorithm achieves better comprehensive performance. © 2023, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluation and comparaison of scheduling algorithms in Wimax networks

Evaluation and comparaison of scheduling algorithms in Wimax...

引用

IEEE International Conference on Multimedia Computing and Systems (ICMCS)

作者： Kais Mnif Radia Khdhir Lotfi Kamoun Tunisia Ecole Nationale d'Electronique et de Telecommunications (ENET' COM) University of Sfax Ecole Nationale d'Ingénieurs de Sfax (ENIS) University of Sfax Tunisia

In this paper, we propose a new scheduling algorithm for IEEE802.16 Broadband wireless Metropolitan Area Networks in TDD mode. Based on some known algorithms such as Modified Deficit Round Robin (MDRR), Proportional Fairness (PF) and Adaptive Proportional Fairness (APF), we have studied the scheduling problem and proposed scheduling algorithm, called (Enhanced-APF) for focuses on an efficient mechanism to serve high priority traffic in order to perform and achieve high resource utilization in the Wimax Base Station. We give a detailed simulation study for the proposed scheduling algorithm and its performance has been compared. Based on OPNET modeler Simulation, results show that the proposed algorithm can increase the network throughput, maintain relative fairness, and lower delay of dealing with different requirements from users under congestion conditions.

关键词： Quality of service Delays scheduling algorithms Throughput WiMAX Real-time systems Streaming media

来源：评论

学校读者我要写书评

暂无评论

Probability-Based Crossover Genetic Algorithm for Task scheduling in Cloud Computing

Probability-Based Crossover Genetic Algorithm for Task Sched...

引用

Cloudification of the Internet of Things (CIoT)

作者： Saleh Al Shamaa Wei Shi Georges Ankenmann School of Information Technology Carleton University Ottawa Ontario Canada

In order to meet the rising demand for cloud services and remain in compliance with Service Level Agreements (SLA), service providers require effective task scheduling solutions capable of adapting to cloud computing’s elastic and dynamic *** this paper, we propose a novel approach to optimize task scheduling in cloud computing called a ProbabilityBased Crossover Genetic Algorithm (PxGA) with a primary objective of minimizing the tasks execution makespan. PxGA is an improvement on the Genetic Algorithm (GA) achieved by introducing the concept of Virtual Machine (VM) fitness and applying it to implement an effective weighted probabilistic crossover technique. Using the CloudSim simulation toolkit, we conduct our analysis of PxGA and evaluate it against standard and more recent task scheduling algorithms. The results of the simulations show that our proposed task scheduling algorithm is superior to other task scheduling algorithms in terms of the makespan, the VMs energy consumption, and the degree of imbalance (DoI). Moreover, the computational time (CT) for the PxGA decreases when compared against the other evaluated algorithms, except for its base GA.

关键词： Cloud computing Energy consumption scheduling algorithms Computational modeling Dynamic scheduling Probabilistic logic Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Research on Task scheduling Algorithm of Administrative System Based on Decision Tree Algorithm

Research on Task Scheduling Algorithm of Administrative Syst...

引用

Telecommunications, Electronics and Informatics (ICTEI), International Conference on

作者： Shuguang Wang Jikai Cui Harbin University of Commerce Harbin Heilongjiang China

ISBN: (数字)9798350342963

ISBN: (纸本)9798350342970

The task scheduling of administrative system makes use of the business transmission of data in the system, which brings an opportunity for the development of electronic administration. The task scheduling technology of administrative system refers to an optimization technology driven by administrative tasks and control requirements, which can eliminate constraint conflicts in the process of administrative system tasks execution and maximize the benefits of administrative system tasks and control by modeling tasks and resources. The decision tree (DT) algorithm is applied to it. The advantages of DT method are high computational efficiency, easy to understand, low computational complexity, and strong advantages for discrete data processing. The advantages and disadvantages of DT can be evaluated from two aspects: the correctness of DT and the testing of the sample library. This article uses the DT algorithm to analyze the task scheduling algorithm of administrative management systems and generate relevant DT. Afterwards, through the analysis of DT, it can help us better understand the key points of evaluation, so as to make more plans for our work and improve work efficiency.

关键词： scheduling algorithms Simulation Process control Data processing scheduling Telecommunications Decision trees

来源：评论

学校读者我要写书评

暂无评论

Everything Matters in Programmable Packet scheduling

arXiv

引用

arXiv 2023年

作者： Alcoz, Albert Gran Vass, Balázs Rétvári, Gábor Vanbever, Laurent ETH Zürich Switzerland BME VIK TMIT Hungary

Programmable packet scheduling allows the deployment of scheduling algorithms into existing switches without need for hardware redesign. scheduling algorithms are programmed by tagging packets with ranks, indicating their desired priority. Programmable schedulers then execute these algorithms by serving packets in the order described in their ranks. The ideal programmable scheduler is a Push-In First-Out (PIFO) queue, which achieves perfect packet sorting by pushing packets into arbitrary positions in the queue, while only draining packets from the head. Unfortunately, implementing PIFO queues in hardware is challenging due to the need to arbitrarily sort packets at line rate based on their ranks. In the last years, various techniques have been proposed, approximating PIFO behaviors using the resources of existing data planes. While promising, approaches to date only approximate one of the two characteristic behaviors of a PIFO queue: either its scheduling behavior, or its admission control. We introduce PACKS, the first programmable scheduler that fully approximates PIFO queues on all their behaviors. PACKS does so by smartly using a set of strict-priority queues. It uses packet-rank information and queue-occupancy levels at enqueue to decide whether to admit packets to the scheduler, and how to map admitted packets to the different queues. We fully implement PACKS in P4 and evaluate it on real workloads. We show that PACKS better-approximates PIFO than state-of-the-art approaches and scales. We also show that PACKS runs at line rate on existing hardware (Intel Tofino). Copyright © 2023, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：