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

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Ruitai Li Quan Yuan Tongxin Liao Lijun Luo Menglan Hu Pan Lai Xiao Zhang College of Computer Science South-Central Minzu University Key Laboratory of Cyber-Physical Fusion Intelligent Computing State Ethnic Affairs Commission School of Electronic Information and Communications Huazhong University of Science and Technology Hubei Key Laboratory of Smart Internet Technology

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

With the rapid growth of the on-demand economy, logistics companies and merchants increasingly struggle to meet customer demands in dynamic and uncertain conditions. This paper studies the coordinated delivery of parcels by trucks and drones under such demands, proposing a Dynamic Task scheduling Algorithm based on Hybrid Genetic Tabu algorithm (DTSAGT) for route optimization. Simulating dynamic customer demands with a Poisson distribution and statistical methods, the algorithm addresses timeliness issues due to variations in customer needs. It optimizes drone path planning and task allocation considering drone endurance and payload limits to minimize total delivery time. The algorithm includes three steps: initial solution construction, iterative optimization, and dynamic operations. Experimental results show that DTSAGT reduces the total service time by 15.05%, 34.13%, and 35.71% on average compared to the baseline algorithms. This paper’s contribution is the combination of hybrid genetic and tabu search algorithms applied to dynamic task scheduling in truck-drone delivery, enhancing logistics efficiency.

关键词： scheduling algorithms Statistical analysis Heuristic algorithms Transportation Dynamic scheduling Genetics Vehicle dynamics Optimization Drones Logistics

来源：评论

学校读者我要写书评

暂无评论

BachLedger: Orchestrating Parallel Execution with Dynamic Dependency Detection and Seamless scheduling

BachLedger: Orchestrating Parallel Execution with Dynamic De...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yi Yang Guangyong Shang Guangpeng Qi Zhen Ma Yaxiong Liu Jiazhou Tian Aocheng Duan Meng Zhang Jingying Li Xuan Ding School of Software Tsinghua University Beijing China Inspur Yunzhou Industrial Internet Co. Ltd Jinan Shandong China School of Cyber Engineering Xidian University Xi’an Shaanxi China

ISBN: (数字)9798331515966

ISBN: (纸本)9798331515973

Blockchain technology inherently necessitates redundant computation to achieve consensus among untrusted parties because of its fundamental threat model. This requirement, however, compromises system performance and impedes the widespread adoption of blockchain. To leverage existing physical resources, current research on high-performance consortium blockchain algorithms and architectures frequently employs cluster-node architectures to expand the parallel processing capability of traditional single physical nodes. Our investigation reveals a significant trend as the parallel capability of individual nodes improves. The idle time caused by synchronization of all transactions within each block, previously considered negligible, has become increasingly significant. To address this, we present BachLedger, which implements Seamless scheduling to fully utilize inter-block thread idle time, thereby augmenting system resource utilization and achieving overall performance improvements. Our experimental results demonstrate that our algorithm surpasses current state-of-the-art (SOTA) performance levels in high-performance consortium blockchains and effectively resolves the aforementioned synchronization issue. Furthermore, this scheduling algorithm offers enhanced scalability for BachLedger, positioning it as a promising solution for future blockchain implementations.

关键词： Threat modeling scheduling algorithms System performance Scalability Computer architecture Parallel processing Dynamic scheduling Blockchains Synchronization Resource management

来源：评论

学校读者我要写书评

暂无评论

Hybrid Time-Triggered and Event-Triggered Flow scheduling for Time-Sensitive Networking (TSN)

Hybrid Time-Triggered and Event-Triggered Flow Scheduling fo...

引用

International Conference on Computer and Communications (ICCC)

作者： Yiming Xu Kaixuan Kang Qianyi Tan Suzhi Cao Peng Liu University of Chinese Academy of Sciences Beijing China Key Laboratory of Space Utilization Chinese Academy of Sciences Beijing China Technology and Engineering Center for Space Utilization Chinese Academy of Sciences Beijing China

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

Time-sensitive Networking (TSN) is an emerging technology that aims to solve the problem of precise network latency control in next generation industrial networks. In addition to conventional best-effort flows, TSN needs to deliver time critical flows, which are of high-priority. To ensure deterministic latency for time-critical flows, various scheduling models have been developed. However, those models are primarily designed for time-triggered (TT) critical flows, which are predictable and periodic. In realistic industrial scenarios, often there exist event-triggered (ET) critical flows, which are bursty and may have higher priority than time-triggered flows. In this paper, we design an enhanced TACQ model to meet the requirements of managing event-triggered flows, without affecting the deterministic transmission of time-triggered flows. On top of this model, we propose a corresponding event-triggered flows scheduling algorithm. Furthermore, to reduce the computation time of time-triggered flows scheduling, we propose a weighted sorting algorithm based on path optimization (WSPO). Simulations are conducted to evaluate the performance of our model and algorithms. Compared to traditional models and algorithms, the proposed methods can better handle hybrid critical flows.

关键词： Job shop scheduling Event detection scheduling algorithms Computational modeling Interference Predictive models Time factors Optimization Next generation networking Sorting

来源：评论

学校读者我要写书评

暂无评论

Research on the verification method of the Event-B model for the heterogeneous multi-core scheduling algorithm

Research on the verification method of the Event-B model for...

引用

Communication Technology and Information Technology (ICCTIT), International Conference on

作者： Junjie Zuo Yahui Han Feng Xiao Shujuan Huang School of Computer Science and Engineering Xi’an Technological University Xi’an China

ISBN: (数字)9798331528973

ISBN: (纸本)9798331528980

It is well known that the logical verification for the operating system is very essential. Event-B, as a formal verification tool, is one of the most widely used methods for verifying programs at the operating system level. However, it lacks the precise time semantics expression that will make the representation of the behavioral logic complicated for verified scheduling process. To address this limitation, we proposes an EMPT (Event-B Multi-core Processor Time) model in rodin platform, which can represent the time semantics by using set mappings and operations. After that we apply it to the logical verification for the heterogeneous multicore scheduling algorithm (HEFT), and the results show that it can verify the accuracy of this algorithm.

关键词： scheduling algorithms Multicore processing Operating systems EMTP Semantics Communications technology Timing Logic Information technology Formal verification

来源：评论

学校读者我要写书评

暂无评论

A Joint Flow Rerouting and scheduling Algorithm with CQF in Time-Sensitive Networks

A Joint Flow Rerouting and Scheduling Algorithm with CQF in ...

引用

IEEE International Conference on Signal and Image Processing (ICSIP)

作者： Hongzhi Fei Weiqiang Pan Xin Wen Zhuoxing Chen Yiqin Lu Jiancheng Qin School of Electronics and Information Engineering South China University of Technology Guangzhou China

ISBN: (数字)9798350350920

ISBN: (纸本)9798350350937

Time-sensitive networking (TSN) provides low-latency scheduling and reliable transmission in Industry 4.0. Cyclic Queuing and Forwarding (CQF) is recognized as a promising flow shaping mechanism in TSN. However, the existing studies on joint routing and scheduling with CQF have separately solved flow sorting and the injection time slot offset, which may lead to the neglect of some better scheduling schemes. To fully leverage the interconnection between flow sorting and the injection time slot offset, this paper develops an integrated metric, combination matching score (CMS), to assess the scheduling priority of different flow and offset combinations and proposes a joint pending flow rerouting and scheduling (JPFRS) algorithm with the CQF mechanism in TSN. Simulation results demonstrate that the proposed JPFRS algorithm achieves an average improvement of 46.43% in scheduling success rate compared to the baseline, and an average improvement of 11.78% compared to the state-of-the-art mapping score based scheduling (MSS) algorithm.

关键词： Measurement Job shop scheduling scheduling algorithms Simulation Scalability Routing Resource management

来源：评论

学校读者我要写书评

暂无评论

Tail Optimality and Performance Analysis of the Nudge-M scheduling Algorithm

arXiv

引用

arXiv 2024年

作者： Charlet, Nils Houdt, Benny Van Dept. Computer Science University of Antwerp Belgium

Recently it was shown that the response time of First-Come-First-Served (FCFS) scheduling can be stochastically and asymptotically improved upon by the Nudge scheduling algorithm in case of light-tailed job size distributions. Such improvements are feasible even when the jobs are partitioned into two types and the scheduler only has information about the type of incoming jobs (but not their size). In this paper we introduce Nudge-M scheduling, where basically any incoming type-1 job is allowed to pass any type-2 job that is still waiting in the queue given that it arrived as one of the last M jobs. We prove that Nudge-M has an asymptotically optimal response time within a large family of Nudge scheduling algorithms when job sizes are light-tailed. Simple explicit results for the asymptotic tail improvement ratio (ATIR) of Nudge-M over FCFS are derived as well as explicit results for the optimal parameter M. An expression for the ATIR that only depends on the type-1 and type-2 mean job sizes and the fraction of type-1 jobs is presented in the heavy traffic setting. The paper further presents a numerical method to compute the response time distribution and mean response time of Nudge-M scheduling provided that the job size distribution of both job types follows a phase-type distribution (by making use of the framework of Markov modulated fluid queues with jumps). Copyright © 2024, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Instance Configuration for Sustainable Job Shop scheduling

arXiv

引用

arXiv 2024年

作者： Pérez, Christian March, Carlos Salido, Miguel Universitat Politècnica de València Instituto de Automática e Informática Industrial Camì de Vera S/N Valencia Spain Universitat Politècnica de València valgrAI - Valencian Graduate School and Research Network of Artificial Intelligence Camì de Vera S/N Valencia Spain

The Job Shop scheduling Problem (JSP) is a pivotal challenge in operations research and is essential for evaluating the effectiveness and performance of scheduling algorithms. scheduling problems are a crucial domain in combinatorial optimization, where resources (machines) are allocated to job tasks to minimize the completion time (makespan) alongside other objectives like energy consumption. This research delves into the intricacies of JSP, focusing on optimizing performance metrics and minimizing energy consumption while considering various constraints such as deadlines and release dates. Recognizing the multi-dimensional nature of benchmarking in JSP, this study underscores the significance of reference libraries and datasets like JSPLIB in enriching algorithm evaluation. The research highlights the importance of problem instance characteristics, including job and machine numbers, processing times, and machine availability, emphasizing the complexities introduced by energy consumption considerations. An innovative instance configurator is proposed, equipped with parameters such as the number of jobs, machines, tasks, and speeds, alongside distributions for processing times and energy consumption. The generated instances encompass various configurations, reflecting real-world scenarios and operational constraints. These instances facilitate comprehensive benchmarking and evaluation of scheduling algorithms, particularly in contexts of energy efficiency. A comprehensive set of 500 test instances has been generated and made publicly available, promoting further research and benchmarking in JSP. These instances enable robust analyses and foster collaboration in developing advanced, energy-efficient scheduling solutions by providing diverse *** Codes 68W99 © 2024, CC BY-NC-ND.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Window-Based Heuristic TSN scheduling Algorithm Using Array Theory Encoding

A Window-Based Heuristic TSN Scheduling Algorithm Using Arra...

引用

Electronic Information Engineering and Computer Science (EIECS), 2021 International Conference on

作者： Zhaochuan Sang Yinshan Wang Hongchao Zhang School of Automobile and Transportation Tianjin University of Technology and Education Tianjin China

ISBN: (数字)9798331531409

ISBN: (纸本)9798331531416

The Time Sensitive Network (TSN) based on Ethernet extends standard Ethernet into a deterministic network with real-time functionality through a series of sub standards. This paper designs a mathematical model using array theory, which transforms the gate control mechanism into an array of window opening and closing events while retaining the original model, making it applicable to the general situation of TSN networks (multiple frames per stream, multicast streams). In addition, based on the preprocessing algorithm proposed in this paper for synthesizing link sequences, a multi-objective heuristic optimization offline scheduling algorithm based on SMT was designed to schedule each link with the shortest GCL length and the smallest number of occupied queues. This algorithm has the ability to solve in polynomial time and reserves more time and space resources for the network. The performance evaluation using the Z3 solver shows that the optimized algorithm has significantly improved performance compared to the original algorithm.

关键词： Performance evaluation Schedules Multicast algorithms scheduling algorithms Ethernet Transforms Mathematical models scheduling Real-time systems Standards

来源：评论

学校读者我要写书评

暂无评论

Sparse Actuator scheduling for Discrete-Time Linear Dynamical Systems

Sparse Actuator Scheduling for Discrete-Time Linear Dynamica...

引用

Indian Control Conference (ICC)

作者： Krishna Praveen V. S. Kondapi Chandrasekhar Sriram Geethu Joseph Chandra R. Murthy Dept. of ECE Indian Institute of Science (IISc) Bangalore India Dept. of ECE IISc Texas Instruments India Pvt. Ltd. Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft CD Netherlands

ISBN: (数字)9798331517212

ISBN: (纸本)9798331517229

We consider the control of discrete-time linear dynamical systems using sparse inputs where we limit the number of active actuators at every time step. We develop an algorithm for determining a sparse actuator schedule that ensures the existence of a sparse control input sequence, following the schedule, that takes the system from any given initial state to any desired final state. Since such an actuator schedule is not unique, we look for a schedule that minimizes the energy of sparse inputs. For this, we optimize the trace of the inverse of the resulting controllability Gramian, which is an approximate measure of the average energy of the inputs. We present a greedy algorithm along with its theoretical guarantees. Finally, we empirically show that our greedy algorithm ensures the controllability of the linear system with a small number of active actuators per time step without a significant average energy expenditure compared to the fully actuated system.

关键词： Greedy algorithms Linear systems Actuators Schedules scheduling algorithms Heuristic algorithms Energy measurement Controllability Minimization Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

SLA based Workflow scheduling algorithm in Cloud Computing using Haris Hawks optimization

引用

EAI Endorsed Transactions on Scalable Information Systems 2023年第6期10卷

作者： Mangalampalli, Sudheer Karri, Ganesh Reddy Pokkuluri, Kiran Sree RajKumar, K Varada Satish, Ganti Naga School of Computer Science and Engineering VIT-AP University Amaravati India Department of Computer Science and Engineering Shri Vishnu Engineering College for Women A.P. Bhimavaram India MLRIT Hyderabad Telangana India Department of Computer Science and Engineering BVRIT HYDERABAD Telangana India

Task scheduling is crucial facet in cloud paradigm as virtual resources need to be provisioned to the variable requests coming onto cloud console from various users and more over that tasks are depends on each other which creates a workflow which is a difficult task for cloud service provider to provision these tasks over appropriate VMs. Inefficient mapping of tasks to VMs increases makespan and lead to violation of SLA between users, cloud provider. In this paper, we modeled a SLA based workflow scheduling algorithm focuses on minimization of makespan and SLA violations. This algorithm developed using Harris hawks optimization. Experimentation carried out using workflowsim. Random workload fed as input to algorithm and it is evaluated against existing baseline approaches and simulation results revealed that our proposed approach minimizes makespan and SLA violations over existing approaches by 40% and 43% respectively. © 2023 S. Mangalampalli et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：