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

DE-RALBA: dynamic enhanced resource aware load balancing algorithm for cloud computing

PEERJ COMPUTER SCIENCE 2025年 11卷 e2739-e2739页

作者： Hussain, Altaf Aleem, Muhammad Rehman, Atiq Ur Arshad, Umer Inst Space Technol Dept Comp Sci KICSIT Campus Islamabad Pakistan Coventry Univ Sch Comp Math & Data Sci London England Univ Cent Punjab UCP Fac Informat Technol Dept Comp Sci Lahore Pakistan

Cloud computing provides an opportunity to gain access to the large-scale and high-speed resources without establishing your own computing infrastructure for executing the high-performance computing (HPC) applications. Cloud has the computing resources (i.e., computation power, storage, operating system, network, and database etc.) as a public utility and provides services to the end users on a pay-as-you-go model. From past several years, the efficient utilization of resources on a compute cloud has become a prime interest for the scientific community. One of the key reasons behind inefficient resource utilization is the imbalance distribution of workload while executing the HPC applications in a heterogenous computing environment. The static scheduling technique usually produces lower resource utilization and higher makespan, while the dynamic scheduling achieves better resource utilization and load-balancing by incorporating a dynamic resource pool. The dynamic techniques lead to increased overhead by requiring a continuous system monitoring, job requirement assessments and real-time allocation decisions. This additional load has the potential to impact the performance and responsiveness on computing system. In this article, a dynamic enhanced resource-aware load balancing algorithm (DE-RALBA) is proposed to mitigate the load-imbalance in job scheduling by considering the computing capabilities of all VMs in cloud computing. The empirical assessments are performed on CloudSim simulator using instances of two scientific benchmark datasets (i.e., heterogeneous computing scheduling problems (HCSP) instances and Google Cloud Jobs (GoCJ) dataset). The obtained results revealed that the DE-RALBA mitigates the load imbalance and provides a significant improvement in terms of makespan and resource utilization against existing algorithms, namely PSSLB, PSSELB, Dynamic MaxMin, and DRALBA. Using HCSP instances, the DE-RALBA algorithm achieves up to 52.35% improved resources

关键词： Cloud computing Load balancing scheduling algorithm Resource-aware scheduling Resource-aware load balancing Dynamic scheduling Dynamic load balancing Distributed computing DE-RALBA

来源：评论

学校读者我要写书评

暂无评论

Elevating manufacturing excellence with multilevel optimization in smart factory cloud computing using hybrid model

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2025年第5期28卷 1-25页

作者： Vaidya, Saurabh Jethava, Gordhan Parul Univ Parul Inst Engn & Technol Dept Comp Sci & Engn FET Vadodara 391760 Gujarat India Parul Univ Parul Inst Engn & Technol Dept Informat Technol FET Vadodara 391760 Gujarat India

The factory has adopted an extensive ecosystem of connected devices and IoT sensors, utilizing cloud computing for real-time decision-making. Secure cloud storage serves as the backbone, managing vast datasets and enabling centralized control. By leveraging advanced analytics and machine learning on the cloud, the factory has implemented predictive maintenance, minimizing downtime and optimizing production. The integration of Hybrid PSO-GA for machines and supply chain processes streamlines operations, allowing for remote monitoring and control to enhance operational agility. Cutting-edge advancements in New Generation Information Technologies (New IT) are crucial in driving the evolution of smart manufacturing. The proliferation of Internet-connected devices in these environments generates substantial data throughout the product lifecycle. Adopting a cloud-based smart manufacturing strategy provides numerous services and applications for analysing massive datasets and fostering significant cooperation in manufacturing operations. However, challenges such as latency, bandwidth congestion, and network unavailability hinder its effectiveness for real-time applications requiring fast, low-latency performance. These issues are efficiently addressed by integrating cloud computing with edge computing, extending the cloud's capabilities to the edge. This paper presents a hierarchical reference architecture for smart manufacturing, leveraging cloud computing. The proposed approach employs a hybrid PSO-GA scheduling function that combines Particle Swarm Optimization (PSO) and Genetic algorithm (GA) to optimize task start times and reduce latency. The optimal solution from this hybrid approach updates task start times, with subsequent scheduling performed using a selected algorithm. The proposed novel hybrid PSO-GA model integrates AI-driven optimization, IoT, and digital twins to enhance real-time decision-making and adapt to dynamic data streams in smart manufacturing. Its

关键词： Fog computing Latency optimisation Smart factory Industry 4.0 scheduling algorithm Computational offloading Industrial IoT Energy consumption

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a novel downlink scheduling algorithm for LTE systems

Performance analysis of a novel downlink scheduling algorith...

引用

International Conference on Advanced Networking Distributed Systems and Applications (INDS)

作者： Escheikh, Mohamed Jouini, Hana Barkaoui, Kamel ENIT SYSCOM Tunis Tunisia CNAM CEDRIC Paris France

ISBN: (纸本)9781479951789

Integration of efficient scheduling policies in radio resource management (RRM) strategies is nowadays, of a paramount importance for the success deployment of wireless Long Term Evolution (LTE) systems. This is particularly effective for downlink where data rates are important and where scheduling decision should enable to allocate, in each Transmission Time Interval (TTI), appropriate resource blocks (RBs) to each mobile user equipment (UE) taking into account several criteria such as channel quality and fairness requirements. In this paper we propose a novel packet scheduling algorithm developed for downlink LTE systems and we investigate its performances compared to three existing scheduling algorithms i.e. Time and Frequency Domain Round Robin (FDRR) Downlink, Best CQI and MY_SCH_Not_Fair [1]. Performance analysis of these algorithms is investigated by simulation of different scenarios in order to evaluate and compare several metrics such as global cell throughput, achievable user throughput and the number of served users. Numerical results show that the implementation of our new proposed algorithm provides significant improvements of the overall system capacity. The main contribution of this algorithm is to enable a better tradeoff between throughput and fairness compared to the above algorithms.

关键词： LTE, Downlink scheduling CQI (Channel quality indicator) scheduling algorithm Spectral efficiency Fairness Throughput

来源：评论

学校读者我要写书评

暂无评论

The Research of Response Time and scheduling algorithm in the TTCAN Bus Control Networks 3

The Research of Response Time and Scheduling Algorithm in th...

引用

3rd International Conference on Mechatronics and Control Engineering (ICMCE)

作者： Wang, Li Ming Yan, Xiao-ling Naval Engn Univ Wuhan Peoples R China

ISBN: (纸本)9783038352914

By analyzing the priority arbitration bit by bit without destroy in can bus rule, the article elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority's messages will be much more delayed, even lose some data when the bus's bandwidth is widely used and scheduling can't be modified during the system. The dynamic priority promoting method and math model of SQSA and SQMA is achieved in the article, it analyses the model's rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, It is validated that the method of improved dynamic in the article has good performances on the network rate of taking in and sending out in large quantities, the average delay and the rate of network usage by emulational experiments.

关键词： TTCAN scheduling algorithm Time Triggered Event Triggered Cost Function Mathematics Expectation

来源：评论

学校读者我要写书评

暂无评论

Power Savings in USB Hubs Through A Proactive scheduling Strategy 24

Power Savings in USB Hubs Through A Proactive Scheduling Str...

引用

24th International Symposium on Quality Electronic Design (ISQED)

作者： Das Sharma, Bikrant Ismail, Abdul Rahman Meyers, Chris Rice Univ Dept Comp Sci Houston TX USA Intel Corp CTO USB Implementers Forum Hillsboro OR USA Fresco Logic Hillsboro OR USA

ISBN: (纸本)9798350334753

USB has been the dominant external I/O in computing systems over the past two decades. With the increased adoption of USB-C with high data rates, USB hubs are becoming more popular. Existing power-saving mechanisms do not save much power in USB hubs when there is a steady bandwidth demand from devices. In this paper, we demonstrate significant power savings with a proactive scheduling policy for hubs. Our approach includes the introduction of a shallow U1/CL1 low-power state, resulting in better overall power savings due to the reduced entry and exit times to U1/CL1. Our results demonstrate power savings of tens of watts by increasing the scheduling interval up to the minimum latency tolerance across all devices connected to that hub. As USB moves to USB4 and hubs are used to connect to higher bandwidth devices, these power savings will become even more pronounced.

关键词： USB Hubs scheduling algorithm USB4 I/O Power Savings

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for Bandwidth Aggregation in Heterogeneous Wireless Network

A Scheduling Algorithm for Bandwidth Aggregation in Heteroge...

引用

International Conference on Informatics, Electronics and Vision (ICIEV)

作者： Masud, M. H. Latif, S. A. Alam, F. Anwar M. K. Int Islamic Univ Malaysia Dept Elect & Comp Engn Kuala Lumpur Malaysia

ISBN: (纸本)9781479951802

Next generation wireless communication systems are being devised with the vision of heterogeneity where multiple wireless technologies are co-existing. Bandwidth is one of wireless resources that can be aggregated among the available technologies in a particular area. Bandwidth aggregation has been considered one of the effective solutions for high bandwidth required applications in Heterogeneous Wireless Network (HWN). However, the selection of Radio Access Technology (RAT) for aggregation in HWN is a great challenge. This paper proposes a scheduling algorithm for RAT selection in HWN for bandwidth aggregation. It is expected that the proposed algorithm can select the minimum set of RAT from the available RATs based on the required application's demand that will improve the throughput and utilizes the wireless resources.

关键词： bandwidth aggregation scheduling algorithm Heterogeneous Wireless Network (HWN) Radio Access Technology (RAT) wireless resources

来源：评论

学校读者我要写书评

暂无评论

Hybrid scheduling algorithm for Packet Switch Architecture

Hybrid Scheduling Algorithm for Packet Switch Architecture

引用

International Conference on Information Science, Electronics and Electrical Engineering (ISEEE)

作者： Yan, Fangfang Lee, Tony T. Ye, Tong Hu, Weisheng Shanghai Jiao Tong Univ State Key Lab Adv Opt Commun Syst & Network Shanghai 200030 Peoples R China

ISBN: (纸本)9781479931972

Using maximum weight matching algorithm, the crossbar switch with VOQ is proven to be stable and can achieve 100% throughput even under non-uniform traffic pattern. However, maximum weight matching has a high complexity of order O(N-3) that is not scalable to fast line rates, neither to high port counts. The scheduling based on Birkhoff-von Neumann decomposition of traffic matrices completely eliminates online computation, which provides a promising solution to the scalability of packet switches. The BvN switch can provide predictive performance under smooth input traffic;however, its performance deteriorates with increasing traffic burstiness. We propose a hybrid scheduling scheme, which combines BvN and maximum weight matching. The hybrid scheduling scheme is proven to be stable with constant shares of MWM and BvN patterns in a cycle. As a variant of the hybrid scheme, we also propose a competitive scheduling algorithm which adjusts shares of MWM and BvN automatically with O(N) online computation. According to simulation results, the hybrid scheme with the competitive scheduling algorithm is burst-tolerant;it can serve as a compromise between computation complexity and switch performance in the face of bursty input traffic.

关键词： packet switch scheduling algorithm delay throughput

来源：评论

学校读者我要写书评

暂无评论

RECO: On-Demand Recharging and Data Collection for Wireless Rechargeable Sensor Networks

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2023年第4期7卷 1863-1876页

作者： Wedaj, Fisseha Teju Hawbani, Ammar Wang, Xingfu Qaisar, Muhammad Umar Farooq Othman, Wajdy Alsamhi, Saeed Hamood Zhao, Liang Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230026 Anhui Peoples R China Univ Sci & Technol China USTC Sch Comp Sci & Technol SCST Hefei 230026 Anhui Peoples R China Shenyang Aerosp Univ Sch Comp Sci Shenyang 110136 Peoples R China Southern Univ Sci & Technol Dept Elect & Elect Engn Shenzhen 518055 Peoples R China Anhui Univ Sch Comp Sci & Technol Hefei 230093 Anhui Peoples R China Univ Galway Insight Ctr Data Analyt Galway H91 TK33 Ireland IBB Univ Fac Engn Ibb Yemen

The emerging Wireless Energy Transfer (WET) is a promising technology that has the potential to thwart the energy limitation challenge in the field of the Internet of Things (IoT) and Wireless Sensor Networks (WSNs). WET-enabled WSNs are known as Wireless Rechargeable Sensor Networks (WRSNs). Over the last decade, various solutions have been suggested to minimize energy consumption and data delivery latency in WSNs. Among them, employing a mobile data collector has proven to be the most efficient solution. Motivated by this fact, we propose an on-demand recharging and data collection scheme called RECO, which employs dual-functioning mobile chargers (MCs) for both operations. RECO includes three essential procedures. 1) It clusters the network into multiple regions and defines two nonoverlapping itineraries on each partition;2) It designs an efficient scheduling algorithm based on an Adapted Graham-Scan algorithm (A-GSA);and 3) It defines anchor points to integrate the recharging and data dissemination processes. RECO is ideal for data delivery delay non-tolerant applications that were ignored by prior periodic recharging and data collection schemes. The experimental results demonstrate that RECO outperforms benchmarks regarding recharging and data collection efficiency.

关键词： Wireless sensor network wireless power transfer wireless energy transfer wireless rechargeable sensor network recharging scheme scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficient scheduling algorithm of non-preemptive independent tasks for biomedical systems 12

An efficient scheduling algorithm of non-preemptive independ...

引用

12th IEEE International New Circuits and Systems Conference (IEEE NEWCAS)

作者： Andrei, Stefan Cheng, Albert M. K. Radulescu, Vlad Lamar Univ Dept Comp Sci Beaumont TX 77710 USA Univ Houston Dept Comp Sci Houston TX 77204 USA Cuza Univ Iasi Dept Comp Sci Iasi Romania

ISBN: (纸本)9781479948857

Given a task set 'T, finding a feasible schedule for 'T is one of the most significant problems of real-time embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and multiprocessor platforms. Biomedical systems are increasingly controlled by computers. The present paper describes an efficient algorithm for getting a feasible schedule of a task set 'T. Our new algorithm is applicable to biomedical systems and it is able to find a feasible schedule even when the traditional EDF and LLF scheduling techniques are not able to find one.

关键词： scheduling problem multiprocessor platform biomedical systems scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

New scheduling algorithm for Uplink LTE System

New scheduling algorithm for Uplink LTE System

引用

International Symposium on Networks, Computers and Communications

作者： Khdhir, Radhia Mnif, Kais Kamoun, Lotfi Nuaymi, Loutfi Univ Sfax LETI Lab ENIS Sfax Tunisia Telecom Bretagne RSM Dept Brest France

ISBN: (纸本)9781479958740

In the LTE (Long Term Evolution) System, packet scheduling is considered the most important step of RRM (Radio Resource Management) to have better resource utilization. In this context, we proposed a new Uplink scheduling scheme for LTE networks and compared its performances with other well known algorithms such as the RME (Recursive Maximum Expansion), the RR (Round Robin) and the BCQI (Best-CQI) Uplink scheduler's algorithms. The RR scheduler is characterized by a high fairness, but low data rates at cell level. On the other hand, the RME scheduler is characterized by its low complexity, but poor fairness. Also, the BCQI scheme is characterized by high data rates, but poor fairness. The main goal of our proposed scheme was to use the Tabu method for to schedule and optimize the allocation of a PRBs (Physical Resource Blocks) efficiently between different users. Simulation results show that the newly proposed scheduling algorithm allows a fair distribution of available LTE resources while keeping an high system's throughput.

关键词： LTE network scheduling algorithm Tabu method Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：