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

9th International Conference on Computing and Data Engineering, ICCDE 2023

作者： Sukkerd, Watcharapan Latthawanichphan, Jakkrit Songserm, Watchara Wuttipornpun, Teeradej Department of Industrial Engineering Rajamangala University of Technology Phra Nakhon Bangkok Thailand Department of Mechatronics and Automated Manufacturing Systems Engineering Rajamangala University of Technology Phra Nakhon Bangkok Thailand

ISBN: (纸本)9781450398022

This research studies a single machine scheduling problem with overtime option. The objective is to minimise the total penalty cost (TPC), which is the sum of tardiness, earliness, and overtime costs. A new fitness evaluation heuristic (FEH) capable of minimising TPC is developed. Since FEH works well only when the sequence of jobs is known, it is then integrated into the fitness evaluation step of a variable neighbourhood search (VNS-FEH) to determine the optimal sequence of jobs that obtains the minimum TPC. Effectiveness of the proposed VNS-FEH is evaluated by using real data from three industrial case studies consisting of five job sizes (5, 10, 20, 50, 100) for each, resulting in 270 experiments. The best common parameter setting (BCS) of VNS-FEH applicable for all of the case studies is determined. The results show that TPC obtained from VNS-FEH with its BCS is deviated on average from the best TPC of 0.02%. Moreover, it is better than the bound obtained from the mathematical model with the relative percentage improvement (RPI) of 37.22%. © 2023 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Optimal scheduling of Network Control Based on Earliest Time Limit Priority Algorithm 5

Research on Optimal Scheduling of Network Control Based on E...

引用

5th International Conference on Applied Machine Learning, ICAML 2023

作者： Li, Shaoxi Guangdong University of Science & Technology Dongguan523000 China

ISBN: (纸本)9798350341416

In response to the poor scheduling performance of today's network control optimization scheduling methods, the study proposes to improve the earliest time limit optimization algorithm using fuzzy control and constructs a new network control optimization scheduling algorithm model based on the improved algorithm. The study analyzes the effectiveness of the improved earliest time limit priority algorithm, and the results show that the percentage of Pareto optimal solutions of the improved earliest time limit priority algorithm is 83.86%, which is better than the traditional algorithm. Subsequently, in the simulation experiments of the research proposed optimal scheduling algorithm for network control, it is found that the average scheduling performance score of the scheduling algorithm is 8.8, which is better than similar comparative scheduling algorithms. The above results show that the network control optimized scheduling algorithm proposed in the study has good optimal scheduling performance, and the scheduling performance of network control optimized scheduling can be improved by using this algorithm for scheduling. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Parallel JSO-Based Approach to Task scheduling Problems in Cloud Systems 7

Parallel JSO-Based Approach to Task Scheduling Problems in C...

引用

7th International Symposium on Innovative Approaches in Smart Technologies, ISAS 2023

作者： Burkuk, Mucahit Yildirim, Gungor Ataturk University Dep of Computer Engineering Erzurum Turkey Firat University Dep of Computer Engineering Elazig Turkey

ISBN: (纸本)9798350383065

Task scheduling in cloud systems is essential for both the customer and the service provider. One of the efficient solution methods for task scheduling problems, which is an NP-hard problem type, is the metaheuristic approach. On the other hand, due to its nature, two handicaps can often arise in metaheuristic solutions based on a random search. The first is the possibility of getting stuck in local minima due to randomness, and the second is that the solution time may increase with the increase in the problem size. Multithread /multi-process approaches can provide significant advantages in overcoming these two obstacles. For this purpose, in this study, a parallel Jellyfish Search optimizer-based approach is proposed for task scheduling in cloud systems. In the proposed approach, metaheuristic algorithms working in parallel can share the best solution with each other and shorten the solution time. Both multi-thread and multi-process versions of the proposed approach are used in the study. All versions are tested separately in CloudSim for scenarios with different task sizes and the results were shared. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Starvation-free scheduling for Mixed tasks of Aperiodic, Sporadic, and Periodic tasks using Priority Queues with a slack bit over Controller Area Network 23

Starvation-free Scheduling for Mixed tasks of Aperiodic, Spo...

引用

6th International Conference on Information Science and Systems, ICISS 2023

作者： Kimm, Haklin A Chelladurai, Jeyaprakash Computer Science Department East Stroudburg University of Pennsylvania East StroudsburgPA18301 United States

ISBN: (纸本)9798400708206

Controller Area Network (CAN) is a de facto standard for the message communication among electronic control units (ECUs) in vehicles. Each ECU on the CAN bus operates independently;there is no need to have a principal processor that controls message communications on the shared bus. The CAN bus adapts non-destructive arbitration scheme to determine which device is dominant to transmit on the bus. When multiple devices begin transmitting at the same time, only one device wins the arbitration and starts to transmit, and all other loosing devices continue to receive the remainder of the message from the winning device, and they wait until the winning device finishes before attempting to send their own data again. The lower priority. CAN messages keep losing their transmission turns upon every collision of multiple messages on the CAN bus-starvation problem, which is seen as priority scheduling algorithm that happens to make some low-priority processes waiting indefinitely. The paper presents the starvation problem in CAN real-Time scheduling, where multiple messages from different ECUs are simultaneously trying to win the bus arbitration for bus access. All messages losing their turn in the current arbitration round receive preferential access regarding to their remaining slack time even if their priorities are lower than the highest priority message(s) in other ECU(s) during the next arbitration round. Aperiodic messages are considered as urgent sporadic to be dominant to meet their deadlines to transmit their messages. © 2023 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization of Bandwidth Utilization and Gate Control List Configuration in 802.1Qbv Networks

引用

IEEE ACCESS 2023年 11卷 115076-115090页

作者： Arestova, Anna Hielscher, Kai-Steffen J. German, Reinhard Friedrich Alexander Univ Erlangen Nurnberg Comp Networks & Commun Syst Dept Comp Sci D-91058 Erlangen Germany

The IEEE 802.1 Time-Sensitive Networking (TSN) Task Group has been developing various standards since 2012 to provide deterministic and time-critical services through IEEE 802 networks. The Time-Aware Shaper (TAS) is a key component in TSN that was introduced to enable precise forwarding and shaping of time-sensitive network traffic. It allows configuring exclusive transmission slots for selected traffic classes. To achieve the best benefit from the TAS, numerous scheduling algorithms have been presented to find schedules for the transmission of time-critical network streams optimizing the stream end-to-end transmission times in TAS-based networks. However, most existing works do not address how the scheduling of critical network traffic affects the necessary number of critical transmission slots that is limited in hardware and the resulting bandwidth utilization for other traffic classes. In this paper, we have investigated how a selected set of heuristic and meta-heuristic algorithms for scheduling critical network streams in TAS-based networks affects the utilization of network resources, and how the configuration of TAS can be improved using a compression algorithm. Therefore, we make use of existing algorithms and propose alternatives that have an influence on input data ordering, scheduling procedures, and the TAS configuration. The evaluation showed that some of our proposed modifications can improve bandwidth utilization and reduce the number of transmission slots for critical traffic significantly. Further on, the compression algorithm can bring a remarkable improvement in isolated cases.

关键词： Streams Logic gates Bandwidth Schedules scheduling algorithms Ethernet Telecommunication traffic TSN real-time scheduling ethernet networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling of Distributed Agile Satellites 7

Dynamic Scheduling of Distributed Agile Satellites

引用

7th International Conference on Electrical, Mechanical and Computer Engineering, ICEMCE 2023

作者： Bai, Jiandong Zhang, Qiang Beijing Institute of Tracking and Communication Technology Beijing China

ISBN: (纸本)9798350382877

This paper addresses the problem of task scheduling of distributed agile satellites for Earth observation. The task priority, capability of agile satellites, and data transmission constraints are analyzed. Then the objectives related to observation completion time, profits, and load balance are proposed. Consequently the task scheduling problem is transformed to a multi-constraints multi-objectives optimization problem, which is subsequently solved by contract net protocol (CNP). Three distributed agile satellites and randomly generated 60 target points are used to numerically demonstrate the feasibility and effectiveness of the CNP for solving such problems. Furthermore, the scalability is verified by inserting new tasks into the system on-the-run. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

CFS: A CQF-Based Fast scheduling Scheme for Time-Sensitive Networking 42

CFS: A CQF-Based Fast Scheduling Scheme for Time-Sensitive N...

引用

42nd Chinese Control Conference, CCC 2023

作者： Chen, Yuchao Xu, Lei Li, Lingzhi Lan, Jianguo Tang, Yue Lu, Ruotian Chen, Cailian Shanghai Jiao Tong University Department of Automation Shanghai200240 China

ISBN: (纸本)9789887581543

As the Industrial Internet of Things (IIoT) continues to evolve and mature, many sensors are connected to the industrial site, resulting in the demand for massive data transmission. To achieve deterministic transmission of industrial field data, the IEEE 802.1 working group proposed Time Sensitive Networking (TSN), which can schedule critical flows in real-time. However, most of the existing scheduling algorithms are based on the TAS (Time Aware Shaper) mechanism with huge computational overhead, which cannot schedule a large number of flows within a reasonable time. In this article, we propose a CQF-based fast scheduling scheme, which achieves rapid scheduling of flows by pre-allocating time-slot resources and avoiding packet collisions. We design an algorithm for grouping parallel computing, reducing the large-scale traffic scheduling problem into several smaller-scale issues, significantly shortening the scheduling time. We also introduce a differentiated time-slot allocation (DTSA) method, which allocates time slots by analyzing and calculating the occupancy rate of information length of each group of streams in all streams. Simulation results show that our CFS scheme has dramatically improved the scheduling speed compared to existing scheduling methods. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An adjustable time slice process scheduling algorithm based on feature similarity clustering 4

An adjustable time slice process scheduling algorithm based ...

引用

4th International Conference on Artificial Intelligence and Electromechanical Automation, AIEA 2023

作者： Xiao, Gong Liang, Ding State Key Laboratory of Robotics and System Harbin Institute of Technology Harbin150001 China China Software Testing Center Beijing100000 China

ISBN: (纸本)9781510666412

In order to improve the efficiency of the operating system scheduler, this paper proposes an adjustable time slice process scheduling algorithm ATSPS (Adjustable Time Slice Process scheduling) based on feature similarity clustering, which can reduce the cost of the operating system process scheduling time, reduce the process turnaround time, and improve the process execution efficiency. ATSPS forms different process clusters by clustering the characteristics of process burst time, time slice, weight, and context switching times. It uses the same specification time slice for each type of process cluster. Through queue scheduling adjustment, it accelerates the execution efficiency of computationally intensive processes, reduces the number of contexts switching times caused by the expiration of time slice, and saves scheduling time. The scheduling process of robot grabbing program in the operating system is simulated by MATLAB, and the ready queue, blocking queue and execution queue of the operating system are simulated. The robot grabbing program is simulated, including visual process, force control process and posture process. ATSPS is compared with five classical scheduling algorithms. The experimental results show that on the scheduling criteria of three CPU scheduling algorithms, namely, waiting time, turnaround time and context switching times, ATSPS algorithm reduces the time cost of process scheduling, realizes the real-time scheduling of operating system process, and provides guarantee for the real-time control of robot. © 2023 SPIE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Multilevel Cloud resource scheduling approach based on image-based signature system 5

Multilevel Cloud resource Scheduling approach based on image...

引用

5th International Conference on Information Management and Machine Intelligence, ICIMMI 2023

作者： Chakraborty, Koushik Singhal, Sweety Arya, Nancy Tiwari, Mohit Khatoon, Aasiya Tiwari, Ashish Adamas University Kolkata India Department of Computer Science Sangam University Bhilwara India Department of Computer Science and Engineering Shree Guru Gobind Singh Tricentenary University Gurugram India Department of Computer Science and Engineering Bharati Vidyapeeth's College of Engineering A-4 Rohtak Road Paschim Vihar Delhi India Department of Computer Science and Engineering Roorkee Institute of Technology Roorkee India Department of Computer Science and Engineering Amity University Lucknow India

ISBN: (纸本)9798400709418

Cloud computing is arising with developing fame in work process booking, particularly for logical work process. During resource allotment, the cloud computing climate might experience impressive issues as far as execution time and execution cost, which might prompt disturbances in assistance quality given to clients. Text Passwords are at this point a completely used affirmation part, but graphical passwords and biometrics are also used. Nevertheless, to make any system astoundingly secure we really want to improve comfort as well as security. Cloud resource scheduling is a critical aspect of cloud computing that involves efficiently allocating and managing cloud resources to meet the demands of applications and services. Various scheduling approaches aim to optimize resource utilization, minimize costs, and improve overall system performance. Automatically scaling resources up or down based on workload demand. Improves cost-efficiency by dynamically adjusting resources to match varying workloads, ensuring optimal performance during peak times and cost savings during low demand. Our proposed FSOS (Fastest scheduling Optimized system) algorithm is most probably used for the framework so that the performance may increase. It uses components of both Graphical and Text Password plans. In this proposed FSOS (Fastest scheduling Optimized system) mannequin we have in contrast with the most famous algorithms like multi-objective scheduling (MOS), fee conscious scheduling (SCAS) are the various scheduling algorithms to make cloud services secure and highly available to the end users. In this exploration, we endeavor to show the most well-known three static errand booking calculations execution of various algorithm system. All the algorithms are calculating the total execution cost and timing of different algorithms. © 2023 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved Priority-Based Level Algorithm for just-in-time scheduling 26

An improved Priority-Based Level Algorithm for just-in-time ...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chen, Yuxin Hong, Yue Wang, Caie Xiamen University Department of Computer Science Xiamen China

ISBN: (纸本)9798350331684

In dynamic distributed computing environment, due to the uncertainty of resource and computation execution time, how to effectively solve the scheduling problem of interdependent tasks consisting of complex computations has become a significant research topic. As a heuristic just-in-time scheduling algorithm, the priority-based level (PBL) has been proved to have better performance than other existing algorithms. However, due to its own limitations, PBL will cause excessive computing overhead when dealing with high parallelism of ready tasks. To overcome this problem, we propose an improved priority-based level (iPBL) algorithm. Experiments show that iPBL can significantly improve the executing efficiency of PBL algorithm and maintain the same scheduling results as PBL. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：