Variable Partitioning and Scheduling of Multiple Memory Architectures for DSP

Authors:
Qingfeng Zhuge;Bin Xiao;Edwin Hsing-Mean Sha
Affiliations:
-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 4
Cited 8

Exploiting dual data-memory banks in digital signal processors

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Simultaneous reference allocation in code generation for dual data memory bank ASIPs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Variable partitioning for dual memory bank DSPs

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02
Rotation scheduling: a loop pipelining algorithm

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Comparing a genetic algorithm penalty function and repair heuristic in the DSP application domain

AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Minimizing bank selection instructions for partitioned memory architecture

CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Minimal placement of bank selection instructions for partitioned memory architectures

ACM Transactions on Embedded Computing Systems (TECS)
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture

Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Joint variable partitioning and bank selection instruction optimization on embedded systems with multiple memory banks

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture

Journal of Combinatorial Optimization
Joint variable partitioning and bank selection instruction optimization for partitioned memory architectures

ACM Transactions on Embedded Computing Systems (TECS)
Minimizing code size via page selection optimization on partitioned memory architectures

Proceedings of the 2013 International Conference on Compilers, Architectures and Synthesis for Embedded Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture are variable partitioning and scheduling. However, there's little research work that has been done on these problems.In this paper, we present a new graph model for tackling the variable partitioning problem, namely, Variable Independence Graph (VIG), which provides more precise information for variable partitioning compared to the previous graph models. We also present a scheduling algorithm that takes advantages of multiple memory modules, Rotation Scheduling with Variable Re-partition (RSVR). It's a new scheduling technique based on retiming and software pipelining. It may re-partition the variables if necessary during the scheduling process. The experiment results show that the average improvement on schedule length by using the algorithm is 44.8%.Another major contribution of this paper is that we invent an algorithm for design space exploration on multiple memory architecture. It produces more feasible solutions on a set of schedule length requirement. And our solution have less functional units that Interference Graph model.