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

8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)

作者： Vijay, Yash Ghita, Bogdan V. Visa Consolidated Support Serv India Private Ltd Bangalore Karnataka India Plymouth Univ Sch Comp Elect & Math Plymouth Devon England

ISBN: (纸本)9781509030385

scheduling in cloud computing is an essential requirement to execute the tasks given as per the requirements. The scheduler orders the tasks according to the steps mentioned under the scheduling algorithms. The scheduling algorithms need to ensure that the cloud is functioning to the optimum efficiency as well as the tasks are given equal weightage. The way of execution of a scheduling algorithm differs from one another and hence a system, if established, to compare these scheduling algorithms will help the cloud service providers to work better and in a more efficient way as per the user requirements. In fact, it is very important to have a standard comparison system amongst the scheduling algorithms, as per now, there is no particular research done to compare and contrast the scheduling algorithm. This paper develops a set of environments and scenarios in order to differentiate the functioning of the scheduling algorithms. The following scheduling algorithms are studied: First Come First Serve, Shortest Job First, Opportunistic Load Balancing, and Generalized Priority Algorithm. They were put to test under the various environment and scenarios and were evaluated based on parameters such as Cost and Makespan. Based on these studies, an intelligent tool was developed which takes in the user preferences, such as the number of jobs, their preference of time metrics and cost metrics and suggests the scheduler about the number of VMs, and the scheduling algorithm which should be used to accommodate the user requirements.

关键词： scheduling algorithms Cloud FCFS Computing SJF

来源：评论

学校读者我要写书评

暂无评论

Novel User scheduling algorithms for Carrier Aggregation System in Heterogeneous Network

Novel User Scheduling Algorithms for Carrier Aggregation Sys...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Lv, Tiejun Liu, Chenchen Gao, Hui Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Minist Educ Key Lab Trustworthy Distributed Comp & Serv Beijing 100876 Peoples R China

ISBN: (纸本)9781509041831

In this paper, the carrier aggregation (CA) is applied to Heterogeneous Networks (HetNets) consisting of a macro base station (MBS) and low-power pico base stations (PBSs). The PBSs are distributed in the outer space of the disk centered at the MBS and the closed-form solution of the radius of the disk is analyzed. In the CA based HetNet, firstly, a practical user association scheme is proposed to classify the users into macrocell user (MUs) and pico-cell users (PUs). Secondly, a PU-centric cooperative transmission strategy is proposed to increase the data rate of PUs. Then, in order to eliminate the cross-tier interference in HetNet, the MUs and PUs schedule different component carriers (CCs) according to different algorithms. For the MUs, an improved simulated annealing (SA) scheduling algorithm is proposed to maximize the sum rate of the MUs. Compared with the existing SA, the inner loop of the proposed SA is redesigned. Consequently, the best value can be obtained more quickly. For PUs, a location information based low-complexity maximize minimum distance (MMD) algorithm is proposed to reduce the interference from PBSs to PUs as much as possible. Overall, an integrated scheme is proposed to improve the performance. At last, numerical results demonstrate the performance of the proposed schemes.

关键词： Interference Schedules scheduling algorithms Base stations Macrocell networks Signal to noise ratio Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Analysis of Practical Frequency Selective scheduling algorithms in LTE Networks

Analysis of Practical Frequency Selective Scheduling Algorit...

引用

IEEE Vehicular Technology Conference

作者： Faris Alfarhan Regis Lerbour Yann Le Helloco Gregory Donnard InfoVista Gatineau Canada and Les Ulis

ISBN: (纸本)9781479944484

The use of orthogonal frequency division multiple access (OFDMA) in Long Term Evolution (LTE) and LTE-Advanced systems facilitates the potential for scheduling cell users on orthogonal time-frequency resource blocks selectively. This paper identifies several frequency selective scheduling (FSS) algorithms and studies their performance and optimality under certain identified constraints in practice. The performance is studied under the limiting factors of cell load, user mobility, the number of users per cell, data traffic characteristics, and the LTE standards constraint of using a single modulation and coding scheme (MCS) across assigned resource blocks. To address the single MCS restriction, a dynamic Proportional Fair (PF) scheduling algorithm is developed to achieve optimal allocation under this constraint. The gain either in signal-to-interference-plus-noise ratio (SINR) or cell throughput achieved from these algorithms is statistically quantified using detailed LTE system level simulations.

关键词： LTE LTE-Advanced Cellular Systems OFDMA Frequency-Selective scheduling algorithms Proportional Fair

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Task scheduling algorithms through Cloudsim

Comparative Study of Task Scheduling Algorithms through Clou...

引用

International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

作者： Ram Pratap Taskeen Zaidi Assistant Professor Department of MCA ShriRamswaroop Memorial Group of Professional Colleges Lucknow India Associate Professor Faculty of Computer Science &Engineering ShriRamswaroopMemorial University Barabanki India

ISBN: (纸本)9781538646939

Delivery of reliable services in cloud environment is a major issue. Reliability may be achieved by implementing the fault tolerance. Due to the abundant growth of traffic and service request on cloud datacenters, balancing the load in cloud environment is one of the serious challenges as failure may occur due to increase in power consumption, node failure, machine failure etc. Therefore there is a need of a policy for balancing the load among the datacenters and various solutions to balance the load have been proposed by researchers. Load distribution is the mechanism of dispersal the load between different nodes based on certain parameters such as underloaded(node) and overloaded (node). In this research article we have discussed the concept of dispersal of load and then perform a comparative analysis of various task-scheduling policies such as First Come First Serve, Shortest Job First and Round Robin on *** simulation results on Cloudsim depicted that RR task-scheduling is much better than the FCFS and SJF whether we are using the Time shared policy or Space shared policy for execution of cloudlet.

关键词： Cloud computing Task analysis Load management Heuristic algorithms Virtual machining scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Extensive Analysis and Survey of Task scheduling algorithms In Cloud Fog Computing

An Extensive Analysis and Survey of Task Scheduling Algorith...

引用

International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES)

作者： Sambeet Patro Sangram Keshari Swain S. Sudheer Mangalampali Department of CSE CUTM Odisha Department of CSE Manipal Institute of Technology Bengaluru

ISBN: (数字)9798331506452

ISBN: (纸本)9798331506469

The paper gives an insight and overview of Cloud Computing, Fog computing and Task scheduling methods. When we require scalable along with on demand access for computing resources while using internet then Cloud Computing comes into the picture. It has the capability to deliver on request, Self-service, wider network access, resource pooling, swift elasticity and deliberate services. Fog computing can processes data at the edge of the network, because of which faster processing and the storage of data nearer to the data sources happens which in fact can enhance the capabilities. In cloud and fog computing environment task scheduling has an essential role as it has the capabilities to optimize the allocation of resources, enhancing the efficiency and it can guarantee the performance in latency-sensitive based applications. Here in this paper various challenges faced are discussed and it describes about variety of algorithms designed to enhance the scheduling efficiency.

关键词： Surveys Cloud computing Processor scheduling scheduling algorithms Soft sensors Metaheuristics Signal processing algorithms Signal processing Edge computing Self-service

来源：评论

学校读者我要写书评

暂无评论

OPS/OBS scheduling algorithms: Incorporating a wavelength conversion cost in the performance analysis

OPS/OBS scheduling algorithms: Incorporating a wavelength co...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Kurt Van Hautegem Wouter Rogiest Herwig Bruneel Department of Telecommunications and Information Processing (TELIN) Ghent University Ghent Belgium

With ever-increasing demands for bandwidth optical packet/burst switching is used to utilise more of the available capacity of optical networks. In current prototypes of optical switches time and wavelength multiplexing are combined to resolve packet contentions by means of Fiber Delay Lines and wavelength converters in the switching elements. Although optical switches have lower energy consumption than their electronic counterparts, it remains substantial. Since wavelength converters contribute significantly to the switches overall energy consumption, they should be used sparingly, rather than continuously. Current scheduling algorithms however do not take the usage of wavelength converters (and the related energy consumption) into account. To this end, we developed and evaluated new cost-based scheduling algorithms, which take both gap and delay into account to schedule an incoming packet. The performance improvement of these algorithms over existing algorithms can be traded off for a significant reduction in up-time of the wavelength converters by introducing a conversion cost in the involved cost function. This is backed by Monte Carlo simulation results, in which the algorithms are applied both in a void-filling and non-void-filling setting. The algorithms are of the same implementation complexity as current algorithms, and thus of immediate value to switch designers.

关键词： scheduling algorithms Delays Optical switches Optical wavelength conversion Schedules Algorithm design and analysis scheduling

来源：评论

学校读者我要写书评

暂无评论

A Feature Based Comparison Study of Big Data scheduling algorithms

A Feature Based Comparison Study of Big Data Scheduling Algo...

引用

International Conference on Computer, Communication and Signal Processing (ICCCSP)

作者： Suja Cherukullapurath Mana Department of Computer Science Sathyabama University Chennai India

Many big data systems are in the rise to handle the high volume of data that need to be stored and processed in the current world scenarios. One of the key features of the big data system is an efficient job scheduling using a robust scheduling algorithm. This paper will do a survey of some of the big data scheduling algorithms in terms of fairness, speed of processing, efficiency etc. This paper describes briefly about how a big data system works and then go deep in to some of the scheduling algorithms used in the big data systems.

关键词： scheduling algorithms Big Data Resource management Task analysis scheduling Delays

来源：评论

学校读者我要写书评

暂无评论

Optimization on Operation Sorting for Hls scheduling algorithms

SSRN

引用

SSRN 2023年

作者： Xiao, Lu Xiao, Zheng Wu, Fan Qin, Yunchuan Li, Kenli College of Computer Science and Electronic Engineering Hunan University Changsha China

High-Level Synthesis (HLS) is a process of designing digital circuit from high-level language descriptions and thus is applied for shorten time to market. Operation scheduling is one of the critical step in HLS. It decides the finally system latency. Since the scheduling problem is NP-hard, most existing scheduling algorithms are heuristic and schedule operations one by one. In this paper, we proved the existence of optimal order under the condition of the most equilibrium state. Next, inspired by the proof process, we propose a resource-constrained list scheduling type algorithm to minimize the latency. We design a new priority function for the classic list scheduling algorithm to determine the scheduling order. Last, we extend our approach to improve the latency-constrained entropy-directed scheduling algorithm by changing the scheduling order. The experimental results show that for resource-constrained scheduling problem, our method can obtain a near-optimal solution while remaining the low time complexity of list scheduling. For latency-constrained scheduling problem, our method reduces about 14.1% resources than the advanced entropy-directed scheduling algorithm. © 2023, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of Joint Relay Placement and scheduling algorithms for Time-Slotted Networks with Half-Duplex Constraints

Design of Joint Relay Placement and Scheduling Algorithms fo...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Harshavardhana Togaleri Gowda Pragya Shah Vineeth Bala Sukumaran Indian Institute of Space Science and Technology (IIST) Thiruvananthapuram India IIST

ISBN: (数字)9781728191270

ISBN: (纸本)9781728191287

Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein all nodes in the network transmit data to a common base station is a common paradigm for such applications. Time slotted networks which support deterministic scheduling, such as 802.15.4e Time Slotted Channel Hopping (TSCH) multiple access (MAC) protocol, are well suited for such applications. In this paper, we consider a joint relay selection and scheduling problem for convergecast on a multihop wireless network using single channel TSCH MAC protocol. The objective of the problem is to reduce both the number of relay nodes required for network connectivity as well as the slot-frame duration for a periodic deterministic convergecast schedule. For tree networks with half-duplex constraints we obtain a lower bound on the minimum slot-frame duration and show that the relay selection and scheduling problem can be decoupled. We propose a heuristic scheduling algorithm which is shown to achieve the above lower bound using simulations. For the NP-hard relay selection problem, we propose a polynomial time relay selection algorithm with an improved approximation ratio. The performance of our relay selection and scheduling algorithms are studied via simulations on randomly generated graphs.

关键词： Schedules Job shop scheduling scheduling algorithms Wireless networks Spread spectrum communication Media Access Protocol Relays

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of PF, M-LWDF and EXP/PF packet scheduling algorithms in 3GPP LTE downlink

Performance analysis of PF, M-LWDF and EXP/PF packet schedul...

引用

Australasian Telecommunication Networks and Applications Conference, ATNAC

作者： Farhana Afroz Kumbesan Sandrasegaran Pantha Ghosal Iniversity of Technolgoy Sydney Australia

In this paper, the performance of Proportional Fair (PF), Maximum-Largest Weighted Delay First (M-LWDF) and Exponential/Proportional Fair (EXP/PF) packet scheduling algorithms has been investigated in the downlink Long Term Evolution (LTE) system. The performance evaluation is conducted in single cell with interference environment while increasing number of users in the range of 10 to 80 (Case 1) and varying users' speed in the range [3, 120] km/h (Case 2). Results show that in Case 1, M-LWDF outperforms other two algorithms in terms of average throughput, spectral efficiency, packet delay, packet loss ratio (PLR), and fairness index, and in Case 2, the performance of simulated scheduling algorithms drops noticeably with increased users' speed and M-LWDF outperforms other two algorithms in terms of average throughput, spectral efficiency, PLR, and delay.

关键词： Delays scheduling algorithms Throughput Long Term Evolution Downlink Indexes Packet loss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：