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

Analysis of Opportunistic scheduling algorithms in OFDMA Systems in the Presence of Generalized Fading Models

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2012年第8期11卷 2996-3005页

作者： Kalyani, S. Karthik, R. M. Ctr Excellence Wireless Technol Chennai 600113 Tamil Nadu India

Analytical expressions for scheduling gain and spectral efficiency of the proportional fair and maximum rate scheduling algorithms for Orthogonal Frequency Division Multiple Access (OFDMA) based systems are derived for the following cases: a) multipath Rayleigh and multipath Nakagami fading, b) Composite channel models which model the combined effect of both small scale and large scale fading. It is shown using Extreme Value Theory (EVT) that the asymptotic distribution of the maxima of the received signal to noise power (SNR) across all the users converges to a Gumbel distribution for both cases. Therefore, we use the Gumbel distribution to derive expressions for both the spectral efficiency and scheduling gain. The scheduling gains obtained through numerical integration (whenever tractable) and simulations match with the analytical values obtained using the EVT based expressions. We also discuss how the moments and order statistics of the Gumbel distribution can be used to study other metrics of the scheduling algorithms.

关键词： Composite fading models scheduling algorithms extreme value theory Gumbel distribution OFDM systems

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2007年第1期25卷 146-154页

作者： Chan, Jonathan S. K. Li, Victor O. K. Lui, King-Shan Univ Hong Kong Dept Elect & Elect Engn Pokfulam Hong Kong Peoples R China

Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc. However, little attention has been paid to investigate the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We develop several algorithms to solve the problem and study their performance. We deduce a theoretical bound on the minimum download time experienced by users and also perform simulations to evaluate our algorithms. Simulation results show that our graph-based dynamically weighted maximum-flow algorithm outperforms all other algorithms. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications.

关键词： Peer-to-Peer P2P file sharing data distribution scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

MODELING AND EVALUATING THE FEASIBILITY OF TIMING CONSTRAINTS UNDER DIFFERENT REAL-TIME scheduling algorithms

引用

REAL-TIME SYSTEMS 1992年第4期4卷 287-306页

作者： BERRYMAN, S SOMMERVILLE, I 1. Computing Department Lancaster University LA1 4YR Lancaster UK

The objective of the work described here is to provide a software tool to assist real-time system specifiers and designers to predict, at an early stage of the development process, the timing behavior of the system being developed. The timing behavior of the system is dependent on the scheduler which is the central component of any real-time system. Our tool (Simulation of Real-Time systems (SRT)) is used to model the timing aspects of a real-time system and to simulate the system with a particular scheduling policy so as to predict its behavior. This paper will present an overview of the capabilities of the system which is implemented using an object-oriented programming language (Smalltalk-80).

关键词： Software Tools Time constraints time characteristic time system scheduling algorithms real-time systems PROCESS DEVELOPMENT Object oriented programming languages scheduler program timing sequence Modeling

来源：评论

学校读者我要写书评

暂无评论

Adaptive Evaluation of Virtual Machine Placement and Migration scheduling algorithms Using Stochastic Petri Nets

引用

IEEE ACCESS 2019年 7卷 79810-79824页

作者： Liu, Ying Wang, Ke Ge, Liang Ye, Lei Cheng, Jingde Northeastern Univ Software Coll Shenyang 110619 Liaoning Peoples R China PLA Acad Mil Sci Beijing 100091 Peoples R China Zhejiang Univ Technol Coll Comp Sci & Technol Hangzhou 310000 Zhejiang Peoples R China Saitama Univ Dept Informat & Comp Sci Saitama 3388570 Japan

More and more mobile applications rely on the combination of both mobile and cloud computing technology to bring out their full potential. The cloud is usually used for providing additional computing resources that cannot be handled efficiently by the mobile devices. Cloud usage, however, results in several challenges related to the management of virtualized resources. A large number of scheduling algorithms are proposed to balance between performance and cost of data center. Due to huge cost and time consuming of measure-based and simulation method, this paper proposes an adaptive method to evaluate scheduling algorithms. In this method, the virtual machine placement and migration process are modeled by using Stochastic Reward Nets. Different scheduling methods are described as reward functions to perform the adaptive evaluation. Two types of performance metrics are also discussed: one is about quality of service, such as system availability, mean waiting time, and mean service time, and the other is the cost of runtime, such as energy consumption and cost of migration. Compared to a simulation method, the analysis model in this paper only modifies the reward function for different scheduling algorithms and does not need to reconstruct the process. The numeric results suggest that it also has a good accuracy and can quantify the infiuence of scheduling algorithms on both quality of service and cost of runtime.

关键词： Adaptive evaluation virtual machine placement and migration scheduling algorithms stochastic reward net

来源：评论

学校读者我要写书评

暂无评论

Classification Framework of MapReduce scheduling algorithms

引用

ACM COMPUTING SURVEYS 2015年第3期47卷 1-38页

作者： Tiwari, Nidhi Sarkar, Santonu Bellur, Umesh Indrawan, Maria Infosys Ltd Bangalore 560100 Karnataka India IITB Monash Res Acad Bombay Maharashtra India BITS Pilani Comp Sci & Informat Syst Sancoale 403726 Goa India Indian Inst Technol Dept Comp Sci & Engn Bombay 400076 Maharashtra India Monash Univ Clayton Vic 3800 Australia

A MapReduce scheduling algorithm plays a critical role in managing large clusters of hardware nodes and meeting multiple quality requirements by controlling the order and distribution of users, jobs, and tasks execution. A comprehensive and structured survey of the scheduling algorithms proposed so far is presented here using a novel multidimensional classification framework. These dimensions are (i) meeting quality requirements, (ii) scheduling entities, and (iii) adapting to dynamic environments;each dimension has its own taxonomy. An empirical evaluation framework for these algorithms is recommended. This survey identifies various open issues and directions for future research.

关键词： MapReduce scheduling algorithms Analysis Distributed computing distributed data scheduling MapReduce big-data Hadoop

来源：评论

学校读者我要写书评

暂无评论

Layer Dependency-Aware Learning scheduling algorithms for Containers in Mobile Edge Computing

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2023年第6期22卷 3444-3459页

作者： Tang, Zhiqing Lou, Jiong Jia, Weijia Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Beijing Normal Univ BNUZhuhai AI Res Inst Zhuhai 519087 Guangdong Peoples R China BNU HKBU United Int Coll Guangdong Key Lab AI & Multimodal Data Proc Zhuhai 519087 Guangdong Peoples R China Beijing Normal Univ BNU Zhuhai BNU UIC Inst Artificial Intelligence & Future Netw Zhuhai 519087 Guangdong Peoples R China

Due to the features of lightweight and easy deployment, the use of containers has emerged as a promising approach for Mobile Edge Computing (MEC). Before running the container, an image composed of several layers must exist locally. However, it has been conspicuously neglected by existing work that task scheduling at the granularity of the layer instead of the image can significantly reduce the task completion time to further meet the real-time requirement and resource efficiency in resource-limited MEC. To bridge the gap, considering the complex dependency between layers and images, a novel layer dependency-aware container scheduling algorithm is proposed to reduce the total task completion time. Specifically: 1) We model the online layer dependency-aware scheduling problem for containers in a heterogeneous MEC, considering the layer download time and task computation time. 2) A policy gradient algorithm is proposed to solve this problem, and the high-dimensional and low-dimensional relations for layer dependencies are extracted with improved action selection. 3) Experiments based on the real-world data trace show that the proposed algorithm outperforms the image-based and layer-based baseline algorithms by 54% and 19% on average, respectively.

关键词： Task analysis Containers Image edge detection scheduling Feature extraction Heuristic algorithms scheduling algorithms Mobile edge computing dependency-aware scheduling container reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Offline and Online scheduling algorithms for Energy Harvesting RSUs in VANETs

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第7期67卷 6370-6382页

作者： Atoui, Wassim Sellil Ajib, Wessam Boukadoum, Mounir Univ Quebec Montreal Dept Comp Sci Montreal PQ H2L 2C4 Canada

Using renewable energy to power roadside units (RSUs) in vehicular ad hoc networks is a desirable green alternative to the conventional electric grid, since it lowers both the carbon footprint and the cost of deployment. This paper investigates the problem of scheduling the downlink communication from renewable energy-powered RSUs toward vehicles, with the objective of maximizing the number of served vehicles. First, an offline setting is considered where the RSUs are assumed to have advance knowledge of the incoming communication requests from vehicles and of the amount of energy to be harvested. The problem is formulated as an integer linear programming model that is shown to be NP-hard and two near-optimal solutions are proposed. The first one is a greedy heuristic that prioritizes communications based on their energy cost and the second is the particle swarm optimization metaheuristic. Then, the problem is considered in an online setting and two different solution approaches are investigated. The first one assumes distributed scheduling control between RSUs and two algorithms are proposed, one based on a stochastic model and the other on simple threshold-based selection of communication requests. The second approach assumes centralized scheduling and two algorithms are also investigated. The first one uses a greedy approach and the second one uses threshold-based selection again. Simulations compare the proposed schedulers and show their efficiency in terms of the number of vehicles served and the service delay. It is concluded that employing energy harvesting RSUs is a viable green alternative to grid-powered ones.

关键词： VANETs energy harvesting road side units scheduling scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of scheduling algorithms in network mobility environment

引用

COMPUTER COMMUNICATIONS 2008年第9期31卷 1727-1738页

作者： Wang, Yaning Fan, Linghang He, Dan Tafazolli, Rahim Univ Surrey Ctr Commun Syst Res Guildford GU2 5XH Surrey England

Network mobility (NEMO) supports a network moving as a whole, and this may cause the bandwidth on its wireless link varying with time and locations. The quick and frequent bandwidth fluctuation makes the resource reservation and admission control lack of scalability but with heavy overhead. A feasible solution for this problem is using scheduling algorithms to optimise the resource distribution based on the varying available bandwidth. In this paper, the performance comparison of several well-known priority queue (PQ) and fair queue (FQ) scheduling algorithms are given and their advantages and disadvantages in the NEMO environment are analysed. Moreover, a novel scheduling algorithm, named adaptive rotating priority queue (ARPQ), is proposed to avoid the problems of the existing algorithms. ARPQ operates with a "priority first, fairness second" policy and guarantees the delay bounds for the flows with higher priorities and maintain the reasonable throughput for the flows with lower priorities. The simulation results show that ARPQ outperforms all the existing scheduling algorithms in mobile networks, whose capacities are time-varying and location-dependent. (C) 2007 Elsevier B.V. All rights reserved.

关键词： scheduling algorithms network mobility

来源：评论

学校读者我要写书评

暂无评论

A performance study of downlink scheduling algorithms in wireless broadband networks

引用

Journal of Communications 2014年第1期9卷 39-47页

作者： Wee, Kuokkwee Muhd. Hilmi, B.A.H. Wee, Yit Yin Saed, Nima Multimedia University Melaka Malaysia

IEEE 802.16 is also known as WiMAX was developed to produce high performance in Broadband Wireless Access (BWA) systems with a lower deployment cost than wired broadband services. Like other broadband services, IEEE 802.16 is designed to support applications such as Voice over IP (VoIP), video streaming, video conferencing and online gaming. In IEEE 802.16 standard, five types of service classes have been formed to cater the Quality of Service (QoS) needs for different applications. However, the standard does not state any specific scheduling algorithms for either uplink or downlink transmission. Therefore, scheduling algorithm implementations are depending on the vendors, service providers and researchers. In our presented work, an analysis of various available scheduling algorithms in wireless environment has been carried out. Upon the literature study and analysis, Round Robin (RR), Strict Priority (SP), Self-Clock Fair (SC) and Weighted Fair Queuing (WFQ) were tested in downlink scheduling. For each scheduling algorithm, two scenarios were created, 1) 64QAM and 2) the combination of 16QAM & 64QAM. Simulation results indicate that all the schedulers were struggling to perform as the number of Subscriber Station (SS) increases. Furthermore, the impact on having bad quality channel, which is 16QAM, is also one of the reasons that produces poor performance among all the schedulers. Hence, the traditional schedulers are not suitable for the uncertainty condition in wireless environment because they do not satisfy the QoS demand in WiMAX. © 2014 Engineering and Technology Publishing.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Practical scheduling algorithms With Contiguous Resource Allocation for Next-Generation Wireless Systems

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2021年第4期10卷 725-729页

作者： Sun, Shu Moon, Sungho Intel Corp Next Generat & Stand Grp Santa Clara CA 95054 USA

This letter proposes three novel resource and user scheduling algorithms with contiguous frequency-domain resource allocation (FDRA) for wireless communications systems. The first proposed algorithm jointly schedules users and resources selected adaptively from both ends of the bandwidth part (BWP), while the second and third ones apply disjoint user and resource selection with either single-end or dual-end BWP strategies. Distinct from existing contiguous FDRA approaches, the proposed schemes comply with standards specifications for fifth-generation (5G) and beyond 5G communications, and have lower computational complexity hence are more practical. Simulation results show that all of the proposed algorithms can achieve near-optimal performance in terms of throughput and packet loss rate for low to moderate traffic load, and the first one can still perform relatively well even with a large number of users.

关键词： Resource management scheduling Quality of service scheduling algorithms Delays 5G mobile communication Throughput Beyond 5G (B5G) quality of service (QoS) frequency-domain resource allocation (FDRA) scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：