{"title":"Study of Scheduling for Processing Real-Time Communication Signals on Heterogeneous Clusters","authors":"Xiaomin Zhu, Peizhong Lu","doi":"10.1109/I-SPAN.2008.27","DOIUrl":null,"url":null,"abstract":"Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from highspeed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I-SPAN.2008.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Exploiting clusters to develop software radio systems is a much more promising research direction. When vast much feeble communication signal data collected from highspeed network enter a cluster, they will be partitioned and allocated to nodes for processing so as to realize the processing of high-gain and low-delay. This paper proposes a general real-time scheduler model for communication signals processing on clusters, a self-adaptive task partition method and a dynamic synthetical heuristic DSSA, which considers both deadline and makespan while scheduling. By tuning correlative parameters, the DSSA can achieve higher guarantee ratio. On the promise of satisfying timing constraints, the system also has higher throughput and better load balancing. We make comparisons between DSSA and DASAP, DALAP algorithms and the simulation results show that DSSA surpasses DASAP and DALAP.