Study of Scheduling for Processing Real-Time Communication Signals on Heterogeneous Clusters

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.

[1]  Xiao Qin,et al.  A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters , 2005, J. Parallel Distributed Comput..

[2]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[4]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[5]  Sanjoy K. Baruah,et al.  Rate-monotonic scheduling on uniform multiprocessors , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[6]  Reda A. Ammar,et al.  An Efficient Workload Allocation to Improve Scheduling Real-Time Tasks , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[7]  Lin Huang,et al.  Open Wireless Software Radio on Common PC , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[8]  Krishna M. Kavi,et al.  A non-preemptive scheduling algorithm for soft real-time systems , 2007, Comput. Electr. Eng..

[9]  Ladislau Bölöni,et al.  A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[10]  C. Siva Ram Murthy,et al.  An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[11]  Sanjoy K. Baruah,et al.  Rate-Monotonic Scheduling on Uniform Multiprocessors , 2003, IEEE Trans. Computers.

[12]  Gurdeep S. Hura,et al.  Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments , 2005, J. Parallel Distributed Comput..

[13]  Louise E. Moser,et al.  Dynamic scheduling for soft real-time distributed object systems , 2000, Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607).

[14]  Michael A. Palis,et al.  Online real-time job scheduling with rate of progress guarantees , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.