Paper Info
Title
Efficient Task Assignment And Scheduling For Mpsoc Dsps With Vs-Spm Considering Concurrent Accesses Through Data Allocation
Abstract
Virtually Shared Scratch-Pad Memory (VS-SPM) with multiple memory banks can be used as on-chip memory on multiprocessor systems-on-chips (MPSoCs) to close the speed gap between fast processors and slow memories. By exploring the parallelism of computation tasks on processors and concurrent data accesses on each SPM, the results of task assignment and data allocation can significantly affect the overall performance of a schedule. In this paper, we propose ILP formulations for solving the problem of task assignment and scheduling on MPSoCs with multi-bank VS-SPM. We also propose a polynomial-time algorithm, the Potential Remote Access Prediction (PRAP) algorithm, to generate near-optimal results efficiently. The experimental results demonstrate the effectiveness of our technique.
Year
DOI
Venue
2013
10.1109/ICASSP.2013.6638129
2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)
Keywords
Field
DocType
Task Assignment, Data Allocation, Scheduling, MPSoC, Virtually Shared SPM
Memory bank,System on a chip,Polynomial,Computer science,Scheduling (computing),Parallel computing,Distributed memory,Multiprocessing,MPSoC,Computation
Conference
Volume
Issue
ISSN
null
null
1520-6149
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Shouzhen Gu1114.32
Qingfeng Zhuge2428.11
Jingtong Hu396376.16
Juan Yi46910.35
Edwin Hsing-Mean Sha537734.74