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

A Microservice Architecture with Load Balancing Mechanism in Cloud Environment 1

International Conference on Machine Learning and Big Data Analytics, ICMLBDA 2022

作者： Mummana, Satyanarayana Sambana, Bosubabu Ramanababu, Budimure Gandreti, Preethi Rani, P. Pratima Mishra, Priyanka Chandrasekhar, A. Narasimha Raju, K. Andhra Pradesh Vizianagaram India Jawaharlal Nehru Technological University Andhra Pradesh Kakinada India Department of Computer Science and Engineering Indian Institute of Information Technology Kota Rajasthan Jaipur India Andhra Pradesh Visakhapatnam India Department of Computer Science and Engineering Vignan’s Institute of Information Technology Visakhapatnam Andhra Pradesh India Department of Computer Science and Engineering Avanthi Institute of Engineering and Technology Vizianagaram Andhra Pradesh India Visakhapatnam Andhra University Andhra Pradesh India

ISBN: (数字)9783031151750

ISBN: (纸本)9783031151743

To solve the rising delay in responding to requests in Microservices Architecture (MSA), a load-balancing algorithm for requests is proposed based on microservice chain awareness. To formalize the request delay and microservice environment, the algorithm takes the average request delay and the host loads as the evaluation indicators. On this basis, the competition for shared microservices in microservice chain calling is studied. The simulation results show that the proposed rules can substantially reduce the put-off in requests in a complex microservice chain environment compared to the RR algorithm set of rules. In addition, it keeps excellent loading performance in an environment with unevenly distributed instances and balances loads of different hosts. In the more realistic tests of high-frequency requests, the proposed set of rules can drastically reduce the available reaction time of the system. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Optimized Solution to Harmonized First-Come-First-Serve Based Multiple Queues Using Sets of Predefined Burst Time 2

An Optimized Solution to Harmonized First-Come-First-Serve B...

引用

2nd International Conference on Multidisciplinary Engineering and Applied Science, ICMEAS 2023

作者： Ndupu, Mary-Fidelma C. Adeniyi, Ahmed A. Adeshina, Steve A. Nile University of Nigeria Department of Computer Science Abuja Nigeria Nile University of Nigeria Department of Computer Engineering Abuja Nigeria

ISBN: (纸本)9798350358834

There are many scheduling algorithms in existence today, each with key features, advantages, and drawbacks. scheduling algorithms are the solutions to queuing problems in computing environment which also has real life application;each scheduling algorithm comes with its unique set of advantages, drawbacks, situations, and environments where they perform at optimal levels. This paper aims to propose an optimized scheduling algorithm which will eliminate possible drawbacks. This is achieved by implementing the solutions which have shown positive results in computing environment and in the business environment. © 2023 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A scheduling Algorithm for Mobile Charging Devices in Distribution System Considering the Comprehensive Influence of Multiple Factors

A Scheduling Algorithm for Mobile Charging Devices in Distri...

引用

International Conference on Power Electronics and Motion Control (IPEMC)

作者： Feiyu Chen Qingsong Wang Jiaming Song Giuseppe Buja School of Software Engineering Southeast University Suzhou China School of Electrical Engineering Southeast University Nanjing China Department of Industrial Engineering University of Padova Italy

ISBN: (数字)9798350351330

ISBN: (纸本)9798350351347

The current mismatch between the number of public fixed charging stations and the ownership of electric vehicles has brought enormous charging pressure, and mobile charging services can provide an alternative to battery replenishment. As an energy storage device, mobile charging device is also beneficial for improving the reliability of distribution systems. A scheduling algorithm for mobile charging devices is proposed in this paper, which considers comprehensive impact of multiple factors. The operation mode and application scenarios of mobile charging services are analyzed, the electric vehicle charging model and scheduling cost calculation model are established. Finally, the feasibility and effectiveness of the algorithm are verified through simulation example.

关键词： Industries Analytical models Job shop scheduling Costs scheduling algorithms Transportation Optimal scheduling

来源：评论

学校读者我要写书评

暂无评论

scheduling Policies in a Multi-Source Status Update System with Dedicated and Shared Servers

arXiv

引用

arXiv 2024年

作者： Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail University of Maryland College ParkMD United States Bilkent University Ankara Turkey

Use of multi-path network topologies has become a prominent technique to assert timeliness in terms of age of information (AoI) and to improve resilience to link disruptions in communication systems. However, establishing multiple dedicated communication links among network nodes is a costly endeavor. Therefore, quite often, these secondary communication links are shared among multiple entities. Moreover, these multi-path networks come with the added challenge of out-of-order transmissions. In this paper, we study an amalgamation of the above two aspects, i.e., multi-path transmissions and link sharing. In contrast to the existing literature where the main focus has been scheduling multiple sources on a single shared server, we delve into the realm where each source sharing the shared server is also supplemented with its dedicated server so as to improve its timeliness. In this multi-path link sharing setting with generate-at-will transmissions, we first present the optimal probabilistic scheduler, and then propose several heuristic-based cyclic scheduling algorithms for the shared server, to minimize the weighted average age of information of the sources. Copyright © 2024, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Intelligent Workforce Management: A Smart Biometric Approach to Optimal Staff scheduling

Intelligent Workforce Management: A Smart Biometric Approach...

引用

Recent Trends in Computer Science and Technology (ICRTCST), International Conference on

作者： Mohnaa Ghosh Devyanjali Srivastava M. Kowsigan Department of Computing Technologies College of Engineering & Technology SRM Institute of Science and Technology Kattankulathur Chengalpattu Tamil Nadu India

ISBN: (数字)9798350351378

ISBN: (纸本)9798350351385

Manager discretion arises from ineffective absence and attendance tracking, which are dependent on human scheduling, and leads to ineffective staff scheduling. Systems for tracking time and attendance frequently need manual data entry. For precise attendance tracking, fingerprint biometric integration is essential. The suggested method creates an optimization model for staff scheduling using biometric data. The suggested method offers a user-friendly interface to prevent manager errors, increased operational effectiveness, and equitable scheduling. The administrative load has decreased as a result. The suggested strategy has a number of benefits over conventional techniques, such as improved resource efficiency and attendance monitoring accuracy. Subsequent improvements to this methodology may encompass broadening the system’s flexibility to accommodate diverse organizational structures, investigating supplementary biometric data sources, and augmenting the system’s scalability and amalgamation with supplementary HR and management instruments. All things considered, there are some encouraging advantages to this new method of staff scheduling for businesses of all kinds.

关键词： Productivity scheduling algorithms Soft sensors Scalability Companies Fingerprint recognition scheduling

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task scheduling for Coordinated Truck-Drone Parcel Delivery: A Hybrid Genetic Tabu Algorithm Approach

Dynamic Task Scheduling for Coordinated Truck-Drone Parcel D...

引用

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

来源：评论

学校读者我要写书评

暂无评论

INVAR: Inversion Aware Resource Provisioning and Workload scheduling for Edge Computing

INVAR: Inversion Aware Resource Provisioning and Workload Sc...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Bin Wang David Irwin Prashant Shenoy Don Towsley University of Massachusetts Amherst USA

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Edge computing is emerging as a complementary architecture to cloud computing to address some of its associated issues. One of the major advantages of edge computing is that edge data centers are usually much closer to users compared to traditional cloud data centers. Therefore, it is commonly believed that for developers of latency-sensitive applications, they can effectively reduce the overall end-to-end latency by simply transitioning from a cloud deployment to an edge deployment. However, as recent work has shown, the performance of an edge deployment is vulnerable to a couple of factors which under many practical scenarios can lead to edge servers providing worse end-to-end response time than cloud servers. This phenomenon is referred to as edge performance inversion. In this paper, we propose resource allocation and workload scheduling algorithms that actively prevent edge performance inversion. Our algorithms, named INVAR, are based on queueing theory results and optimization techniques. Evaluation results show that INVAR can find a near-optimal solution that outperforms the performance of a cloud deployment by an adjustable margin. Simulation results based on production workloads from Akamai data centers show that INVAR can outperform common heuristic-based edge deployment by 11% to 24% in real-world scenarios.

关键词： Cloud computing Data centers scheduling algorithms Simulation Production Servers Resource management

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：