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

International Symposium on Computer, Consumer and Control (IS3C)

作者： Ji Wu Dezun Dong Li Wang College of Computer NUDT Changsha China

ISBN: (纸本)9781509030729

With the development of multiple processors SoC (system on chip), there are more and more challenges to the design of NoC (network-on-chip), one of which is to design energy-efficient NoC architecture, due to its large power consumption. Multi-NoC (multiple network-on-chip) has been proposed to save leakage power for its advantages in power gating network components. In this paper, we propose a hybrid Multi-NoC design, called HM-Mesh. HM-Mesh adopts a hybrid CMesh and Mesh architecture, and leverages CMesh network to respect its power efficiency at low network utilization. HMMesh is able to adaptively schedule packets to different subnets according to the network load, and smartly perform power gating to achieve good energy efficiency. The experimental results show that HMMesh delivers an average of 4.87% higher performance than Catnap, the state of the art power efficient Multi-NoC design. More importantly, HM-Mesh consumes an average of 29.2% less power than that of Catnap.

关键词： Computer architecture scheduling algorithms Network-on-chip Mesh networks Hybrid power systems Program processors Power demand

来源：评论

学校读者我要写书评

暂无评论

The improved delay scheduling algorithm on Hadoop

The improved delay scheduling algorithm on Hadoop

引用

International Conference on Electronics, InformationTechnology and Intellectualization, EITI 2014

作者： Wang, Su Zhen Cao, Bing Rui Hebei University of Economics and Business Shijiazhuang China

ISBN: (纸本)9781138027411

According to the notion that the existing delay scheduling algorithm is lacking in consideration of the load of nodes, if the assignment data to be processed is set on one or several nodes, it will easily lead to an imbalance of the cluster load. In this paper, the original delay scheduling algorithm is improved. By detecting the load of nodes, the improved algorithm adjusts the waiting time of the job dynamically, and increases the number of copies of hot data block at the same time. The experimental results show that the improved delay scheduling algorithm, to a certain extent, improves the average response time of jobs. © 2015 Taylor & Francis Group, London.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Hour minimization based resource allocation for deadline constrained scientific workflow application in cloud computing

Hour minimization based resource allocation for deadline con...

引用

International Conference on Recent Trends in Information Technology (ICRTIT)

作者： S. K. Jeya Brindha J. Angela Jennifa Sujana T. Revathi Department of IT Mepco Schlenk Engineering College Sivakasi Tamil Nadu India

ISBN: (纸本)9781509004331

Nowadays, the demands for Workflow applications are blooming increasingly to address the resources and VM instance hour minimization issues. Some provoking constraints acting as a breakthrough has steered us towards investigating the secret's of cloud dominance such as (1) to achieve end-to-end deadlines; (2) Minimized VM instance allotment to a particular application; (3) Minimizing the application's makespan by establishing application performance schedule; (4) Determining a VM process schedule. Initially, it is necessary to determine the lower and upper bounds for end-to-end deadliness. In response to that, we develop a heuristic Slack-Distance Minimization (SDM) algorithm for ensuring the first two conditions. After determining the application performance schedule and appropriate VM instances, it is necessary to minimize the instance hours by using our proposed Resource Hour Minimization (RHM) algorithm. The investigational outcome proves that the proposed SDM algorithm is an outstanding one when compared to other algorithms like HEFT and MOHEFT. Furthermore, the comparisons were made in the presence and absence of the RHM algorithm for ensuring the minimized execution instance hours.

关键词： Schedules Minimization Cloud computing scheduling Heuristic algorithms Virtual machining scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

The role of queueing theory in the design and analysis of wireless sensor networks: An insight 14th

The role of queueing theory in the design and analysis of wi...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： S. Lall A. S. Alfa B. T. Maharaj Department of Electrical Electronic and Computer Engineering University of Pretoria Pretoria South Africa Department of Electrical and Computer Engineering University of Manitoba Winnipeg Mb Canada

ISBN: (纸本)9781509028719

Most research on the mathematical modelling of wireless sensor networks (WSNs) have focussed mainly on the optimization aspects, such as those relating to sensor placements, data routing, reliability, etc. Surprisingly the issue relating to performance analysis of data processing and transmission at the nodes, have not received as much attention. A considerable amount of delay to data actually happens at the nodes as a result of queue build up. Hence, understanding the role of queueing in WSN modelling is very important. In this paper we study the literature of queueing as applied to WSNs and provide insight to the current state of the art and directions for the future. The utilization of queueing theory in WSNs is broadly classified into four categories, namely, congestion control methods, power allocation schemes, network performance evaluation techniques and scheduling schemes.

关键词： Wireless sensor networks Queueing analysis Protocols Mathematical model Analytical models scheduling algorithms Delays

来源：评论

学校读者我要写书评

暂无评论

New tasks scheduling strategy for resources allocation in Cloud computing Environment 6

New tasks scheduling strategy for resources allocation in Cl...

引用

6th International Conference on Modeling, Simulation, and Applied Optimization, ICMSAO 2015

作者： Beghdad Bey, Kadda Benhammadi, Farid Sebbak, Faouzi Mataoui, Mhamed Laboratory of Informatics Systems Ecole Militaire Polytechnique Algiers Algeria IS and DB Laboratory Ecole Militaire Polytechnique Algiers Algeria

ISBN: (纸本)9781467366014

Scientific applications are very complex and need massive computing power and storage space. Distributed computing environment has become a new technology to execute large-scale applications and Cloud computing is one of these technologies. Resource allocation is one of the most important challenges in the Cloud Computing. The optimally assigning of the available resources to the needed cloud applications is known to be a NP complete problem. In this paper, we propose a new task scheduling strategy for resource allocation for maximizing profit in cloud computing environment. We focus on minimizing the total executing time (makespan) of task scheduling and maximizing the resources exploitation. To show the interest of the proposed solution, Experiments results are conducted on a simulation data set. © 2015 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Maximum probability path scheduling algorithm for elephant flow in data center networks based on SDN

引用

Ruan Jian Xue Bao/Journal of Software 2016年 27卷 254-260页

作者： Chen, Lin Zhang, Fu-Qiang School of Computer National University of Defense Technology Changsha410073 China

With the rapid growth of the scale of the data center networks, the low network bandwidth utilization has posed a problem due to network congestion. How to improve data center network link bandwidth utilization and throughput by load balancing has become a research focus. How to reasonably schedule flow by making use of traffic characteristics, link state and application requirements is the key to realize the network link load balancing. Aiming at scheduling problem of elephant flow that bursts and highly occupies bandwidth in the data center, this paper proposes a maximum probability path scheduling algorithm (MPP_SA) for SDN data center network. The algorithm firstly computes all paths that can meet the scheduled flow's demand, and then calculates bandwidth ration between flow bandwidth and minimum link bandwidth combining with all the bandwidth ratio to compute path probability for each path. Finally, the path of largest path probability will be likely selected. The algorithm does not only consider flow's bandwidth and usage of link bandwidth, but also the global flow scheduling and bandwidth fragmentation. The experimental results show that the MPP_SA algorithm can effectively alleviate network congestion, improve the bandwidth utilization and throughput, and reduce network delay, so as to improve the overall network performance and quality of service. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient throughput averaging method for proportional fair algorithm used in mobile networks

An efficient throughput averaging method for proportional fa...

引用

Advances in Wireless and Optical Communications (RTUWO)

作者： A. Büyükoğlu M. İzzet Sağlam A. Kavas M. Kartal Department of Electronics and Communication Engineering Istanbul Technical University Istanbul Turkey Yildiz Technical University Department of Electronics and Communication Engineering Istanbul Turkey

High downlink and uplink speeds are achievable with the aid of LTE. Providing this technology in real life requires scheduling algorithms that will effect the concepts such as throughput and fairness. In this paper some new averaging methods for proportional fair algorithm are proposed. Simulation results show that arithmetic mean method can increase spectral efficiency and fairness performance of proportional fair scheduler.

关键词： Throughput Long Term Evolution Algorithm design and analysis Mobile communication scheduling algorithms Bandwidth Mobile computing

来源：评论

学校读者我要写书评

暂无评论

A Study on Cloud Cost Efficiency by Exploiting Idle Billing Period Fractions

A Study on Cloud Cost Efficiency by Exploiting Idle Billing ...

引用

IEEE International Conference on Cloud Engineering Workshop (IC2EW)

作者： Altino M. Silva Sampaio Jorge G. Barbosa CIICESI Instituto Politécnico do Porto Felgueiras Portugal Departamento de Engenharia Informática Faculdade de Engenharia Universidade do Porto Porto Portugal

ISBN: (纸本)9781509036851

In most of the current commercial Clouds, resources are billed based on a time interval equal to one hour, as is the case of virtual machine (VM) instances on Amazon EC2. Such time interval is usually long, and yet the user has to pay for the whole last hour, even if he/she has only used a fraction of it, contradicting the pay-as-you-go model of Clouds. In this paper, we analyse the advantages of adopting alternative scheduling policies that exploit idle last time intervals, in terms of service cost to Cloud users and operating costs to Cloud providers. Using a real-life astronomy workflow application, constrained by user-defined Deadline and Budget quality of service (QoS) parameters, a set of online state-of-the-art-based scheduling algorithms try different execution and resource provisioning plans. Our results show that exploitation of partially idle last time intervals can reduce the cost of service to the end user, and augments providers competitiveness up to 21.6% through energy efficiency improvement and consequent lowering of operational costs.

关键词： scheduling Cloud computing Computational modeling Quality of service scheduling algorithms Program processors

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of the window-based HARQ time bundling scheme

Performance analysis of the window-based HARQ time bundling ...

引用

International Conference on Intelligent Green Building and Smart Grid (IGBSG)

作者： Shiann-Tsong Sheu Ray-Guang Cheng Jie-Yu Wang Kai-Hua Kuo Ruki Harwahyu Department of Communication Engineering National Central University Taiwan R.O.C. Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan R.O.C

ISBN: (纸本)9781467382564

For LTE-A TDD systems supporting DL heavy asymmetry traffic, the number of downlink (DL) subframes are much higher than that of uplink (UL) subframes. The HARQ feedbacks of multiple DL tranport blocks may be transmitted in one UL subframe. Time-bundling is a technique proposed to reduce the HARQ signaling overhead by combining multiple ACK/NACKs into one using `AND' operation. In this paper, we propose a window-based HARQ time-bundling scheme to further enhance the legacy scheme. An analytical model is provided to analyze the performance of proposed scheme. We will show that the proposed scheme can reduce the signaling overhead and the analytical model can accurately estimate the performance of the proposed scheme.

关键词： Generators Analytical models Uplink 3GPP Throughput scheduling algorithms Transmitters

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Data Services in Vehicular Networks via Cooperative Infrastructure-to-Vehicle and Vehicle-to-Vehicle Communications

Towards Efficient Data Services in Vehicular Networks via Co...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Byungjin Ko Kai Liu Sang H. Son Department of Information and Communication Engineering DGIST Daegu Korea College of Computer Science Chongqing University Chongqing China

This paper investigates information services in vehicular networks via cooperative infrastructure-to-vehicle (I2V), vehicle-to-vehicle (V2V) communications. In particular, we consider the cooperation among multiple roadside units (RSUs) in a bidirectional roadway scenario in providing data services. The primary objective is to best explore the channel efficiency for I2V/V2V communications to maximize the system performance. Specifically, we formulate the problem, propose a Maximum Service (MS) algorithm which combines the following three approaches. First, a hybrid I2V/V2V data dissemination scheduling policy is proposed to enable data services in the RSU's coverage. Second, a cooperative V2V data sharing mechanism out of the RSUs' coverage is proposed by assigning server-vehicles (SVs) to offload RSUs' workload. Third, a data dissemination policy for SVs is proposed to further enhance overall system performance. Finally, we build the simulation model, give a comprehensive performance evaluation to demonstrate the superiority of the proposed solution.

关键词： Vehicles Data dissemination Vehicular ad hoc networks Delays Media Access Protocol System performance scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：