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

2nd International Conference on Intelligent Engineering and Management, ICIEM 2021

作者： Walia, Navpreet Kaur Kaur, Navdeep Sri Guru Granth Sahib World University Computer Science and Engineering Chandigarh University Punjab India

ISBN: (纸本)9781665414500

Resource Management is continually assuming a significant part in cloud computing, contrasting with other computing paradigms. Due to the accessibility of finite shared resources, it is extremely challenging for cloud providers to accomplish all the solicitations. scheduling algorithm plays an imperative part in the resource management system. The scheduling algorithm is responsible for assigning cloud resources to various tasks errands by users. While assigning the resources, sometimes the resources are under-utilized or over-utilized, which affects the performance of the scheduling algorithms. Some recent surveys endeavor to incorporate the various task scheduling techniques proposed for cloud computing environments, however, on some accounts, it seem to be constrained. Subsequently, this paper gives a thorough description of task scheduling and various task scheduling techniques used in the environment of cloud computing. The paper presents a wide survey of numerous scheduling algorithms with regards to their methods and other significant features. A relative analysis of the surveyed algorithms is also included in the paper for homogeneous and heterogeneous cloud computing environments. Based upon the investigation of numerous task scheduling algorithms cited in the present paper as well as involved in the recently published surveys, a computed view of their applicability is included. It is observed that meta-heuristic scheduling algorithms are used for optimizing the performance of the task scheduling algorithms in cloud computing environments. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating Energy-Aware scheduling algorithms for I/O-Intensive Scientific Workflows 21st

Evaluating Energy-Aware Scheduling Algorithms for I/O-Intens...

引用

21st International Conference on Computational Science, ICCS 2021

作者： Coleman, Tainã Casanova, Henri Gwartney, Ty da Silva, Rafael Ferreira USC Information Sciences Institute Marina del ReyCA United States Information and Computer Sciences University of Hawaii HonoluluHI United States

ISBN: (纸本)9783030779603

Improving energy efficiency has become necessary to enable sustainable computational science. At the same time, scientific workflows are key in facilitating distributed computing in virtually all domain sciences. As data and computational requirements increase, I/O-intensive workflows have become prevalent. In this work, we evaluate the ability of twopopular energy-aware workflow scheduling algorithms to provide effective schedules for this class of workflow applications, that is, schedules that strike a good compromise between workflow execution time and energy consumption. These two algorithms make decisions based on a widely used power consumption model that simply assumes linear correlation to CPU usage. Previous work has shown this model to be inaccurate, in particular for modeling power consumption of I/O-intensive workflow executions, and has proposed an accurate model. We evaluate the effectiveness of the two aforementioned algorithms based on this accurate model. We find that, when making their decisions, these algorithms can underestimate power consumption by up to 360%, which makes it unclear how well these algorithm would fare in practice. To evaluate the benefit of using the more accurate power consumption model in practice, we propose a simple scheduling algorithm that relies on this model to balance the I/O load across the available compute resources. Experimental results show that this algorithm achieves more desirable compromises between energy consumption and workflow execution time than the two popular algorithms. © 2021, Springer Nature Switzerland AG.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy Aware scheduling algorithms for Cloud Environments –A Survey 2

Energy Aware Scheduling Algorithms for Cloud Environments –...

引用

2nd International Conference on Advances in Computing, Communication, Embedded and Secure Systems, ACCESS 2021

作者： Saurav, Sumit Kumar Benedict, Shajulin Indian Institute of Information Technology Kerala Kottayam India

ISBN: (纸本)9781728171364

Energy-aware scheduling algorithms are emerging as important components in economic-conscious heterogeneous computing systems such as IoT-enabled edge, fog, or cloud environments. Most of the IoT applications utilize cloud infrastructure to process information or perform analytics. The design of energy-aware scheduling algorithms for cloud infrastructures is especially challenging given the highly variable state changes of processors and virtual machines, and the changing available compute nodes typically encountered in such infrastructures. In this paper, we have reviewed the merits and demerits of the available energy-efficient scheduling techniques for cloud environments which could be applied for IoT applications. The paper, in addition, discussed a few design challenges for creating an energy-efficient scheduler. © 2021 IEEE

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient vaccine scheduler based on CPU scheduling algorithms 1

Efficient vaccine scheduler based on CPU scheduling algorith...

引用

1st IEEE International Conference on Artificial Intelligence and Machine Vision, AIMV 2021

作者： Gondaliya, Vasu Patel, Shreya Hemnani, Jay Patel, Samir Pandit Deendayal Energy University School of Technology Department of Computer Science and Engineering Gandhinagar India

ISBN: (纸本)9781665442114

This paper presents an efficient algorithm for scheduling vaccination process which is based on the CPU scheduling algorithms of an operating system. Based on a custom-designed scoring system of the given schedule, an analysis of why the first-come, first-served basis of scheduling vaccines is inefficient. The ranking system is based on the concept that health care personnel should be given higher priority, followed by front-line workers, major healthcare patients, elderly people, and finally the general public. This is the category in the dataset, the higher the importance of the person who needs to be vaccinated, the better the score. Different CPU scheduling methods are analyzed based on Arrival Time, Turn Around Time, Waiting Time, and Response Time. We obtain the resultant schedule after providing the dataset, the number of vaccines per day, and the selected algorithm for scheduling, and we get a customized schedule based on the data by entering the Aadhar number. The FCFS and Priority algorithms were compared to visualize the differences in efficiency for both algorithms, as well as an analysis of how many vaccines to choose per day and the related length of schedule in days. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A critical review of workflow scheduling algorithms in cloud computing environment 4

A critical review of workflow scheduling algorithms in cloud...

引用

4th International Conference on Computational Intelligence and Communication Technologies, CCICT 2021

作者： Rupali Mangla, Neeraj MMDU Department of Computer Scienece and Engineering Mullana Haryana Amabla133203 India

ISBN: (纸本)9781665423922

Cloud computing has gained so much of attention due to its features such as pay-per-use basis, resource pooling, and scalability that has forced the professionals to use cloud services for executing various applications. The cloud resources are now used to execute scientific workflow applications, where each task (node) is directed to other task (node) through a path (edge) that represents the flow data from one node to another known as workflows. To map these workflows to cloud resources various workflow scheduling strategies has been adopted based on budget and deadline constraints. In this article we have accomplished a review on existing workflow scheduling algorithms implemented in cloud environment that are capable to reduce cost, makespan, increase resource utilization, etc. under a budget or deadline constraint [1][2]. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Modified Pre-emptive Priority-Based Round Robin scheduling algorithms with Dynamic Time Quantum: MPPBRRACBDQ and MPPBRRALBTDQ 1st

Modified Pre-emptive Priority-Based Round Robin Scheduling A...

引用

1st International Virtual Conference on Industry 4.0, IVCI4.0 2020

作者： Nagarajan, Sudharshan Akhil Krishna, R. Sivagami, M. Maheswari, N. School of Computer Science and Engineering Vellore Institute of Technology Chennai600127 India

ISBN: (纸本)9789811612435

scheduling is an essential part of an operating system. The main aim of scheduling is to schedule jobs and allot them to the CPU in a balanced way. It follows a set of rules to give prioritization to various processes. This would ensure that a system serves all requests and would achieve a certain quality of service with the existing hardware. In this paper, analysis of two Round Robin scheduling algorithms is carried out and modifications are made to improve the two algorithms which result in a quicker completion of the processes. The performance of the proposed algorithms, MPPBRRACBDQ and MPPBRRALBTDQ, is analyzed by comparing with existing well-known algorithms such as FCFS, SJF, PS and RR and also OMDRRS (Goel et al. in Int J Adv Comput Sci Appl 7:216–221, 2016) and improved Round Robin (H. B. Parekh, S. Chaudhari (2016) Improved round robin CPU scheduling algorithm. International Conference on Global Trends in Signal Processing, Information Computing and Communication, 184–187.). In MPPBRRACBDQ, the time quantum is varied dynamically based on the remaining burst time and is multiplied by two, while in MPPBRRALBTDQ, the time quantum is dynamically assigned based on the burst time, i.e., the least burst time among the processes is chosen to be the time quantum. The results prove that the new proposed algorithms perform better than the existing algorithms. Notable improvements are observed in waiting time (WT), turnaround time (TAT) and the number of context switches. The TAT, WT and context switches are compared and graphically represented. This research is an attempt to enhance the efficiency of the scheduling by developing and implementing new scheduling algorithms. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Resource scheduling algorithms for Satellite Earth Stations 5

Research on Resource Scheduling Algorithms for Satellite Ear...

引用

5th IEEE Advanced Information Technology, Electronic and Automation Control Conference, IAEAC 2021

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

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. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Transmit or wait? efficient scheduling algorithms for minimizing latency in power-adjustable wireless sensor network 7

Transmit or wait? efficient scheduling algorithms for minimi...

引用

7th International Conference on Big Data Computing and Communications, BigCom 2021

作者： Chen, Xi Cheng, Siyao Li, Feng Liu, Jie Harbin Institute of Technology School of Computer Science and Tech China

ISBN: (纸本)9781665442527

The appearance of power-adjustable sensors provides an opportunity for latency reduction in Power Adjustable Sensor Network. In wireless network with power-adjustable sensors, the node may prefer to wait rather than to transmit even it has enough energy as it could accumulate more energy to forward message to the wider range in the future. Thus, the problem of how to schedule sensor transmitting has become extremely necessary. However, it was not solved well by existing works since they primarily considered network without power-adjustable sensors. Due to such reasons, new sensor scheduling problems to minimize latency in Power Adjustable Sensor Network were studied in this paper under two typical protocols, which were one-to-one transmission and broadcasting. Followed by sensor scheduling problem definition for each protocol, an optimal and an approximation algorithms have been proposed to solve each separately. The bounds of latency was analyzed in detail as well. Based on theoretical analysis and experimental results, we concluded the proposed algorithms have higher performance as they fully used adjustable powers. © 2021 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

MapReduce scheduling algorithms: a review

引用

JOURNAL OF SUPERCOMPUTING 2020年第7期76卷 4915-4945页

作者： Hashem, Ibrahim Abaker Targio Anuar, Nor Badrul Marjani, Mohsen Ahmed, Ejaz Chiroma, Haruna Firdaus, Ahmad Abdullah, Muhamad Taufik Alotaibi, Faiz Ali, Waleed Kamaleldin Mahmoud Yaqoob, Ibrar Gani, Abdullah Taylors Univ Sch Comp & Informat Technol Subang Jaya 47500 Malaysia Univ Malaya Fac Comp Sci & Informat Technol Kuala Lumpur Malaysia Univ Malaya Ctr Mobile Cloud Comp Res Kuala Lumpur Malaysia Fed Coll Educ Tech Dept Comp Sci Gombe Nigeria Univ Malaysia Pahang Fac Comp Syst & Software Engn Kuantan 26300 Pahang Malaysia Univ Putra Malaysia Fac Comp Sci & Informat Technol Serdang 43400 Selangor Malaysia

Recent trends in big data have shown that the amount of data continues to increase at an exponential rate. This trend has inspired many researchers over the past few years to explore new research direction of studies related to multiple areas of big data. The widespread popularity of big data processing platforms using MapReduce framework is the growing demand to further optimize their performance for various purposes. In particular, enhancing resources and jobs scheduling are becoming critical since they fundamentally determine whether the applications can achieve the performance goals in different use cases. scheduling plays an important role in big data, mainly in reducing the execution time and cost of processing. This paper aims to survey the research undertaken in the field of scheduling in big data platforms. Moreover, this paper analyzed scheduling in MapReduce on two aspects: taxonomy and performance evaluation. The research progress in MapReduce scheduling algorithms is also discussed. The limitations of existing MapReduce scheduling algorithms and exploit future research opportunities are pointed out in the paper for easy identification by researchers. Our study can serve as the benchmark to expert researchers for proposing a novel MapReduce scheduling algorithm. However, for novice researchers, the study can be used as a starting point.

关键词： Big data Hadoop MapReduce Cloud computing scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Examining the developments in scheduling algorithms research: A bibliometric approach

引用

HELIYON 2022年第5期8卷 e09510页

作者： Omotehinwa, Temidayo Oluwatosin Fed Univ Hlth Sci Dept Math & Comp Sci Otukpo Nigeria

This study examined the developments in the field of scheduling algorithms in the last 30 years (1992-2021) to help researchers gain new insight and uncover the emerging areas of growth for further research in this field. This study, therefore, carried out a bibliometric analysis of 12,644 peer-reviewed documents extracted from the Scopus database using the Bibliometrix R package for bibliometric analysis via the Biblioshiny web interface. The results of this study established the development status of the field of scheduling algorithms, the growth rate, and emerging thematic areas for further research, institutions, and country collaborations. It also identified the most impactful and leading authors, keywords, sources, and publications in this field. These findings can help both budding and established researchers to find new research focus and collaboration opportunities and make informed decisions as they research the field of scheduling algorithms and their applications.

关键词： Bibliometric analysis scheduling algorithms Bibliometrix Science mapping Biblioshiny

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：