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

International Conference on Emerging Trends in Engineering, Technology and Science (ICETETS)

作者： M N Kavyasri B. Ramesh Dept. of CS & E Malnad College of Engineering Hassan

ISBN: (纸本)9781467367264

Cloud computing is an emerging technology and serves as next generation platform, which allows the user to pay as they use. It permits access to remote and geographically distributed resources with the help of an important feature in cloud computing called virtualization. Cloud consists of number of virtual machines. In cloud there is need of number of virtual machines (VM) based on the requirement of user and cloud service providers. scheduling is necessary to manage large number of VM requests. scheduling is key technology in cloud computing, scheduling of tasks and resource allocation is challenging task in cloud. So we require scheduling algorithm. Primary consideration of scheduling algorithm is to provide proficiency to task and resource scheduling. Main objective of the paper is to give comparative analysis of existing scheduling algorithm in cloud platform where resources have varying cost and computational efficiency. In this paper we have surveyed on different types of scheduling algorithm and tabulated their various parameters, scheduling factors and so on.

关键词： Cloud computing scheduling scheduling algorithms Resource management Virtual machining Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Resource scheduling algorithms for Satellite Earth Stations

Research on Resource Scheduling Algorithms for Satellite Ear...

引用

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Chen Shaojun Liu Wansong 63782 People's Liberation Army troops Harbin China

ISBN: (数字)9781728180281

ISBN: (纸本)9781728180298

Resource scheduling has always been a hot and difficult problem in systems engineering and management at home and abroad, and it is also very important in the research of satellite earth station system. Due to the limited resources in the satellite earth station system, the rationality of resource allocation directly affects the overall performance of the multi-satellite system. The resource scheduling problem of satellite earth station is a combinatorial optimization problem based on *** paper summarizes the existing resource scheduling model and scheduling algorithm of satellite earth station system, and provides reference for the further research and development of this field.

关键词： Earth Satellites scheduling algorithms scheduling Resource management Modeling Space stations

来源：评论

学校读者我要写书评

暂无评论

A theoretical comparison of job scheduling algorithms in cloud computing environment

A theoretical comparison of job scheduling algorithms in clo...

引用

International Conference on Next Generation Computing Technologies (NGCT)

作者： Abhishek Gupta H S Bhadauria Annapurna Singh Jagdish Chandra Patni Department of Computer Science and Engineering GBPEC Pauri India Deunspartment of CIT UPES Dehradun India

ISBN: (纸本)9781467368100

Cloud computing is a dynamic, scalable and payper-use distributed computing model empowering designers to convey applications amid job designation and storage distribution. Cloud computing encourages to impart a pool of virtualized computer resource empowering designers to convey applications amid job designation and storage distribution. The cloud computing mainly aims to give proficient access to remote and geographically distributed resources. As cloud technology is evolving day by day and confronts numerous challenges, one of them being uncovered is scheduling. scheduling is basically a set of constructs constructed to have a controlling hand over the order of work to be performed by a computer system. algorithms are vital to schedule the jobs for execution. Job scheduling algorithms is one of the most challenging hypothetical problems in the cloud computing domain area. Numerous deep investigations have been carried out in the domain of job scheduling of cloud computing. This paper intends to present the performance comparison analysis of various pre-existing job scheduling algorithms considering various parameters. This paper discusses about cloud computing and its constructs in section (i). In section (ii) job scheduling concept in cloud computing has been elaborated. In section (iii) existing algorithms for job scheduling are discussed, and are compared in a tabulated form with respect to various parameters and lastly section (iv) concludes the paper giving brief summary of the work.

关键词： Cloud computing scheduling algorithms Computational modeling Heuristic algorithms scheduling Computers

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Bio-Inspired scheduling algorithms for Cloud Environments

Performance Analysis of Bio-Inspired Scheduling Algorithms f...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ali Al Buhussain Robson E. De Grande Azzedine Boukerche PARADISE Research Lab University of Ottawa Ottawa ON Canada PARADISE Research Lab University of Ottawa Faculty of Medicine Ottawa ON CA

ISBN: (纸本)9781509036837

Cloud computing environments mainly focus on the delivery of resources, platforms, and applications as services to users over the Internet. Cloud promises users access to as many resources as they need, making use of an elastic provisioning of resources. The cloud technology has gained popularity in recent years as the new paradigm in the IT industry. The number of users of Cloud services has been increasing steadily, so the need for efficient task scheduling is crucial for maintaining performance. In this particular case, a scheduler is responsible for assigning tasks to virtual machines efficiently, it is expected to adapt to changes along with defined demand. In this paper, we present a comparative performance study on bio-inspired scheduling algorithms: Ant Colony Optimization (ACO) and Honey Bee Optimization (HBO). A networking scheduling algorithm, Random Biased Sampling, is also evaluated. Those algorithms show the ability of self-managing and adapting to changes in the environment. The experimental results have shown that ACO performs better when computation power is set as the objective, and HBO shows better scheduling when the objective mainly relies on costs.

关键词： Cloud computing scheduling algorithms Optimization Job shop scheduling Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of Round-Robin and Random scheduling algorithms on Sensor Node Activation Towards Latency of Wireless Sensor Network

Analysis of Round-Robin and Random Scheduling Algorithms on ...

引用

International Conference on Information and Communications Technology (ICOIACT)

作者： Ferry Wahyu Wibowo Andi Sunyoto Bayu Setiaji Wihayati Department of Informatics Universitas Amikom Yogyakarta Yogyakarta Indonesia Faculty of Information Technology Satya Wacana Christian University Salatiga Indonesia

ISBN: (数字)9798331536206

ISBN: (纸本)9798331536213

A Wireless Sensor Network (WSN) is a network system consisting of wireless sensor nodes that collect and transmit data. One crucial factor that affects WSN performance is latency, which is the time required to send data to the gateway. High latency can cause data delivery delays, resulting in data becoming irrelevant. At the same time, receiving real-time data quickly is the primary monitoring method. In addition, high latency can cause greater energy consumption because the sensor node device must be active longer. One way to overcome latency is to implement traffic management techniques such as scheduling data delivery or using priority delivery methods, which can reduce congestion and latency. This paper discusses the effect of latency on WSN using scheduling algorithms, namely Round-Robin and Random scheduling. The results were then taken 30 times to obtain a statistical comparison. The results obtained in the experiment received a Round-Robin scheduling algorithm that was superior to the random scheduling algorithm with a mean and standard deviation value of 12.68 and 2.33, respectively.

关键词： Wireless communication Wireless sensor networks scheduling algorithms Logic gates Real-time systems scheduling Delays Standards Monitoring Network systems

来源：评论

学校读者我要写书评

暂无评论

Study and analysis of task scheduling algorithms in clouds based on artificial bee colony

Study and analysis of task scheduling algorithms in clouds b...

引用

International Congress on Technology, Communication and Knowledge (ICTCK)

作者： Elaheh Hallaj Seyyed Reza Kamel Tabbakh Department of Software Engineering Islamic Azad University Neyshabur Iran Department of Software Engineering Islamic Azad University Mashhad Iran

ISBN: (纸本)9781467397636

Task scheduler plays a significant role in cloud computing, since it has a direct effect on cloud performance. As cloud scheduling is known to be an NP-hard problem, swarm intelligence-based techniques are widely used in this paradigm, due to their ability of searching for large scale problem solutions in an efficient manner. This paper, discusses some scheduling algorithms based on artificial bee colony. These algorithms exploit the smartness of bees' behavior to reach an optimal assignment of tasks to resources. An analytical comparison has also been done to briefly show the characteristics and applications of bee colony technique for scheduling in distributed computing area.

关键词： scheduling Virtual machining Cloud computing Algorithm design and analysis Heuristic algorithms scheduling algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Implementation of three scheduling algorithms in the smart grid communications over 4G networks

Implementation of three scheduling algorithms in the smart g...

引用

International Conference on Space Science and Communication (IconSpace)

作者： Ayman Hajjawi Mahamod Ismail Tito Yuwono Department of Electronic Electrical and System Engineering The National University of Malaysia (UKM) Selangor Malaysia Department of Electrical Engineering Universitas Islam Indonesia Yogyakarta Indonesia

The latest 4G wireless technology, Long Term Evolution (LTE), is expected to be a promising wireless network for smart grid communications due to its high data rate and low delay. The needs of real time communications in the smart grid require reliable, confident and well tested wireless networks. scheduling is one of the mechanisms which has a crucial role on the smart grid performance since it is in charge of the bandwidth resource allocation process. However, due to the fact that LTE has not been intended for smart grid communications, the performance of the scheduling algorithms must be optimized and properly tested. This paper aims at evaluating the performance of three scheduling algorithms, namely Frame Level Scheduler, Exponential Rule and Logarithmic Rule algorithms, in the smart grid communications. The evaluation process is based on their performance in the smart grid for three applications (VoIP, video surveillance and metering data) with specific data rate and delay requirements for each application. The results are evaluated in terms of throughput, delay and packet loss ratio.

关键词： Smart grids Delays Real-time systems scheduling algorithms Throughput Long Term Evolution Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Robustness comparison of scheduling algorithms in mapreduce framework

arXiv

引用

arXiv 2020年

作者： Daghighi, Amirali Chen, Jim Q. St. Cloud State University

Parallel computing is the fundamental base for MapReduce framework in Hadoop. A big data is split into small data chunks, where Map task is referred to processing a data chunk. Each data chunk is replicated over three servers in Hadoop for increasing the availability of data and decreasing the probability of data loss. As a result, the three servers that have the Map task stored on their disk are the fastest servers to process them, which are called local servers. All the servers in the same rack as local servers are called rack-local servers that are slower than local servers in processing Map tasks since the data chunk associated with the Map task should be fetched through the top of the rack switch. All the other servers are called remote servers that are the slowest servers for processing a Map task since they need to fetch data from a local server in another rack, so data should be transmitted through at least two top of the rack switches and a core switch. Note that the number of switches in the path of data transfer depends on the internal network structure of data centers. The First-In-First-Out (FIFO) and Hadoop Fair Scheduler (HFS) algorithms do not take the rack structure of data centers into account, so they are known to not be heavy-traffic delay optimal or even throughput optimal. The recent advances on scheduling for data centers considering the rack structure of them and the heterogeneity of servers resulted in the state-of-the-art Balanced-PANDAS algorithm that outperforms the classic MaxWeight algorithm and its derivation, JSQ-MaxWeight algorithm. In both Balanced-PANDAS and MaxWeight algorithms, the processing rate of local, rack-local, and remote servers are assumed to be known. However, with the change of traffic over time in addition to estimation errors of processing rates, it is not realistic to consider the processing rates to be known. In this work, we study the robustness of Balanced-PANDAS and MaxWeight algorithms in Copyright © 2020, The

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity precoding and scheduling algorithms for full-dimension MIMO systems

Reduced complexity precoding and scheduling algorithms for f...

引用

2014 IEEE Global Communications Conference

作者： Yan Xin Young-Han Nam Yang Li Jianzhong Charlie Zhang Samsung Research America Dallas (SRA-D) Richardson TX USA

Full-dimension multiple-input multiple-output (FD-MIMO) systems, in which base stations are equipped with a large number of antennas in a two-dimensional panel, has received considerable attention from academia researchers and industry practitioners. Compared with legacy cellular communication systems, FD-MIMO systems can achieve significantly higher spectral efficiency with high order multi-user MIMO (MU-MIMO) transmissions. However, as high-order MU-MIMO also incurs high precoding and scheduling complexity, it is critical to reduce complexity of these operations in order to realize throughput potential of FD-MIMO systems in practice. In this paper, we propose a reduced complexity algorithm to realize the high performance precoding technique, signal-to-leakage plus noise ratio (SLNR) precoding, and propose an efficient scheduling algorithm to enable high-order MU-MIMO transmissions in FD-MIMO systems. We further demonstrate the effectiveness of the proposed algorithms by using system level simulations.

关键词： Measurement Complexity theory Throughput scheduling algorithms Vectors MIMO Matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

The impact of scheduling algorithms for real-time traffic in the 5G femto-cells network

The impact of scheduling algorithms for real-time traffic in...

引用

International Symposium on Signal, Image, Video and Communications (ISIVC)

作者： Asmae MAMANE M. EL GHAZI S. MAZER M. BEKKALI M. FATTAH M. MAHFOUDI Laboratory for Transmission and Processing of Information USMBA Fez Morocco FPE UMI Meknes Morocco OFPPT Meknes Morocco

ISBN: (纸本)9781538681749;9781538681732

The deployment of femto-cells in fifth-generation (5G) systems is necessary thanks to their advantages in terms of the number of supported users, and the reduction of energy consumption, thus it's promising to adopt this concept to meet the 5G networks' requirements. However, the allocation of resources and the management of traffic while maintaining the quality of service (QoS); constitutes a major challenge in terms of fairness and perceived throughput at the terminal *** this paper, a number of scheduling algorithms planned to be used in 5G, namely the Proportional Fair (PF) algorithm, the Exponential Proportional Fair algorithm (EXP / PF) and the algorithm Maximum Largest Weighted Delay First (MLWDF) are studied and compared in terms of equity (Fairness Index), useful rate (Goodput) and spectral efficiency, at the level of femto-cells in the downward direction.

关键词： 5G mobile communication Spectral efficiency scheduling algorithms Indexes Delays Streaming media Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：