检索结果-南通市图书馆

QoS-aware scheduling algorithm in relay-assisted LTE-A system

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2013年第5期20卷 16-21页

作者： CHUAI Gang YU Xiao-liang School of Information and Communication Engineering Beijing University of Posts and Telecommunications Key Laboratory of Universal Wireless Communications Ministry of EducationBeijing University of Posts and Telecommunications

This paper details on the uplink scheduling algorithm for long term evolution advanced （LTE-A） system with relays. While emulating quality of service （QoS）-aware services with different bit-rate and delay budget requirements for the upstream direction, a new QoS-aware scheduling algorithm for in-band relays is proposed. In this work, an improved scheduling metric calculation method and bit-rate guarantee scheme is applied. Moreover, this algorithm proposes an efficient scheme for the backhaul link allocation which allows information of the most backlogged users to be transmitted first. Finally, this paper concludes with simulation results to demonstrate how the proposed resource allocation strategy improves the performance of the system.

关键词： relay station scheduling algorithm guaranteed bit rate (GBR) backhaul link access link

A Throughput-Driven scheduling algorithm of Differentiated Service for Web Cluster

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第1期11卷 88-92页

作者： YAN Cai-rong SHEN Jun-yi PENG Qin-ke WAN Yong-quan Software Institute Xi＇ an Jiaotong University Xi＇ an 710049 Shaanxi China

Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduling system features a self-learning capability and good adaptability to the change of load. Moreover, it separates static requests from dynamic requests to make full use of the CPU resources and takes the locality of requests into account to improve the cache hit ratio. Experimental re suits from the testing tool of WebBench^TM show better per formance for Web cluster server with TDSA than that with traditional scheduling algorithms.

关键词： Web cluster server throughput-driven scheduling algorithm differentiated service

Makespan and reliability driven scheduling algorithm for independent tasks in Grids

在线全文

学校读者我要写书评

暂无评论

High Technology Letters 2007年第4期13卷 407-412页

作者：王树鹏 Yun Xiaochun Yu Xiangzhan Intelligent Software Division Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 P.R. China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 P.R. China

In the dynamic, complex and unbounded Grid systems, failures of Grid resources caused by malicious attacks and hardware failures are inevitable and have an adverse effect on the execution of tasks. To mitigate this problem, a makespan and reliability driven （MRD） sufferage scheduling algorithm is designed and implemented. Different from the traditional Grid scheduling algorithms, the algorithm addresses the makespan as well as reliability of tasks. The simulation experimental results show that the MRD sufferage scheduling algorithm can increase reliability of tasks and can trade off reliability against makespan of tasks by adjusting the weighting parameter in its cost function. So it can be applied to the complex Grid computing environment well.

关键词： grid scheduling algorithm makespan reliability independent task

Study on simulation and scheduling algorithm of CAN control for independently driving electric vehicle

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2010年第1期16卷 90-93页

作者：孟祥 Cao Wanke Lin Cheng Sun Tielei National Engineering Laboratory for Electric Vehicle Beijing Institute of Technology Beijing 100081 P. R. China

Safety-critical applications such as the independently driving systems of electric vehicle （EV） require a high degree of reliability. The controller area network （CAN） is used extensively in the control sectors. A new real-time and reliable scheduling algorithm based on time-triggered scheduler with a focus on the CAN-based distributed control systems for independently driving EV is exploited. A distributed control network model for a dual-wheel independendy driving EV is established. The timing and reliabili- ty analysis in the worst case with the algorithm is used to evaluate the predictability and dependability and the simulation based on the algorithm with CANoe software is designed. The results indicate the algorithm is more predicable and dependable.

关键词： independently driving scheduling algorithm real-time analysis time-triggered scheduler controller area network (CAN)

AN EFFICIENT scheduling algorithm FOR INPUT-QUEUED SWITCHES

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2007年第2期24卷 251-256页

作者： Hu Qingsheng Sun Yuan Han Jiangtao Institute of Radio Frequency ＆ Optical Electronic ICs Southeast University Nanjing 210096 China

This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.

关键词： Input Queuing (IQ) switches scheduling algorithm Threshold

Wireless Sensor Network Lifetime Enhancement Using Modified Clustering and scheduling algorithm

在线全文

学校读者我要写书评

暂无评论

Circuits and Systems 2016年第8期7卷 1787-1793页

作者： K. Ramesh K. Somasundaram Department of IT Nandha Engineering College Erode India Department of CSE Vel Tech High Tech Dr.Rangarajan Dr.Sakunthala Engineering College Chennai India

Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection of data and decreases network lifetime. scheduling algorithms are the one way of addressing this issue. In proposed method, an optimized sleep scheduling used to enhance the network lifetime. While using the scheduling algorithm, the target coverage and data collection must be maintained throughout the network. In-network, aggregation method also used to remove the unwanted information in the collected data in level. Modified clustering algorithm highlights three cluster heads in each cluster which are separated by minimum distance between them. The simulation results show the 20% improvement in network lifetime, 25% improvement in throughput and 30% improvement in end to end delay.

关键词： Clustering algorithm Wireless Sensor Networks scheduling algorithm Network Lifetime

A NEW scheduling algorithm TO PROVIDE PROPORTIONAL QOS IN OPTICAL BURST SWITCHING NETWORKS

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2006年第5期23卷 656-660页

作者： Tan Wei Zhang Zhizhong Luo Yunhan Wang Sheng Li Lemin Key Lab of Opt. Fiber Trans. and Commun. Networks UESTC Chengdu 610054 China Dept of Commun Engineering Chongqing Univ of Posts and Telecommun. Chongqing 400065 China

A new scheduling algorithm, which aims to provide proportional and controllable QoS (Quality of Service) in terms of burst loss probability for OBS (Optical Burst Switching) networks, is proposed on the ba- sis of a survey of QoS schemes in current OBS networks. With simulations, performance analysis and com- parisons are carried out in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariff policy making.

关键词： Optical Burst Switching (OBS) Proportional Quality of Service (QoS) scheduling algorithm

A Novel Composite scheduling algorithm for OBS Switch with Shared Optical Buffer

在线全文

学校读者我要写书评

暂无评论

A Novel Composite Scheduling Algorithm for OBS Switch with S...

Optimal scheduling algorithm for Periodic Tasks in Distributed Control Systems Based on PSO

2003 International Conference on Communication Technology

作者： Hao Chi Jiangtao Luo Huandong Zhao Jianxin Wang Zhizhong Zhang and Qingji Zeng Department of Electronic Engineering Shanghai Jiaotong University

In this paper, the conservative mode and the greedy mode scheduling algorithms for optical burst switch with shared optical buffer are presented and discussed. Computer simulations compare their perfo

关键词： Optical burst switchi ng (OBS) Optical buffer Fiber delay line (FDL) scheduling algorithm Variable length packet

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Optimal Scheduling Algorithm for Periodic Tasks in Distribut...