A Computing Resource Management Framework for Software-Defined Radios

Software-defined radio (SDR) is an emerging concept that leverages the design of software-defined and hardware- independent signal processing chains for radio communications. It introduces flexibility to wireless systems, facilitating the dynamic switch from one radio access technology to another or, in other words, the de and reallocation of computing resources from one SDR application to another. This paper introduces an SDR computing resource management framework. It accounts for several SDR system characteristics, including real-time computing requirements, limited computing resources, and heterogeneous multiprocessor platforms. The framework features the tw-mapping, a dynamic mapping algorithm that is apt for many cost functions and radio scenarios. The cost function proposal dynamically manages the available computing resources to satisfy the SDR computing constraints. Two SDR scenarios, based on representative SDR platforms and processing chains, and the corresponding simulation results demonstrate the framework's relevance and suitability for SDRs.

[1]  Mark Cummings,et al.  FPGA in the software radio , 1999, IEEE Commun. Mag..

[2]  Henri Casanova,et al.  Guest Editorial: Special Section on Algorithm Design and Scheduling Techniques (Realistic Platform Models) for Heterogeneous Clusters , 2006, IEEE Trans. Parallel Distributed Syst..

[3]  E. Buracchini,et al.  The software radio concept , 2000, IEEE Commun. Mag..

[4]  Walter H. W. Tuttlebee.  Software-defined radio: facets of a developing technology , 1999, IEEE Wirel. Commun..

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

[6]  Joseph Mitola,et al.  The software radio architecture , 1995, IEEE Commun. Mag..

[7]  Sander Stuijk,et al.  Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[8]  Viktor K. Prasanna,et al.  Collective value QoS: a performance measure framework for distributed heterogeneous networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  Ishfaq Ahmad,et al.  On Exploiting Task Duplication in Parallel Program Scheduling , 1998, IEEE Trans. Parallel Distributed Syst..

[10]  Gerald H. Hilderink,et al.  Parallel Processing — the picoChip way! , 2003 .

[11]  Jake K. Aggarwal,et al.  A Generalized Scheme for Mapping Parallel Algorithms , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  L. R. Foulds,et al.  Digraphs: Theory and Techniques , 1980 .

[13]  Rudolf Tanner,et al.  WCDMA - Requirements and Practical Design: Tanner/WCDMA , 2005 .

[14]  Dharma P. Agrawal,et al.  Improving scheduling of tasks in a heterogeneous environment , 2004, IEEE Transactions on Parallel and Distributed Systems.

[15]  Viktor K. Prasanna,et al.  Modeling and mapping for dynamically reconfigurable hybrid architectures , 2001 .

[16]  Trudy D. Stetzler,et al.  DSP-based architectures for mobile communications: past, present and future , 2000, IEEE Commun. Mag..

[17]  Kang G. Shin,et al.  Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems , 1997, IEEE Trans. Software Eng..

[18]  Krithi Ramamritham,et al.  Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems , 1989, IEEE Trans. Parallel Distributed Syst..

[19]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[20]  Heinrich Meyr,et al.  Heterogeneous MP-SoC - the solution to energy-efficient signal processing , 2004, Proceedings. 41st Design Automation Conference, 2004..

[21]  Brad Hutchings,et al.  The flexibility of configurable computing , 1998 .

[22]  Atakan Dogan,et al.  Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[23]  Viktor K. Prasanna,et al.  Run-time adaptation for grid environments , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[24]  Viktor K. Prasanna,et al.  A framework for mapping with resource co-allocation in heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[25]  Orlando Moreira,et al.  Multiprocessor resource allocation for hard-real-time streaming with a dynamic job-mix , 2005, 11th IEEE Real Time and Embedded Technology and Applications Symposium.

[26]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

[27]  Yan Alexander Li,et al.  Minimizing the Application Execution Time Through Scheduling of Subtasks and Communication Traffic in a Heterogeneous Computing System , 1997, IEEE Trans. Parallel Distributed Syst..

[28]  Axel W. Krings,et al.  Resource reclaiming in hard real-time systems with static and dynamic workloads , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

[29]  Viktor K. Prasanna,et al.  A metric and mixed-integer-programming-based approach for resource allocation in dynamic real-time systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[30]  A. R. Rhiemeier.  Mathematical Modeling of the Software Radio Design Problem , 2003 .

[31]  Kang G. Shin,et al.  Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[32]  Ramon Ferrús,et al.  Software Radios: Unifying the Reconfiguration Process over Heterogeneous Platforms , 2005, EURASIP J. Adv. Signal Process..

[33]  Joseph Mitola,et al.  Software Radio Technologies , 2001 .

[34]  Joseph Mitola,et al.  Software Radio Technologies: Selected Readings , 2001 .