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

A Neighbor-based Holdoff Reduction Scheme for distributed scheduling in Wireless Mesh Networks

A Neighbor-based Holdoff Reduction Scheme for Distributed Sc...

6th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)/STMWC/NASSUE/CMPA/VECON/AWSAN/AWSAN

作者： Lakani, Sara Ghaffarian, Hossein Fathy, Mahmood Raahemi, Bijan Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Univ Sci & Technol Dept Comp Engn Tehran Iran

ISBN: (纸本)9781424477425

The IEEE 802.16 standard of wireless mesh networks includes various scheduling algorithms, both centralized and distributed, to determine the proper time slot that each wireless node can transmit its data. In this paper, we introduce a new scheduling scheme to improve scalability and resource utilization in wireless mesh networks where all nodes compete to gain access to the transmission time slot. In our proposed method, the transmission time of a node is modified according to the transmission status of its neighbors, resulting in a shorter holdoff time, and consequently, reducing the transmission delay and throughput. The simulation results confirm the efficiency and performance of the proposed algorithm over the IEEE 802.16-mesh standard in terms of throughput and delay.

关键词： Wireless Mesh Networks holdoff time IEEE 802.16 Wireless MAC distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

Application of Simulation Model for distributed scheduling Problems in FMS

Application of Simulation Model for Distributed Scheduling P...

引用

World Congress on Engineering (WCE 2011)

作者： Selvaraj, N. Natl Inst Technol Dept Mech Engn Warangal 506004 Andhra Pradesh India

ISBN: (纸本)9789881821065

The main objective of this paper is to study the distributed scheduling (DS) problems in Flexible Manufacturing System (FMS) environment using simulation model. This FMS is assumed to be single factory and multi factory which are analyzed by production capacity, throughput, utilization and work-in-process (WIP) by considering scheduling rules. The rules which are includes Largest processing time (LPT), shortest processing time (SPT), first come first serve (FCFS) and last come first serve (LCFS). Finally these rules are compared with each other and concluded that which rule is better than others with respect to performances in the view of single factory and multi factory. Further the author has suggested future research works too.

关键词： distributed scheduling FMS Simulation Performance measures

来源：评论

学校读者我要写书评

暂无评论

Online distributed scheduling For Parallel Computations

Online Distributed Scheduling For Parallel Computations

引用

High Performance Computing Symposium (HPC 2013) / Spring Simulation Multi-Conference (SpringSim '13)

作者： Narang, Ankur Srivastava, Abhinav Shyamasundar, R. K. IBM India Res Lab New Delhi India Tata Inst Fundamental Res Bombay Maharashtra India

ISBN: (纸本)9781627480338

Petascale computing requires complex runtime systems that need to consider affinity, load balancing and low time and message complexity for scheduling massive scale parallel computations. Simultaneous consideration of these objectives makes online distributed scheduling a very challenging problem. Prior distributed scheduling approaches are limited to shared memory or primarily use work-stealing across distributed memory nodes for load balancing or depend on the programmer specified affinity. However, the performance of affinity driven scheduling and work stealing based algorithms degrades when the input is irregular(UTS) and/or sparse. In this paper we present a novel adaptive distributed scheduling algorithm (ALDS) for multi-place 1 parallel computations, that uses a unique combination of remote (inter-place) spawns and remote work steals to reduce the overheads in the scheduler, which helps to dynamically maintain load balance across the compute nodes of the system, while ensuring affinity maximally. Using parallel machine learning algorithms such as Support Vector Regression running concurrently with program execution on the target architecture, ALDS can automatically and adaptively tune the parameters for scalable performance. Our design was implemented using GASNet API and POSIX threads. For the UTS (Unbalanced Tree Search) benchmark (using 2048 nodes of Blue Gene/P), we deliver superior performance over Charm++ [15] and [17].

关键词： distributed scheduling Performance Analysis Online Dynamic scheduling Adaptive Algorithm

来源：评论

学校读者我要写书评

暂无评论

A kind of Two-Level Cooperation distributed scheduling Strategy 5

A kind of Two-Level Cooperation Distributed Scheduling Strat...

引用

5th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Ruan, Dongru Hua, Yu Pang, Zhifeng Hebei Univ Sci & Technol Sch Informat Sci & Engn Shijiazhuang Hebei Province Peoples R China

ISBN: (纸本)9781479932795

This paper studies the two-level collaborative work architecture of resources allocation mechanism for remote collaborative distribution, researches on key technologies of two-level organization activities in real-time dynamic allocate resources, proposed a two-level collaborative scheduling algorithm to support resources co-allocation. The application showed that the system had a good serviceability.

关键词： two-level cooperation resource allocation distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

Performance driven distributed scheduling of parallel hybrid computations

引用

THEORETICAL COMPUTER SCIENCE 2011年第32期412卷 4212-4225页

作者： Narang, Ankur Shyamasundar, Rudrapatna K. IBM Res India Inst Area New Delhi 110070 India Tata Inst Fundamental Res Bombay 400005 Maharashtra India

Exascale computing is fast becoming a mainstream research area. In order to realize exascale performance, it is necessary to have efficient scheduling of large parallel computations with scalable performance on a large number of cores/processors. The scheduler needs to execute in a pure distributed and online fashion, should follow affinity inherent in the computation and must have low time and message complexity. Further, it should also avoid physical deadlocks due to bounded resources including space/memory per core. Simultaneous consideration of these factors makes affinity driven distributed scheduling particularly challenging. We attempt to address this challenge for hybrid parallel computations which contain tasks that have pre-specified affinity to a place and also tasks that can be mapped to any place in the system. Specifically, we address two scheduling problems of the type P(m)[M(j), prec]C(max). This paper presents online distributed scheduling algorithms for hybrid parallel computations assuming both unconstrained and bounded space per place. We also present the time and message complexity for distributed scheduling of hybrid computations. To the best of our knowledge, this is the first time that distributed scheduling algorithms for hybrid parallel computations have been presented and analyzed for time and message bounds under both unconstrained space and bounded space. (C) 2011 Elsevier B.V. All rights reserved.

关键词： distributed scheduling Multithreaded computation Asymptotic complexity Deadlock free scheduling Work stealing Online algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint and distributed scheduling with dynamic power control in multicell orthogonal frequency division multiple access networks

引用

IET COMMUNICATIONS 2013年第17期7卷 1938-1947页

作者： Zhang, Jia Yuan, Dongfeng Zhang, Haixia Li, Huimin Shandong Univ Wireless Mobile Commun & Transmiss Lab Jinan 250100 Peoples R China

This study addresses the issue of intercell interference coordination in a multicell orthogonal frequency division multiple access network with universal frequency reuse, which aims at improving the network spectral efficiency, especially for the cell edge areas. According to different degrees of information sharing within the engaged network, both a joint and a distributed solution are proposed respectively trying to determine the most appropriate power control strategy along with the user scheduling policy. The joint power control and user scheduling scheme with full access to the network information is capable of gaining considerable enhancement on the network capacity and also a performance improvement for users suffering from strong intercell interferences. The distributed scheme with the same purpose manages to adapt the power control and user scheduling strategy on the basis of dynamic programming with respect to both current and future utility of the network with only local information available. Numerical results have shown the advantages of the proposed schemes in achieving better spectral efficiency under both joint and distributed circumstances.

关键词： cellular radio dynamic programming frequency allocation frequency division multiple access numerical analysis OFDM modulation power control radiofrequency interference distributed scheduling dynamic power control joint scheduling multicell orthogonal frequency division multiple access networks intercell interference coordination universal frequency reuse network spectral efflciency cell edge areas information sharing user scheduling policy network capacity performance improvement dynamic programming local information

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling for Efficient HVAC Pre-cooling Operations

引用

IFAC Proceedings Volumes 2014年第3期47卷 10451-10456页

作者： Yang Su Rong Su Kameshwar Poolla EXQUISITUS Centre of E-City Nanyang Technological University 50 Nanyang Avenue Singapore 639798 Mechanical Engineering Department University of California Berkeley 5141 Etcheverry Hall Mailstop 1740 Berkeley CA 94720-1740 USA

Supply fan takes up to 30% of Heating, Ventilation and Air Conditioning (HVAC) systems' in-building energy consumption. Since the fan power consumption is a cube function of the mass flow rate of supply air, it is thus possible to reduce the energy consumption significantly by elongating and scheduling the pre-cooling processes. To handle the computational complexity raised for large scale buildings, two distributed consensus-like scheduling algorithms are proposed in this paper. Simulation studies indicate higher energy efficiency compared to uncoordinated pre-cooling processes; the computation is faster than centralized optimization, although with performance sacrifice.

关键词： HVAC Pre-cooling distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling OF UNSTRUCTURED COLLECTIVE COMMUNICATION ON THE CM-5

引用

Parallel Processing Letters 1995年第4期5卷 647-658页

作者： JHY-CHUN WANG TSENG-HUI LIN SANJAY RANKA School of Computer and Information Science Syracuse University Syracuse NY 13244-4100 USA Jhy-Chun Wang's current address is: IBM POWER Parallel Division Poughkeepsie NY.

Parallelization of scientific applications often results in unstructured collective communication. In this paper, we present a distributed algorithm for scheduling such communication on parallel machines. We describe the performance of this algorithm on the CM-5 and show that the scheduling algorithm gives a significant improvement over naive methods.

关键词： Active messages distributed scheduling unstructured communication

来源：评论

学校读者我要写书评

暂无评论

A novel distributed scheduling scheme for OFDMA uplink using channel information and probabilistic transmission

引用

COMPUTER COMMUNICATIONS 2011年第17期34卷 2104-2113页

作者： Yaacoub, Elias Dawy, Zaher Al-Alaoui, Mohamad Adnan QU Wireless Innovat Ctr Doha Qatar Amer Univ Beirut Dept Elect & Comp Engn ECE Dept Beirut 11072020 Lebanon

distributed uplink scheduling in OFDMA systems is considered. In the proposed model, mobile terminals have the responsibility of making their own transmission decisions. The proposed scheme is based on two dimensional reservation in time and frequency. Terminals use channel state information in order to favor transmissions over certain subchannels, and transmission is done in a probabilistic manner. The proposed approach provides more autonomy to mobile devices in making transmission decisions. Furthermore, it allows avoiding collisions during transmission since it leads to collision detection during the resource reservation phase. The proposed approach is compared to other random access methods and shown to be superior in terms of increasing sum-rate, reducing the number of users in outage, and reducing the collision probability in the reservation phase. (C) 2011 Elsevier B.V. All rights reserved.

关键词： distributed scheduling OFDMA Channel reservation Random access Probabilistic transmission

来源：评论

学校读者我要写书评

暂无评论

System Level Evaluation of LTE-V2V Mode 4 Communications and its distributed scheduling 85

System Level Evaluation of LTE-V2V Mode 4 Communications and...

引用

IEEE 85th Vehicular Technology Conference (VTC Spring)

作者： Molina-Masegosa, Rafael Gozalvez, Javier Univ Miguel Hernandez Elche UMH UWICORE Lab Ave Univ S-N Elche 03202 Spain

ISBN: (纸本)9781509059324

The 3GPP has recently published the first version of the Release 14 standard that includes support for V2V communications using LTE sidelink communications (referred to as LTE-V, LTE-V2X, LTE-V2V or Cellular V2X). The standard includes a mode (mode 4) where vehicles autonomously select and manage the radio resources without any cellular infrastructure support. This is highly relevant since V2V safety applications cannot depend on the availability of infrastructure-based cellular coverage, and transforms LTE-V into a possible (or complimentary) alternative to 802.11p. The performance of LTE-V2V in mode 4 is highly dependent on its distributed scheduling protocol (sensing-based Semi-Persistent scheduling) that is used by vehicles to reserve resources for their transmissions. This paper presents the first evaluation of the performance and operation of this protocol under realistic traffic conditions in urban scenarios. The evaluation demonstrates that further enhancements should be investigated to reduce packet collisions.

关键词： LTE-V LTE-V2X LTE-V2V Cellular V2X V2V Vehicle to Vehicle resource management distributed scheduling sensing-based Semi-Persistent scheduling 5G D2D vehicular networks cooperative ITS C-ITS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：