RT-OPEX: Flexible Scheduling for Cloud-RAN Processing

被引:13
作者
Garikipati, Krishna C. [1 ]
Fawaz, Kassem [1 ]
Shin, Kang G. [1 ]
机构
[1] Univ Michigan, Ann Arbor, MI 48109 USA
来源
PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON EMERGING NETWORKING EXPERIMENTS AND TECHNOLOGIES (CONEXT'16) | 2016年
关键词
Cellular networks; Cloud-RAN; Real-time scheduling;
D O I
10.1145/2999572.2999591
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
It is cost-effective to process wireless frames on general-purpose processors (GPPs) in place of dedicated hardware. Wireless operators are decoupling signal processing from basestations and implementing it in a cloud of compute resources, also known as a cloud-RAN (C-RAN). A C-RAN must meet the deadlines of processing wireless frames; for example, 3ms to transport, decode and respond to an LTE uplink frame. The design of baseband processing on these platforms is thus a major challenge for which various processing and real-time scheduling techniques have been proposed. In this paper, we implement a medium-scale C-RAN-type platform and conduct an in-depth analysis of its real-time performance. We find that the commonly used (e.g., partitioned) scheduling techniques for wireless frame processing are inefficient as they either over-provision resources or suffer from deadline misses. This inefficiency stems from the large variations in processing times due to fluctuations in wireless traffic. We present a new framework called RT-OPEX, that leverages these variations and proposes a flexible approach for scheduling. RT-OPEX dynamically migrates parallelizable tasks to idle compute resources at runtime, reducing processing times and hence deadline misses at no additional cost. We implement and evaluate RT-OPEX on a commodity GPP platform using realistic cellular workload traces. Our results show that RT-OPEX achieves an order-of-magnitude improvement over existing C-RAN schedulers in meeting frame processing deadlines.
引用
收藏
页码:267 / 280
页数:14
相关论文
共 27 条
[1]   Static-priority scheduling on multiprocessors [J].
Andersson, B ;
Baruah, S ;
Jonsson, J .
22ND IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2001, :193-202
[2]  
Baker TheodoreP., 2007, Handbook of Real-time and Embedded Systems
[3]  
Baro Julie., 2012, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, P1815, DOI [10.1145/2245276.2232071, DOI 10.1145/2245276.2232071]
[4]   Is Semi-Partitioned Scheduling Practical? [J].
Bastoni, Andrea ;
Brandenburg, Bjoern B. ;
Anderson, James H. .
PROCEEDINGS OF THE 23RD EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2011), 2011, :125-135
[5]  
Bhaumik S., 2012, MOBICOM
[6]  
Biyabani S. R., 1988, Proceedings. Real-Time Systems Symposium (IEEE Cat. No.88CH2618-7), P152, DOI 10.1109/REAL.1988.51111
[7]   Scheduling multithreaded computations by work stealing [J].
Blumofe, RD ;
Leiserson, CE .
JOURNAL OF THE ACM, 1999, 46 (05) :720-748
[8]  
C-RAN, ROAD GREEN RAN
[9]  
Carpenter J., 2004, HDB SCHEDULING ALGOR
[10]   Cloud RAN for Mobile Networks-A Technology Overview [J].
Checko, Aleksandra ;
Christiansen, Henrik L. ;
Yan, Ying ;
Scolari, Lara ;
Kardaras, Georgios ;
Berger, Michael S. ;
Dittmann, Lars .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2015, 17 (01) :405-426