Optimum and heuristic synthesis of multiple word-length architectures.

Optimum and heuristic synthesis of multiple word-length architectures.

This paper explores the problem of architectural synthesis (scheduling, allocation, and binding) for multiple word-length systems. It is demonstrated that the resource allocation and binding problem, and the interaction between scheduling, allocation, and binding, are complicated by the existence of...

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:IEEE Transactions on VLSI systems 13, 1 (2005).
מחבר ראשי: Constantinides, G.A
פורמט: Article
שפה:English
נושאים:
Architectural synthesis problem.
Benchmarked example.
Binding problem.
Critical path analysis.
Heuristic synthesis.
Integer linear program.
Intertwined scheduling.
Multiple wordlength.
Optimum solution.
Resource allocation.
Resource wordlength selection.