期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Joint Dynamic Clustering and User Scheduling for Downlink Cloud Radio Access Network with Limited Feedback 被引量:2
1
作者 XU Dongyang REN Pinyi +1 位作者 DU Qinghe SUN Li 《China Communications》 SCIE CSCD 2015年第12期147-159,共13页
In limited feedback-based CloudRAN(C-RAN) systems,the inter-cluster and intra-cluster interference together with the quantification error can seriously deteriorates the system spectral efficiency.We,in this paper,prop... In limited feedback-based CloudRAN(C-RAN) systems,the inter-cluster and intra-cluster interference together with the quantification error can seriously deteriorates the system spectral efficiency.We,in this paper,propose an efficient three-phase framework and corresponding algorithms for dealing with this problem.Firstly,a greedy scheduling algorithm based on the lower bound of the ergodic rate is performed for generating an elementary cluster in the first phase.And then the elementary cluster is divided into many small clusters according to the following proposed algorithms based on the short term instantaneous information in the second phase.In the end,based on the limited feedback two zero-forcing(ZF) precoding strategies are adopted for reducing the intra-cluster interference in the third phase.The provided Monte Carlo simulations show the effectiveness of our proposed algorithms in the respect of system spectral efficiency and average user rate. 展开更多
关键词 scheduling seriously clustering elementary scheduling Feedback generating greedy dealing fading
下载PDF
Checkpointing Scheme for Relevant Distributed Real-Time Tasks 被引量:1
2
作者 方明 袁由光 +1 位作者 杨升春 赵晓勇 《Journal of Donghua University(English Edition)》 EI CAS 2005年第3期23-27,共5页
A checkpointing scheme for relevant distributed real-time tasks which can be scheduled as a DAG is proposed. A typical algorithm, OSA, is selected for DAG scheduling. A new methods based a new structure, Scheduled Clu... A checkpointing scheme for relevant distributed real-time tasks which can be scheduled as a DAG is proposed. A typical algorithm, OSA, is selected for DAG scheduling. A new methods based a new structure, Scheduled Cluster Tree, is presented to calculate the slack time of each task in the task cluster. In the checkpointing scheme, the optimal checkpoint intervals which minimize the approximated failure probability are derived formally and validated experimentally. The complexity of approximated failure probability is quite small compared with that of the exact probability. Meanwhile, the consistency of the checkpointing is discussed also. 展开更多
关键词 CHECKPOINT task scheduling DAG scheduled clusters tree
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部