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

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2022年第3期7卷 537-548页

作者： Alinia, Bahram Hajiesmaili, Mohammad H. Lee, Zachary J. Crespi, Noel Mallada, Enrique Telecom SudParis Inst Mines Telecom Dept Networks & Mobile Multimedia Serv RS2M F-91000 Evry France Univ Massachusetts Coll Informat & Comp Sci Amherst MA 01003 USA CALTECH Dept Elect Engn Pasadena CA 91125 USA Johns Hopkins Univ Dept Elect & Comp Engn Baltimore MD 21218 USA

This paper tackles online scheduling of electric vehicles (EVs) in an adaptive charging network (ACN) with local and global peak constraints. Given the aggregate charging demand of the EVs and the peak constraints of the ACN, it might be infeasible to fully charge all the EVs according to their charging demand. Two alternatives in such resource-limited scenarios are to maximize the social welfare by partially charging the EVs (fractional model) or selecting a subset of EVs and fully charge them (integral model). The technical challenge is the need for online solution design since in practical scenarios the scheduler has no or limited information of future arrivals in a time-coupled underlying problem. For the fractional model, we devise both offline and online algorithms. We prove that the offline algorithm is optimal. Using competitive ratio as the performance measure, we prove the online algorithm achieves a competitive ratio of 2. The integral model, however, is more challenging since the underlying problem is strongly NP-hard due to 0/1 selection criteria of EVs. Hence, efficient solution design is challenging even in offline setting. For offline setting, we devise a low-complexity primal-dual scheduling algorithm that achieves a bounded approximation ratio. Built upon the offline approximate algorithm, we propose an online algorithm and analyze its competitive ratio in special cases. Extensive trace-driven experimental results show that the performance of the proposed online algorithms is close to the offline optimum, and outperform the existing solutions.

关键词： Approximation algorithms scheduling Electric vehicle charging scheduling algorithms Adaptive systems Electronic mail Charging stations Electric vehicle online scheduling approximation algorithm competitive analysis

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity scheduling algorithms for Multichannel Downlink Wireless Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2012年第5期20卷 1608-1621页

作者： Bodas, Shreeshankar Shakkottai, Sanjay Ying, Lei Srikant, R. Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

This paper considers the problem of designing scheduling algorithms for multichannel (e.g., OFDM-based) wireless downlink networks, with a large number of users and proportionally large bandwidth. For this system, while the classical MaxWeight algorithm is known to be throughput-optimal, its buffer-overflow performance is very poor (formally, it is shown that it has zero rate function in our setting). To address this, a class of algorithms called iterated Heaviest matching with Longest Queues First (iHLQF) is proposed. The algorithms in this class are shown to be throughput-optimal for a general class of arrival/channel processes, and also rate-function-optimal (i.e., exponentially small buffer overflow probability) for certain arrival/channel processes. iHLQF, however, has higher complexity than MaxWeight (n(4) versus n(2), respectively). To overcome this issue, a new algorithm called Server-Side Greedy (SSG) is proposed. It is shown that SSG is throughput-optimal, results in a much better per-user buffer overflow performance than the MaxWeight algorithm (positive rate function for certain arrival/channel processes), and has a computational complexity (n(2)) that is comparable to the MaxWeight algorithm. Thus, it provides a nice tradeoff between buffer-overflow performance and computational complexity. These results are validated by both analysis and simulations.

关键词： Large deviations low complexity scheduling algorithms small buffer

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Low complexity greedy, genetic and hybrid user scheduling algorithms for multiuser MIMO systems with successive zero-forcing

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2012年第7期23卷 604-617页

作者： Elliott, Robert C. Sigdel, Shreeram Krzymien, Witold A. Univ Alberta Edmonton AB T6G 2V4 Canada TRLabs Edmonton AB Canada

In this paper, we consider low complexity user scheduling algorithms for multiuser multiple-input multiple-output systems employing successive zero-forcing precoding. Optimal scheduling involves an exhaustive search (ES), which is prohibitively complex. Greedy algorithms (GrAs) with heuristic scheduling metrics achieve performance close to that of the ES. Meanwhile, genetic algorithms (GAs) are a rapid suboptimal option of optimising utility (e.g. scheduling) metrics. Herein, we evaluate the performance and complexity of greedy and genetic scheduling algorithms for successive zero-forcing. We also propose and evaluate two hybrid algorithms combining the traits of the GrA and GA. The algorithms' performance is assessed through a series of computer simulations. We demonstrate both the GrA and GA achieve a near-optimal sum rate with low complexity, whereas the hybrid algorithms further enhance the GrA and GA performance without an increase in the order of *** (C) 2012 John Wiley & Sons, Ltd.

关键词： Complexity generally recognized as safe output system scheduling algorithms Gallium multiple input multiple output systems Optimal scheduling greedy method Yeast One/Two-Hybrid System

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：