|
ABSTRACT
Many computer-aided design problems involve solutions that require the partitioning of a large sequential program written in a language such as C or VHDL. Such partitioning can improve design metrics such as performance, power, energy, size, input/output lines, and even CAD tool run-time and memory requirements, by partitioning among hardware modules, hardware and software processors, or even among time-slices in reconfigurable computing devices. Previous partitioning approaches typically preselect the granularity at which the program is partitioned. In this article, we define three distinct partitioning steps: procedure determination, preclustering, and N-way partitioning, with the first two steps focusing on granularity selection. Using three steps instead of one can provide for a more thorough design space exploration and for faster partitioning. We emphasize the first two steps in this article since they represent the most novel aspects. We illustrate the approach on an example, provide results of several experiments, and point to the need for future research that more fully automates the three-step approach.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
| |
3
|
|
| |
4
|
Cooper, K., Hall, M., and Kennedy, K. 1993. A methodology for procedure cloning. Comput. Lang. 19, 2.
|
| |
5
|
|
| |
6
|
|
| |
7
|
Gajski, D. D., Vahid, F., Narayan, S., and Gong, J. 1998. SpecSyn: An environment supporting the specify-explore-refine paradigm for hardware/software system design. IEEE Trans. VLSI Syst. 6, 1, 84--100.
|
| |
8
|
|
| |
9
|
Mary W. Hall , Jennifer M. Anderson , Saman P. Amarasinghe , Brian R. Murphy , Shih-Wei Liao , Edouard Bugnion , Monica S. Lam, Maximizing Multiprocessor Performance with the SUIF Compiler, Computer, v.29 n.12, p.84-89, December 1996
[doi> 10.1109/2.546613]
|
 |
10
|
|
 |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
Lagnese, E. and Thomas, D. 1991. Architectural partitioning for system level synthesis of integrated circuits. IEEE Trans. Comput-Aid. Des. 10 (July), 847--860.
|
 |
16
|
|
| |
17
|
|
 |
18
|
|
 |
19
|
|
| |
20
|
Vahid, F. 1999b. Techniques for minimizing and balancing i/o during functional partitioning. IEEE Trans. CAD 18, 1 (Jan.), 69--75.
|
 |
21
|
|
| |
22
|
Wan, M., Ichikawa, Y., Lidsky, D., and Rabaey, J. 1998. An Energy conscious methodology for early design exploration of heterogeneous DSP's. In Proceedings of the IEEE Custom Integrated Circuits Conference (CICC), 111--117.
|
| |
23
|
|
 |
24
|
|
CITED BY 5
|
Yuko Hara , Hiroyuki Tomiyama , Shinya Honda , Hiroaki Takada , Katsuya Ishii, Complexity-constrainted partitioning of sequential programs for efficient behavioral synthesis, Proceedings of the 17th great lakes symposium on Great lakes symposium on VLSI, March 11-13, 2007, Stresa-Lago Maggiore, Italy
|
|
|
Yuko Hara , Hiroyuki Tomiyama , Shinya Honda , Hiroaki Takada , Katsuya Ishii, Function-Level Partitioning of Sequential Programs for Efficient Behavioral Synthesis, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E90-A n.12, p.2853-2862, December 2007
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|