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

QUIC-EST: A QUIC-Enabled scheduling and Transmission Scheme to Maximize VoI with Correlated Data Flows

IEEE COMMUNICATIONS MAGAZINE 2021年第4期59卷 30-36页

作者： Chiariotti, Federico Deshpande, Anay Ajit Giordani, Marco Antonakoglou, Konstantinos Mahmoodi, Toktam Zanella, Andrea Aalborg Univ Aalborg Denmark Univ Padua Padua Italy Univ Padua Dept Informat Engn Padua Italy Kings Coll London London England Kings Coll London Dept Engn Ctr Telecommun Res London England

Progress in communication technologies has fostered the development of advanced interactive applications that require multi-sensor data transmission with low latency and high reliability. Since these requirements are not guaranteed by current application-agnostic transport protocols, these applications mostly have to rely on customized, application-level scheduling and flow control mechanisms, which lack generality and transparency, making it difficult to jointly control the information flows of different applications. In this work, we propose a unified framework to support the transmission of correlated data flows. We assume that the applications are able to describe the correlation among their data streams and the related service requirements in terms of a value of information (VoI) matrix. Hence, we propose QUIC-EST, a transmission scheme that combines the congestion control and multi-stream features of the recently proposed QUIC transport protocol with a proper scheduling algorithm to maximize the VoI at the receiver. To illustrate the idea, we propose the analysis of two relevant use cases, namely inter-vehicular and haptic communications, and demonstrate through simulations how the proposed approach can significantly outperform current transport schemes.

关键词： Transport protocols TCPIP scheduling algorithms Network slicing Receivers Communications technology Haptic interfaces

来源：评论

学校读者我要写书评

暂无评论

A dynamic programming-based heuristic algorithm for a flexible job shop scheduling problem of a matrix system in automotive industry 18

A dynamic programming-based heuristic algorithm for a flexib...

引用

IEEE 18th International Conference on Automation Science and Engineering (IEEE CASE)

作者： Kim, Min-Soo Oh, Seog-Chan Chang, Eun Hyo Lee, Sangheon Wells, James W. Arinez, Jorge Jang, Young Jae Korea Adv Inst Sci & Technol KAIST Dept Ind & Syst Engn Daejeon South Korea GM R&D Mfg Syst Res Lab Warren MI USA

ISBN: (数字)9781665490429

ISBN: (纸本)9781665490429

We present a dynamic programming-based heuristic algorithm for selecting the next task of in-process cars in automotive assembly plants. As car production demand diversifies, manufacturing processes require high flexibility. An alternative to a conventional production line, matrix-structured production system provides a flexible manufacturing environment. In this system, until the final assembly operation is completed, each autonomous mobile robot (AMR) is assigned to a single car body and transports among various workstations to accomplish its given operations. These operations require sequential procedure and can be performed at multiple workstations. Therefore, assigning AMRs to appropriate workstations and operations is the key decision making that determines the capacity of the plants. In this paper, we formulate the Markov decision process (MDP) model for the flexible job shop scheduling problem with a single AMR and get the optimal policy by applying dynamic programming. Moreover, we suggest a heuristic algorithm to deal with multiple AMRs. We, then, validate the proposed algorithm by comparing various algorithms using simulation. Finally, we analyze the effect of the scheduling algorithm on production capacity.

关键词： Industries Job shop scheduling scheduling algorithms Heuristic algorithms Dynamic scheduling Workstations Batteries

来源：评论

学校读者我要写书评

暂无评论

Radio-Aware Multi-Connectivity Solutions based on Layer-4 scheduling for Wi-Fi in IIoT Scenarios

Radio-Aware Multi-Connectivity Solutions based on Layer-4 Sc...

引用

IEEE Wireless Communications and Networking Conference (IEEE WCNC)

作者： Fink, Andreas Mogensen, Rasmus Suhr Rodriguez, Ignacio Kolding, Troels Karstensen, Anders Pocovi, Guillermo Aalborg Univ Dept Elect Syst Wireless Commun Networks Sect Aalborg Denmark Nokia Bell Labs Aalborg Denmark

ISBN: (纸本)9781665442664

Due to mobility and interference, using enterprise Wi-Fi for communication in industrial networks can result in control loop latencies exceeding 100 ms for at least 0.1% of the time, even in those cases where Wi-Fi handover-specific parameters have been optimized, making the technology unfit for Industrial IoT (IIoT) with strict communication reliability requirements. To improve its performance, this paper presents a novel approach towards the design and implementation of a radio-aware multi-connectivity concept using a layer-4 scheduling mechanism. Two packet scheduling mechanisms are presented: packet duplication and best path scheduling. A mobility coordinator scheme is used to improve the performance of the packet schedulers by preventing simultaneous handovers and ensures the STAs connect to different APs. By using this multi-connectivity solution, a significant performance improvement was observed, cutting down the latencies of the system to 30-80 ms at the 99.9%-ile of reliability (depending on the operational conditions). Furthermore, by applying the proposed schemes, Wi-Fi handovers delays can be fully mitigated allowing for true seamless roaming in mobile conditions.

关键词： Performance evaluation Job shop scheduling scheduling algorithms Switches Interference Handover Roaming

来源：评论

学校读者我要写书评

暂无评论

A Fair Cooperation Strategy in the Edge-Edge Collaboration Scenario 20th

A Fair Cooperation Strategy in the Edge-Edge Collaboration...

引用

20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024

作者： Gou, Heping Peng, Bo Li, Qiang Zhang, Xinyu Chen, Xinxin School of Information Engineering Southwest University of Science and Technology Sichuan Mianyang621010 China

ISBN: (纸本)9789819628636

As intelligent terminal devices become more and more common in daily life, the amount of work involved in computer work is increasing. Excessive task migrations can create significant resource stress on edge servers and ultimately have a negative impact. In this paper, we introduce four parameters and weight ratio factors to address the issue of imbalanced distribution of computational resources among edge servers in the field of edge computing. Compared with the traditional serial task processing structure, the edge collaborative parallel task processing architecture proposed in this paper improves the resource utilization by 40% on average, and the task processing time is shortened by 8 times on average. In addition, compared with the existing task scheduling algorithms in the edge collaborative parallel task processing architecture, the proposed fair collaboration strategy can effectively reduce the average CPU utilization of edge servers by nearly 10%, providing more computing resources. The average task processing latency is reduced by 0.9 s compared to the greedy algorithm and 0.1 s compared to the genetic algorithm. © IFIP International Federation for Information Processing 2025.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Universal Policy Tracking: scheduling for Wireless Networks with Delayed State Observation 58

Universal Policy Tracking: Scheduling for Wireless Networks ...

引用

58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Liu, Bai Modiano, Eytan MIT Lab Informat & Decis Syst Cambridge MA 02138 USA

ISBN: (数字)9798350399981

ISBN: (纸本)9798350399981

Numerous scheduling algorithms have been proposed to optimize various performance metrics like throughput, delay and utility in wireless networks. However, these algorithms often require instantaneous access to network state information, which is not always available. While network stability can sometimes be achieved with delayed state information, other performance metrics such as latency may degrade. Thus, instead of simply stabilizing the system, our goal is to design a framework that can mimic arbitrary scheduling algorithms with performance guarantees. A naive approach is to make decisions directly with delayed information, but we show that such methods may lead to poor performance. Instead, we propose the Universal Tracking (UT) algorithm that can mimic the actions of arbitrary scheduling algorithms under observation delay. We rigorously show that the performance gap between UT and the scheduling algorithm being tracked is bounded by constants. Our numerical experiments show that UT significantly outperforms the naive approach in various applications.

关键词： Measurement scheduling algorithms Wireless networks Spread spectrum communication Throughput Stability analysis scheduling

来源：评论

学校读者我要写书评

暂无评论

Task Duplication-Based scheduling Algorithm for Budget-Constrained Workflows in Cloud Computing

引用

IEEE ACCESS 2021年 9卷 37262-37272页

作者： Yao, Fuguang Pu, Changjiu Zhang, Zongyin Chongqing Univ Educ Informat Ctr Chongqing 400065 Peoples R China

Workflow scheduling is crucial to the efficient operation of cloud platforms, and has attracted a lot of attention. Up to now, many algorithms have been reported to schedule workflows with budget constraints, so as to optimize workflows' makespan on cloud resources. Nevertheless, the hourly-based billing model in cloud computing is an ongoing challenge for workflow scheduling that easily results in higher makespan or even infeasible solutions. Besides, due to data constraints among workflow tasks, there must be a lot of idle slots in cloud resources. Few works adequately exploit these idle slots to duplicate tasks' predecessors to shorten their completion time, thereby minimizing workflow's makespan while ensuring its budget constraint. Motivated by these, we propose a task duplication based scheduling algorithm, namely TDSA, to optimize makespan for budget-constrained workflows in cloud platforms. In TDSA, two novel mechanisms are devised: 1) a dynamic sub-budget allocation mechanism, it is responsible for recovering unused budget of scheduled workflow tasks and redistributing remaining budget, which is conducive to using more expensive/powerful cloud resources to accelerate completion time of unscheduled tasks;and 2) a duplication-based task scheduling mechanism, which strives to exploit idle slots on resources to selectively duplicate tasks' predecessors, such advancing these tasks' completion time while trying to ensuring their sub-budget constraints. At last, we carry out four groups of experiments, three groups on randomly generated workflows and another one on actual workflows, to compare the proposed TDSA with four baseline algorithms. Experimental results confirm that the TDSA has an overwhelming superiority in advancing the workflows' makespan (up to 17.4%) and improving the utilization of cloud computing resources (up to 31.6%).

关键词： Task analysis Cloud computing Optimal scheduling scheduling algorithms Resource management Schedules Internet of Things Cloud computing task duplication workflow scheduling resource provision heuristic mechanism

来源：评论

学校读者我要写书评

暂无评论

Dynamic Targeting of Satellite Observations Incorporating Slewing Costs and Complex Observation Utility

Dynamic Targeting of Satellite Observations Incorporating Sl...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Kangaslahti, Akseli Candela, Alberto Swope, Jason Yue, Qing Chien, Steve Univ Michigan Ann Arbor MI 48109 USA CALTECH Jet Prop Lab Pasadena CA 91011 USA

ISBN: (纸本)9798350384581;9798350384574

Maximizing the utility of limited Earth observing satellite resources is a difficult ongoing problem. Dynamic Targeting is an approach to this challenge that intelligently plans and executes primary sensor observations based on information from a lookahead sensor. However, current implementations have failed to account for realistic satellite operational constraints and have used static utility for repeat observations of the same target. To address these limitations, we implement a more general Dynamic Targeting framework that comprises a physics-based slew model, a dynamic model of observation utility, and an algorithm for gathering high-utility observations. To demonstrate this framework, we also supply complex dynamic utility models that are applicable to many missions and new algorithms for intelligently scheduling observations with slewing restrictions and changing utility, including a greedy algorithm and a depth-first search algorithm. To evaluate these algorithms, we test their performance across simulated runs through two datasets and compare to the performance of an algorithm representative of most scheduling algorithms aboard Earth science missions today as well as an intractable upper bound. We show that our algorithms have great potential to improve science return from Earth science missions.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Robust Operation of Power-Gas Integrated System with Penetration of Wind Energy 12

Two-Stage Robust Operation of Power-Gas Integrated System wi...

引用

12th Iranian Conference on Renewable Energies and Distributed Generation, ICREDG 2025

作者： Hasanzad, Fardin Rezaeieh, Mohammad-Reza Hosseinkhani Talavat, Vahid Rastegar, Hasan Amirkabir University of Technology Department of Electrical Engineering Tehran Iran Urmia University Faculty of Electrical and Computer Engineering Urmia Iran

ISBN: (纸本)9798331525132

The fast development of wind energy installation in power systems accompanied by the interdependency of power and gas systems due to the application of gas-fueled power generating units (GPGUs) and electric-driven gas system compressors (EGSCs) intensified the importance of coordinated operation of power and gas integrated systems (PGISs) with penetration of wind energy. In this paper, a two-stage robust framework is presented for optimal operation of the PGIS under intermittency of wind energy and demand uncertainties, in which the first stage provides day-ahead scheduling of the PGIS, while the second stage addresses the real-time operation. To enable tractable computation, the Column and Constraint Generation (C&CG) algorithm is used to offer an efficient way of solving the proposed model. Numerical simulations on a 24bus-20node PGIS demonstrate the usefulness of the proposed model. © 2025 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A DVFS-Weakly Dependent Energy-Efficient scheduling Approach for Deadline-Constrained Parallel Applications on Heterogeneous Systems

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2021年第12期40卷 2481-2494页

作者： Huang, Jing Li, Renfa An, Jiyao Zeng, Haibo Chang, Wanli Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Hunan Univ Key Lab Embedded & Network Comp Hunan Prov Changsha 410082 Hunan Peoples R China Virginia Tech Dept Elect & Comp Engn Blacksburg VA 24061 USA Univ York Dept Comp Sci York YO10 5GH N Yorkshire England

Heterogeneous computing systems are being increasingly deployed on time-critical applications, where tasks need to meet execution deadlines and the energy consumption is to be minimized. Dynamic voltage and frequency scaling (DVFS) has been widely applied for energy saving on computing devices. Unfortunately, DVFS may introduce transient errors and shorten the processor lifetime. There is also time and energy overhead when computing and making the switching. In this article, we investigate scheduling approaches-that are independent of, or weakly dependent on DVFS-for parallel real-time applications with hard deadlines running on heterogeneous computing systems. The aim is to minimise the energy consumption while keeping all deadlines satisfied. First, in the domain without DVFS, we propose a DVFS-nondependent scheduling algorithm (DNDS), which prioritises tasks of high energy consumption during reassignment with slack time. Second, we propose a DVFS-weakly dependent scheduling (DWDS) algorithm, which finds an appropriate frequency for each processor in an iterative manner. DVFS is only allowed when switching applications. Third, based on DWDS, we further propose an algorithm Fast_DWDS, which quickly converges by deploying a binary search method. Our proposed scheduling approaches are evaluated with a large number of directed acyclic graph-based applications of high, low, and random parallelism. The results show that they significantly reduce the energy cost compared to their existing counterparts, i.e., without and with DVFS, respectively, while all deadlines remain satisfied.

关键词： Task analysis Energy consumption Time-frequency analysis Real-time systems Transient analysis Switches scheduling algorithms Dynamic voltage and frequency scaling (DVFS) energy efficiency heterogeneous systems real-time systems

来源：评论

学校读者我要写书评

暂无评论

Optimal Power Control, scheduling, and Energy Harvesting for Wireless Networked Control Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第3期69卷 1789-1801页

作者： Karadag, Goksu Iqbal, Muhammad Shahid Coleri, Sinem Koc Univ Dept Elect & Elect Engn TR-34450 Istanbul Turkey

Communication system design for wireless networked control systems (WNCSs) requires strict timing, reliability and lifetime guarantees despite limited battery resources and the non-idealities introduced by wireless networking such as delays. In this paper, we introduce radio frequency (RF) energy harvesting paradigm into WNCS framework for the first time in the literature. We study the optimal power control, energy harvesting and scheduling problem with the objective of providing maximum level of adaptivity under periodicity, delay and reliability requirements. We show that the power allocation problem is separable from the scheduling problem at optimality and provide the exact expression for optimal power control. The scheduling problem is then formulated as a mixed integer linear programming (MILP) problem and proven to be NP-Hard. For the scheduling, we propose polynomial-time heuristic algorithms motivated by the analogy between scheduling sensor nodes with energy harvesting requirements over time units and jobs with sequence dependent setup times on identical machines. We prove the theoretical worst-case bound for the performance of these heuristics. We show via extensive simulations that the proposed algorithms perform close-to-optimal and significantly better than Earliest Deadline First (EDF) algorithm in terms of adaptivity, delay, reliability and average runtime.

关键词： scheduling Delays Energy harvesting Wireless sensor networks Wireless communication scheduling algorithms Reliability Wireless networked control systems RF energy harvesting adaptivity power control scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：