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

Co-scheduling algorithms for high-throughput workload execution

JOURNAL OF scheduling 2016年第6期19卷 627-640页

作者： Aupy, Guillaume Shantharam, Manu Benoit, Anne Robert, Yves Raghavan, Padma ENS Lyon LIP Lyon France Univ Tennessee Knoxville TN USA San Diego Supercomp Ctr La Jolla CA USA Penn State Univ State Coll PA USA

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem, and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to faster workload completion time (40 % improvement on average over traditional scheduling) and to faster response times (50 % improvement). Hence, co-scheduling increases system throughput and saves energy, leading to significant benefits from both the user and system perspectives.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Classification Framework for scheduling algorithms in Wireless Mesh Networks

引用

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS 2013年第1期15卷 199-222页

作者： Gabale, Vijay Raman, Bhaskaran Dutta, Partha Kalyanraman, Shivkumar Indian Inst Technol Dept Comp Sci & Engn Bombay Maharashtra India

scheduling MAC-layer transmissions in multi-hop wireless networks is an active and stimulating area of research. There are several interesting algorithms proposed in the literature in the problem space of scheduling for multi-hop wireless networks, specifically for (a) WiMAX mesh networks, (b) long distance multi-hop WiFi networks, and (c) Vehicular Ad-hoc Networks (VANETs). In general, these algorithms have several dimensions in terms of the assumptions made, the input space considered and the solution space generated. In this context, the goal of this survey is three-fold. Firstly, we classify the scheduling algorithms proposed in the literature based on following parameters: problem setting, problem goal, type of inputs and solution technique. Secondly, we describe different scheduling algorithms based on this classification framework. We specifically cover the state-of-the-art scheduling mechanisms proposed for generic multichannel, multi-radio wireless mesh networks and in particular scheduling algorithms for WiMAX mesh networks, long distance mesh networks and vehicular ad-hoc networks. We describe scheduling algorithms which consider scheduling data, voice as well as video traffic. Finally, we compare these algorithms based on our classification parameters. We also critique individual mechanisms and point out the practicality and the limitations, wherever applicable. We observe that, the literature in the domain of scheduling for wireless mesh network is quite extensive, in terms of depth as well as breadth. Our classification framework helps in understanding the pros and cons of various aspects of scheduling for wireless multi-hop (popularly known as wireless mesh) networks. We also list desirable properties of any scheduling mechanism and use our classification framework to point out the open research issues in the space of scheduling for wireless mesh networks.

关键词： scheduling algorithms wireless mesh networks classification dimensions

来源：评论

学校读者我要写书评

暂无评论

On Some Distributed scheduling algorithms for Wireless Networks With Hypergraph Interference Models

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第5期67卷 2952-2957页

作者： Ganesan, Ashwin INSOFE Educ Private Ltd Int Sch Engn INSOFE Mumbai 400093 Maharashtra India

It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case per... 详细信息

关键词： Interference Admission control scheduling algorithms Schedules Wireless networks scheduling Indexes Hypergraph interference models wireless networks admission control fractional chromatic number upper bounds maximal scheduling distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Cell Edge Throughput Enhancement in V2X Communications Using Graph-Based Advanced Deep Learning scheduling algorithms

引用

IETE JOURNAL OF RESEARCH 2024年第9期70卷 7121-7136页

作者： Reshma, P. Sudha, V. Natl Inst Technol Dept Elect & Commun Engn Tiruchirappalli India

Optimizing downlink coordinated multipoint (CoMP) performance through advanced scheduling algorithms enhances V2X communication technology, enabling efficient resource allocation, minimizing interference, and maximizing data rates for reliable and synchronized communication between vehicles and infrastructure. In this paper, several scheduling algorithms were compared, including support vector machine (SVM) linear, SVM Radial Basis Function (RBF), SVM Sigmoid, Deep Neural Networks (DNN), Convolutional Neural Networks (CNN), and Graph Convolutional Networks (GCN). The performance metrics used in this comparison included CoMP decision, throughput, and cell edge throughput. The results showed that the out-rated GCN algorithm had the best-triggering composition for 5G radio networks, outperforming the other algorithms in terms of CoMP decision accuracy and overall throughput. In particular, the GCN algorithm demonstrated significant improvements in cell edge throughput, which is critical for ensuring reliable communication in areas with weaker signal strength. The reported results proves that the integration of advanced scheduling algorithms in the downlink CoMP framework enhances the efficiency of V2X communication, enabling optimized resource allocation, interference mitigation, and maximized throughput, thereby improving system efficiency, reducing latency, and ensuring reliable and seamless information exchange for connected vehicles, smart cities, and industrial automation.

关键词： Cell edge throughput Coordinated Multipoint (CoMP) Data rates Graph convolutional networks (GCN) Resource allocation scheduling algorithms V2X communication

来源：评论

学校读者我要写书评

暂无评论

On the queue-overflow probabilities of a class of distributed scheduling algorithms

引用

COMPUTER NETWORKS 2011年第1期55卷 343-355页

作者： Zhao, Can Lin, Xiaojun Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47906 USA

In this paper, we are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad hoc wireless networks where each link interferes with a given set of other links, and we focus on a distributed scheduling algorithm called Q-SCHED, which is introduced by Gupta et al. First, we derive a lower bound on the asymptotic decay rate of the queue-overflow probability for Q-SCHED. We then present an upper bound on the decay rate for all possible algorithms operating on the same network. Finally, using these bounds, we are able to conclude that, subject to a given constraint on the asymptotic decay rate of the queue-overflow probability, Q-SCHED can support a provable fraction of the offered loads achievable by any algorithms. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Wireless networks Quality of service Large deviations scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF scheduling algorithms FOR CHANNEL RESERVATION

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1994年第6期141卷 341-346页

作者： HARMS, JJ WONG, JW UNIV WATERLOO DEPT COMP SCIWATERLOO N2L 3G1ONCANADA

The performance of scheduling algorithms for a reservation system is investigated. In this system, a user request is characterised by its start time, resource requirement and holding time. Of interest are scheduling algorithms to handle user requests in a loss system where resource requirements may vary. A Markov decision process formulation is used to obtain the optimal scheduling decisions. Two special cases are considered in depth;they correspond to optimal algorithms that minimise the blocking probability and maximise the channel utilisation, respectively. Analytic results are also obtained for the blocking probability and channel utilisation for an arbitrary scheduling algorithm. Using these results, the performance of first come, first served (FCFS) and the two optimal algorithms is compared. We also prove that FCFS is optimal for maximising channel utilisation when the resource requirement follows a uniform distribution.

关键词： scheduling algorithms CHANNEL RESERVATION

来源：评论

学校读者我要写书评

暂无评论

An overview of scheduling algorithms in wireless multimedia networks

引用

IEEE WIRELESS COMMUNICATIONS 2002年第5期9卷 76-83页

作者： Fattah, H Leung, C Univ British Columbia Vancouver BC V5Z 1M9 Canada

scheduling algorithms are important components in the provision of guaranteed quality of service parameters such as delay, delay jitter, packet loss rate, or throughout. The design of scheduling algorithms for mobile communication networks is especially challenging given the highly variable link error rates and capacities, and the changing mobile station connectivity typically encountered in such networks. This article provides a survey of scheduling techniques for several types of wireless networks. Some of the challenges in designing such schedulers are first discussed. Desirable features and classifications of schedulers are then reviewed. This is followed by a discussion of several scheduling algorithms which have been proposed for TDMA, CDMA, and multihop packet networks.

关键词： code division multiple access delays jitter land mobile radio multimedia communication packet radio networks quality of service radio links time division multiple access CDMA Internet applications QoS TDMA delay delay jitter guaranteed quality of service Jitter network applications Packet radio networks scheduling algorithms Code division multiple access land mobile radio multimedia network time division multiple access Radio links delay Wireless networks Quality of service

来源：评论

学校读者我要写书评

暂无评论

Distributed scheduling algorithms for channel access in TDMA wireless mesh networks

引用

JOURNAL OF SUPERCOMPUTING 2013年第2期63卷 407-430页

作者： Cheng, Hongju Xiong, Naixue Yang, Larence T. Jeong, Young-Sik Fuzhou Univ Dept Comp Sci Fuzhou 350002 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 1C0 Canada Wonkwang Univ Dept Comp Engn Iksan South Korea

In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all their one-hop neighbors in the assigned time-slot(s). And the objective is to minimize the cycle length, i.e., the total number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this problem is proved to be K (2) in arbitrary graphs (IEEE Trans Comput C-36(6):729-737, 1987) and 25K in unit disk graphs (IEEE/ACM Trans Netw pp 166-177, 1993) with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this case, we have proved that the upper bound can be (4K-2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc. And a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize. Simulations are also done to verify the performance of these algorithms.

关键词： scheduling algorithms Time Division Multiple Access (TDMA) Wireless mesh networks Distributed algorithms Channel access

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：