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

2nd Power Electronics and Power System Conference, PEPSC 2024

作者： Tan, Xinzhi Chen, Tiancheng Liu, Huicong Huang, Shengbo Zhuang, Zini Hu, Yuan Shenzhen Power Supply Co. Ltd Shenzhen China

ISBN: (纸本)9798350390193

In recent years, with the rapid development of the electric vehicle industry, the optimal scheduling problem for electric vehicles for corporate attendance has become a research focus. This paper establishes a multi-objective optimization vehicle scheduling mathematical model based on the characteristics of electric vehicles, taking the cost minimization and carbon emission minimization as the optimization objectives on the basis of the constraints of charging demand, loading and service time window of electric vehicle travel. In order to solve the model, this paper utilizes a hybrid genetic algorithm to obtain the optimal attendance and charging routes for electric vehicles, and finally verifies the effectiveness of the model and algorithm by combining with the arithmetic examples. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Synergy: Collaborating Centralized and Local scheduling for Serverless Functions 30

Synergy: Collaborating Centralized and Local Scheduling for ...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Chen, Hanmei Zhao, Laiping Yang, Yanan You, Jianing Li, Keqiu Tianjin University Tianjin Key Lab. of Advanced Networking Tianjin China Tianjin University Tanklab Tianjin China Cloud Computing Research Institute China Telecom Beijing China

ISBN: (纸本)9798331515966

Serverless computing enables a new way of building and scaling cloud applications by allowing developers to write fine-grained functions. The execution duration of a cloud function is typically short, usually ranging from a few milliseconds to a few seconds. FaaS providers charge users based on the execution duration of cloud functions with a granularity of 1 millisecond. Existing mixed scheduling methods collocate functions with varying execution times, which may prolong their execution duration and lead to unfair charges for FaaS users. To address this problem, we propose a partition scheduling approach, placing functions with varying execution times on different partitions. We introduce Synergy, a solution in serverless computing that leverages a collaboration of central and local scheduling to partition functions and employs suitable scheduling algorithms for these partitions respectively. Synergy also supports the dynamic switching of scheduling algorithms for partitioned nodes to adapt to highly fluctuating loads. We evaluate Synergy using real-world, representative benchmarks. Experimental results demonstrate that, compared to state-of-the-art and conventional approaches, Synergy can reduce the average function execution duration by 63%. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

COCSN: A Multi-Tiered Cascaded Optical Circuit Switching Network for Data Center

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2024年第4期12卷 1463-1475页

作者： Li, Shuo Gu, Huaxi Yu, Xiaoshan Huang, Hua Wang, Songyan Chang, Zeshan Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Huawei Technol Optial Prod Line Shenzhen 518000 Peoples R China

A cascaded network represents a classic scaling-out model in traditional electrical switching networks. Recent proposals have integrated optical circuit switching at specific tiers of these networks to reduce power consumption and enhance topological flexibility. Utilizing a multi-tiered cascaded optical circuit switching network is expected to extend the advantages of optical circuit switching further. The main challenges fall into two categories. First, an architecture with sufficient connectivity is required to support varying workloads. Second, the network reconfiguration is more complex and necessitates a low-complexity scheduling algorithm. In this work, we propose COCSN, a multi-tiered cascaded optical circuit switching network architecture for data center. COCSN employs wavelength-selective switches that integrate multiple wavelengths to enhance network connectivity. We formulate a mathematical model covering lightpath establishment, network reconfiguration, and reconfiguration goals, and propose theorems to optimize the model. Based on the theorems, we introduce an over-subscription-supported wavelength-by-wavelength scheduling algorithm, facilitating agile establishment of lightpaths in COCSN tailored to communication demand. This algorithm effectively addresses scheduling complexities and mitigates the issue of lengthy WSS configuration times. Simulation studies investigate the impact of flow length, WSS reconfiguration time, and communication domain on COCSN, verifying its significantly lower complexity and superior performance over classical cascaded networks.

关键词： Optical switches Switching circuits Optical fiber networks Optical packet switching Data centers Topology scheduling algorithms Mathematical models Integrated circuit modeling Heuristic algorithms Networks optical interconnections optical switches reconfigurable architectures scheduling topology

来源：评论

学校读者我要写书评

暂无评论

Locking Protocols for Parallel Real-Time Tasks With Semaphores Under Federated scheduling

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2022年第9期41卷 2877-2890页

作者： Wang, Yang Jiang, Xu Guan, Nan Tang, Yue Liu, Weichen Northeastern Univ Key Lab Intelligent Comp Med Image Minist Educ Shenyang 110819 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

Suspension-based locks are widely used in real-time systems to coordinate simultaneous accesses to exclusive shared resources. Although suspension-based locks have been well studied for sequential real-time tasks, little work has been done on this topic for parallel real-time tasks. This article for the first time studies the problem of how to extend existing sequential-task locking protocols and their analysis techniques to the parallel task model. More specifically, we extend two locking protocols OMLP and OMIP, which were designed for clustered scheduling of sequential real-time tasks, to federated scheduling of parallel real-time tasks. We present corresponding blocking analysis techniques, and develop path-oriented techniques to analyze and count blocking time. Schedulability tests with different efficiency and accuracy are further developed. Experiments are conducted to evaluate the performance of our proposed approaches against the state-of-the-art.

关键词： Task analysis Protocols Real-time systems Program processors Timing scheduling algorithms Time factors Blocking analysis parallel tasks real-time scheduling semaphores

来源：评论

学校读者我要写书评

暂无评论

Mixed-Criticality Industrial Data scheduling on 5G NR

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第12期9卷 10306-10318页

作者： Jin, Xi Tian, Yu Xu, Chi Xia, Changqing Li, Dong Zeng, Peng Chinese Acad Sci Key Lab Networked Control Syst Shenyang 110016 Peoples R China Chinese Acad Sci Shenyang Inst Automat Shenyang 110016 Peoples R China Chinese Acad Sci Inst Robot & Intelligent Mfg Shenyang 110169 Peoples R China

Compared to industrial wired networks, 5G can improve device mobility and reduce the cost of networking. However, the real-time performance and reliability of 5G new radio (NR) still need to be improved to satisfy industrial applications' requirements. In factories, the main factor that affects the performance of 5G NR is the unstable signal quality caused by high temperatures and metal. Although assigning dedicated resources to all transmissions and retransmissions is an effective method to improve the performance of 5G NR, the unstable signal quality causes the resources required for retransmissions to be uncertain. To address the problem, we introduce the mixed-criticality task model to 5G NR. When high-criticality packets cannot be transmitted, they are allowed to preempt the resources shared with low-criticality packets. The mixed-criticality scheduling problem of 5G NR is NP-hard. We formulate it as an optimization modulo theories (OMT) specification and propose a scheduling algorithm based on bin packing methods to make 5G NR satisfy industrial applications' requirements. Finally, we conduct extensive evaluations based on an industrial 5G testbed and random test cases. The evaluation results indicate that our algorithm makes communication reliability greater than 99.9% on unlicensed spectrum, and for most test cases, our algorithm is close to optimal solutions.

关键词： 5G mobile communication Task analysis Real-time systems scheduling algorithms Reliability Job shop scheduling Time-frequency analysis 5G new radio (NR) mixed criticality real-time performance reliability scheduling

来源：评论

学校读者我要写书评

暂无评论

A Reliable Self-Adaptive scheduling Control Protocol for Cellular V2X Mode 4

引用

IEEE ACCESS 2022年 10卷 63991-64003页

作者： Wu, Jingbang Guo, Yihan Zhou, Shufen Beijing Technol & Business Univ Sch Comp Sci & Engn Beijing 100048 Peoples R China Beijing Key Lab Big Data Technol Food Safety Beijing 100048 Peoples R China

The rapid development and deployment of the Cellular V2X (C-V2X) require a highly reliable support system for many vehicular key applications. However, the current standard sensing-based semi-persistent scheduling (SB-SPS) protocol yields poor performance in terms of reliability, due to the hidden terminal problem and the half-duplex issue. In this paper, we propose a reliable self-adaptive MAC protocol for C-V2X Mode 4 (autonomous sidelink). It utilizes frame information and RSSI to exclusively scheduling resource blocks in two-hop neighbors, and dynamically adjusts scheduling and frame length according to changes of the network environment. Simulation results show that the proposed protocol achieves significantly higher PDR and lower number of the packet collisions than SB-SPS and IEEE 802.11p.

关键词： Vehicle-to-everything Base stations Time division multiple access Heuristic algorithms Sensors Vehicular ad hoc networks scheduling algorithms Cellular V2X (C-V2X) medium access control scheduling packet collision resolution adaptive frame length

来源：评论

学校读者我要写书评

暂无评论

Intelligent Assembly scheduling of Large Laser Devices Based on Neural Network 13

Intelligent Assembly Scheduling of Large Laser Devices Based...

引用

13th International Conference on Electronics, Communications and Networks, CECNet 2023

作者： Xiong, Zhao Wang, Chengcheng Hu, Dongxia Laser Fusion Research Center CAEP Mianyang621900 China

ISBN: (纸本)9781643684802

Aiming at the dynamic flexible scheduling problem in the integrated installation of large-scale laser devices, a deep learning rule acquisition method based on artificial neural network is proposed. Firstly, the typical example is optimized by genetic algorithm, then the task comparison trajectory and characteristic data are extracted from the optimal solution, and the task priority model is generated by deep learning. Finally, the dynamic flexible scheduling decision mode is constructed based on the algorithm model, so as to realize fast response and accurate scheduling in complex, changeable and uncertain production environment. Data experiments and practical cases verify the effectiveness of this method. With the increase of the number of scheduling objects, the computational efficiency of ANN scheduling algorithm is obviously better than GA algorithm in the case of little difference in calculation results. © 2024 The authors and IOS Press.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Green Flexible Job Shop scheduling based on SMAPE-Jaya Algorithm 12

Green Flexible Job Shop Scheduling based on SMAPE-Jaya Algor...

引用

12th International Symposium on Project Management, ISPM 2024

作者： Li, Xue Lu, Shichang School of Business Administration Liaoning Technical University Liaoning Huludao125000 China

ISBN: (纸本)9798331302344

Aiming at flexible job shop scheduling, a multi-objective optimization model was established to minimize the maximum completion time, total machine load and total carbon emission. In the traditional Jaya algorithm, the elite retention strategy is proposed, which divides the whole population into several subpopulations and assigns them to the whole search area, so that the global search ability of the algorithm can be significantly improved, and the algorithm can avoid falling into the local optimal. Finally, the feasibility and effectiveness of the proposed model and algorithm are verified by an example and decision analysis of the optimal scheduling scheme. © 2024 ISPM. All Rights Reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Video Understanding based Multiple Entity Collaborative scheduling for Social Governance 17

Video Understanding based Multiple Entity Collaborative Sche...

引用

17th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics, CISP-BMEI 2024

作者： Chen, Yanxing Wu, Jun Yang, Youcheng Xu, Ran Cui, Wendi Li, Yaqin Li, Renjie ROPEOK Technology Group Co. Ltd. China China Mobile Communications Corporation China

ISBN: (纸本)9798331507398

In the scenarios of social governance, it often requires real-time handling of various unexpected events, which usually involves collaboration among multiple entities. The keys to this task are real-time action and the coordinated scheduling of diverse public departments. To address this issue, we propose a video-based collaborative scheduling solution. By leveraging real-time video streams captured by on-site cameras, we can instantly access live footage. Utilizing the powerful video understanding capabilities of large multimodal models, we are able to effectively interpret on-site event information. Additionally, by considering the functions and locations of various departments along with pre-prepared response plans, we enable collaborative scheduling through Retrieval Augmented Generation (RAG) capabilities. We conduct experiments on a set of real event video data and invite experts to evaluate the generated collaborative scheduling solution. Results demonstrate that the scheduling proposals achieved over 90% satisfaction among experts. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Cascade: Optimal Transaction scheduling for High-Contention Workloads 40

Cascade: Optimal Transaction Scheduling for High-Contention ...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Baccaert, Tim Ketsman, Bas Vrije Universiteit Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9798350317152

The performance of multi-core transactional systems is a well-studied area, with the ultimate goal of optimizing the balance between high concurrency and the appearance of serial execution. In recent years, partitioning-based systems have shown that we can gain benefits from ahead-of-execution analysis on batches of transactions. However, this benefit is largely lost as contention increases. In this work, we investigate what it means for a batch to be executed optimally in the face of high contention. Intuitively, we will consider a schedule to be optimal if it minimizes the time spent waiting for exclusive access to tuples. We also design an algorithm that can optimally schedule batches, that satisfy particular properties, in quasi-linear time. We then implement it in a system called Cascade, and provide a preliminary evaluation against an existing system. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：