|
ABSTRACT
Currently, a lot of research is devoted to system design, and little work is done on requirements analysis. Besides going from specification to design, one of our main objectives is to show how an application problem can be transformed into specifications. Working from the hardware-software codesign perspective, a system is designed starting from an application problem itself, rather than the detailed behavioral specifications. Given an application problem specified as a directed acyclic graph of elementary problems, a hardware-software solution is derived such that the synthesized software, a parallel pseudoprogram, can be scheduled and executed on the synthesized software, a parallel pseudoprogram, can be scheduled and executed on the synthesized hardware, a set of system-level parallel computer specifications, with heuristically optimal performance. This is known as system-level cosynthesis of application-oriented general-purpose parallel systems for which a novel methodology called Cosynthesis Methodology for Applicaton-Oriented Parallel Systems (CMAPS), is presented. Since parallel programs and multiprocessor architectures are largely interdependent, CMAPS explores the relationship between hardware designs and software algorithms by interleaving the modeling phases and the synthesis phases of both hardware and software. High scalability in terms of problem complexity and easy upgradability to new technologies are achieved through modularization of the input problem specification, of the software algorithms, and of the hardware subsystem models. The work presented in this paper will be beneficial to designers of general-purpose parallel computer systems which must be oriented toward solving some user-specified problem such as the global controller of an industry automation process or a multiprocessor video server. Some application examples are given to illustrate various codesign phases of CMAPS and its feasibility.
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
|
W. P. Birmingham , A. P. Gupta , D. P. Siewiorek, The MICON system for computer design, Proceedings of the 26th ACM/IEEE conference on Design automation, p.135-140, June 25-28, 1989, Las Vegas, Nevada, United States
[doi> 10.1145/74382.74406]
|
| |
4
|
|
| |
5
|
|
| |
6
|
FLYNN, M. J. 1972. Some computer organizations and their effectiveness. IEEE Trans. Comput. C-21, 9 (Sept. 1972), 948-960.
|
 |
7
|
|
| |
8
|
GADIENT,A.J.AND THOMAS, D. E. 1993. A dynamic approach to controlling high-level synthesis CAD tools. IEEE Trans. Very Large Scale Integr. Syst. 1, 3 (Sept.), 328-341.
|
| |
9
|
GRAHAM, R. L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17 (1969), 416-429.
|
| |
10
|
GUPTA,A.P.,BIRMINGHAM,W.P.,AND SIEWIOREK, D. P. 1993. Automating the design of computer systems. IEEE Trans. Comput.-Aided Des. Integr. Circuits 12, 4 (Apr.), 473-487.
|
| |
11
|
|
 |
12
|
|
 |
13
|
|
| |
14
|
|
| |
15
|
HSIUNG, P.-A., LEE, T.-Y., AND CHEN, S.-J. 1997. MOBnet: An extended Petri net model for the concurrent object-oriented system-level synthesis of multiprocessor systems. IEICE Trans. Inf. Syst. E80-D, 2 (Feb.), 232-242.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
| |
21
|
LIN, J. -F., SEE, W. -B., AND CHEN, S. -J. 1995. Performance bounds on scheduling parallel tasks with communication cost. IEICE Trans. Inf. Syst. (Mar. 1995), 263-268.
|
| |
22
|
PRAKASH,S.AND PARKER, A. C. 1992. SOS: synthesis of application-specific heterogeneous multiprocessor systems. J. Parallel Distrib. Comput. 16, 4 (Dec.), 338-351.
|
| |
23
|
|
| |
24
|
|
| |
25
|
ULLMAN, J. 1975. NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 384-393.
|
| |
26
|
|
| |
27
|
WOLF, W. 1994. Hardware-software co-design of embedded systems. Proc. IEEE 82, 7 (July 1994), 967-989.
|
 |
28
|
|
| |
29
|
|
| |
30
|
|
| |
31
|
|
 |
32
|
|
| |
33
|
|
|