By Topic

Global Variable Partition with Virtually Shared Scratch Pad Memory to Minimize Schedule Length

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Meikang Qiu ; Dept. of Electr. & Comput. Eng., Univ. of Kentucky, Lexington, KY, USA ; Lei Zhang ; Minyi Guo ; Fei Hu
more authors

On-chip memory is a critical component of MPSoC architecture. Virtually shared scratch pad memory (VSSPM) architecture is a novel approach to close the processor-memory speed gap since it can take the advantages of both shared and private SPM. In this paper, we propose an efficient variable partitioning algorithms, global view prediction (GVP), to improve the overall throughput. The experimental results demonstrate the effectiveness of our approach.

Published in:

2009 International Conference on Parallel Processing Workshops

Date of Conference:

22-25 Sept. 2009