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

arXiv 2017年

作者： Aslanidis, Timotheos Birmpilis, Stavros National Technical University of Athens Athens Greece

In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination. However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop scheduling and designed variations of polynomially solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSA's efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results. Copyright © 2017, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Capacity augmentation in energy-efficient vehicular roadside infrastructure

Capacity augmentation in energy-efficient vehicular roadside...

引用

IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)

作者： Naby Nikookaran Terence D. Todd George Karakostas Department of Electrical and Computer Engineering McMaster University Hamilton Ontario CANADA Department of Computing and Software McMaster University Hamilton Ontario CANADA

ISBN: (纸本)9781538611050

This paper considers the problem of capacity augmentation in energy efficient road-side unit (RSU) deployments. RSU placements for a road network, and a set of vehicular traffic flow design traces are used as inputs. The objective is to find an RSU radio capacity assignment that minimizes the long-term operating expenditure costs subject to meeting packet deadline constraints with a given packet loss rate target. A procedure, referred to as the capacity augmentation (CA) algorithm, is proposed that iterates over the RSUs, selecting candidates for capacity augmentation based on their packet loss rate sensitivities. A variety of results are presented that characterize and compare the performance of the CA Algorithm using a greedy online packet scheduler. In particular, we show how to counterbalance the lack of causality in designing the RSU network when it is used for the online scheduling of incoming transmission requests. The comparisons include those using energy-optimal offline scheduling obtained by solving an integer linear program (ILP) formulation. It is shown that the CA Algorithm is an efficient way to assign RSU radio capacity that achieves the desired performance objectives.

关键词： Algorithm design and analysis scheduling algorithms Zirconium Packet loss Shadow mapping Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Metascheduling of HPC jobs in day-ahead electricity markets

arXiv

引用

arXiv 2017年

作者： Murali, Prakash Vadhiyar, Sathish Computer Science Department Princeton University United States Department of Computational and Data Sciences Indian Institute of Science India

High performance grid computing is a key enabler of large scale collaborative computational science. With the promise of exascale computing, high performance grid systems are expected to incur electricity bills that grow super-linearly over time. In order to achieve cost effectiveness in these systems, it is essential for the scheduling algorithms to exploit electricity price variations, both in space and time, that are prevalent in the dynamic electricity price markets. In this paper, we present a metascheduling algorithm to optimize the placement of jobs in a compute grid which consumes electricity from the day-ahead wholesale market. We formulate the scheduling problem as a Minimum Cost Maximum Flow problem and leverage queue waiting time and electricity price predictions to accurately estimate the cost of job execution at a system. Using trace based simulation with real and synthetic workload traces, and real electricity price data sets, we demonstrate our approach on two currently operational grids, XSEDE and NorduGrid. Our experimental setup collectively constitute more than 433K processors spread across 58 compute systems in 17 geographically distributed locations. Experiments show that our approach simultaneously optimizes the total electricity cost and the average response time of the grid, without being unfair to users of the local batch systems. Copyright © 2017, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of E-MQS scheduler with Mobility in LTE heterogeneous network

Performance evaluation of E-MQS scheduler with Mobility in L...

引用

IEEE International Conference on Communications (ICC)

作者： Duy-Huy Nguyen Hang Nguyen Éric Renault SAMOVAR Université Paris-Saclay

This paper proposes a new scheduling scheme which based on user perception, Channel- and QoS-Aware (known as E-MQS scheduler) for real-time traffics in LTE downlink direction. The proposed scheduling scheme is based on the extension of the E-model and the consideration of Maximum Queue Size (MQS) as a an essential factor for the metric. The proposed scheduling scheme is evaluated in LTE heterogeneous traffic with mobility. The simulation results show that the proposed scheduler not only satisfies QoS requirements of real-time services but also outperforms the Frame Level Scheduler (FLS), Modified Largest Weighted Delay First (M-LWDF) and Exponential/Proportional Fair (EXP/PF) schedulers in terms of delay, cell throughput, Fairness Index (FI) and Spectral Efficiency (SE), especially for Video flow. The proposed scheduler also significantly improves the Packet Loss Rate (PLR) in comparison with the M-LWDF and EXP/PF schedulers for both VoIP and Video flows.

关键词： Delays Real-time systems Long Term Evolution scheduling algorithms Codecs Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Reliable low latency communications in LTE networks

Reliable low latency communications in LTE networks

引用

International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Evgeny Khorov Artem Krasilov Aleksei Malyshev Institute for Information Transmission Problems Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781509050505;9781509050499

A hot topic recently attracted much interest in 3GPP community is ultra reliable low latency communications. While specific protocols for such type of communications are under development, in this paper we evaluate how well we can meet strict quality of service requirements in the current LTE/LTE-Advanced networks. Specifically, we design a new two-step radio resource management algorithm for reliable low latency communications. At the first step, the algorithm forms a high-priority group of users which can be reliably served within the given delay budget. At the second step, the algorithm solves a linear optimization problem and allocates resource blocks to meet quality of service requirements at least for the users from the high-priority group. With simulations, we show that the proposed algorithm outperforms existing ones in terms of goodput, PLR and the number of satisfied users.

关键词： Quality of service Reliability Delays Long Term Evolution Algorithm design and analysis Optimization scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Mapping of Application Workflows in Heterogeneous Computing Environments

Dynamic Mapping of Application Workflows in Heterogeneous Co...

引用

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

作者： Muhammad Qasim Touseef Iqbal Ehsan Ullah Munir Nikos Tziritas Samee U. Khan Laurence T. Yang COMSATS Institute of Information Technology Pakistan COMSATS University Islamabad Islamabad Islamabad PK Chinese Academy of Sciences China North Dakota State University USA St. Francis Xavier University Canada

Performance of a Heterogeneous Computing Environment (HCE) mainly depends on the efficiency of application workflow scheduling algorithms. Achieving high efficiency of application workflow scheduling algorithms in HCE is an NPComplete problem. A novel application workflow scheduling algorithm called Heterogeneous Dynamic List Task scheduling (HDLTS) for HCE is proposed in this paper. The functionality of HDLTS majorly relies on the following three pillars; first, duplicate the entry task only if it helps to reduce the overall application execution time; second, for mapping, consider only those tasks that have all the necessary input conditions to start the execution and find out the heterogeneity of their execution time on the computational resources; third, select the task that has higher execution time heterogeneity, and map it to a resource that takes minimum time to execute the task. The HDLTS task selection and mapping policies dynamically consider the resource utilization and task assignment that makes it more efficient and enables it to produce good quality schedules. The performance of the HDLTS is evaluated against popular list scheduling algorithms on randomly generated application workflows and real world application workflows. Experimental results prove that the HDLTS outperforms well-known list scheduling algorithms, such as in terms of schedule length and efficiency.

关键词： Optimal scheduling scheduling algorithms Dynamic scheduling Heuristic algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

Improved online algorithm for weighted flow time

arXiv

引用

arXiv 2017年

作者： Azar, Yossi Touitou, Noam Tel Aviv University Israel

We discuss one of the most fundamental scheduling problem of processing jobs on a single machine to minimize the weighted flow time (weighted response time). Our main result is a O(log P)-competitive algorithm, where P is the maximum-to-minimum processing time ratio, improving upon the O(log2 P)-competitive algorithm of Chekuri, Khanna and Zhu (STOC 2001). We also design a O(log D)-competitive algorithm, where D is the maximum-to-minimum density ratio of jobs. Finally, we show how to combine these results with the result of Bansal and Dhamdhere (SODA 2003) to achieve a O(log(min(P, D, W)))-competitive algorithm (where W is the maximum-to-minimum weight ratio), without knowing P, D, W in advance. As shown by Bansal and Chan (SODA 2009), no constant-competitive algorithm is achievable for this problem. Copyright © 2017, The Authors. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Frame Level Sharing for DBA Virtualization in Multi-Tenant PONs

Frame Level Sharing for DBA Virtualization in Multi-Tenant P...

引用

International Conference on Optical Network Design and Modelling

作者： Amr Elrasad Marco Ruffini Microwave Photonics Research Laboratory School of Electrical Engineering and Computer Science University of Ottawa Ottawa ON Canada

ISBN: (纸本)9781509040063

The worldwide installation of Fiber-to-the-premises (FTTP) access network solutions is hindered by the high upfront cost of deploying ubiquitous fiber infrastructure. While passive optical networks can provide lower cost compared to point-to-point solutions, their total cost of ownership is still high for most operators to justify a mass scale deployment. Sharing passive optical network (PON) infrastructure has thus been proposed as a solution for network operators to reduce the cost of running FTTP services. In addition, the ability for operators to offer business services (including for example mobile backhaul) in addition to residential services, is crucial to increase the overall PON network revenue. However running services with highly diverse requirements over a physical infrastructure shared among multiple operators (which we now refer to as virtual network operators -VNOs) requires VNOs to have a tight control over PON capacity scheduling. In this paper, we introduce a novel upstream PON capacity sharing algorithm called Frame Level Sharing (FLS). FLS is based on the idea of virtual Dynamic Bandwidth Assignment (vDBA), and allows sharing the upstream frame among multiple VNOs to maximize bandwidth utilization, minimize latency, and provide a high level of service isolation among the VNOs sharing the PON. Our simulation results show that FLS outperforms other benchmark algorithms proposed in the literature.

关键词： Passive optical networks Bandwidth Delays Engines Switches Business scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

HRAS: Hybrid Resource Allocation System for Large-Scale Disasters

HRAS: Hybrid Resource Allocation System for Large-Scale Disa...

引用

International Conference on Information, Communication and Engineering (ICICE)

作者： Rong-Guei Tsai Pei-Hsuan Tsai Institute of Manufacturing Information and System National Cheng Kung University Tainan Taiwan

With the advancement of health care and technology, establishing a highly fast, accurate, and efficient medical system has been an ultimate goal for a country or a government. When a large-scale disaster with dozens of patients or more occurs, it often results in short supply of immediate medical resources to the patients, such as long waiting time for ambulances that causes a patient's death. In this paper, we establish a hybrid resource allocation system to model the problem as a hard real-time problem, and analyze two current scheduling algorithms for real-time system, namely clock driven (e.g. hospital assignment for emergency patients, HAEP) and priority driven (e.g. earliest deadline first, EDF). We further design a medical resource allocation algorithm which aims to reduce the computing time of the system and improve the accuracy of the allocation of medical resources. By making it suitable for large-scale disaster, it is hoped to be adopted by the disaster relief personnel and the government.

关键词： Hospitals Resource management Conferences Real-time systems Injuries scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

NoC power optimization using combined routing algorithms

NoC power optimization using combined routing algorithms

引用

International Conference on Computer and Information Science (ACIS)

作者： Ji Wu Dezun Dong Li Wang NUDT School of Computer Science and Technology Changsha China

ISBN: (纸本)9781509055081

As the development of processors/SoCs (Systemon-Chips), NoC (Network-on-Chip) consumes an increasing fraction of the modern processors/SoCs power. Thus, designing energy-efficient NoC architecture is imperative. Multi-NoC (Multiple Network-on-Chip) behaves well in power gating for reducing leakage power, which constitutes a significant fraction of NoC power. In this paper, we propose CRA, a novel Multi-NoC design with distinct routing algorithms for different subnets. Integrated with a congestion-aware power gating and packet scheduling policy, CRA is able to achieve low power without degrading performance at varying network utilization. Our experimental results show that CRA consumes an average of 15.58% less power than Catnap, the state of the art power efficient Multi-NoC design, and the EDP (energy delay product) is 8.59% lower than Catnap on average.

关键词： Routing scheduling algorithms Logic gates Network-on-chip Computer architecture Algorithm design and analysis Ports (Computers)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：