The use of subsystems is fundamental to the modeling of hierarchical hardware using recurrence equations. Scheduling adds temporal information to a system and is thus a key step in the synthesis of parallel hardware from algorithms. It determines such things as the placement of pipeline registers, the latency and throughput of the circuit, and the order and rate that inputs are consumed and outputs produced. This paper will show how to extend usual dependence analysis to derive the additional dependences on the timing function needed when subsystems are used. © Springer-Verlag Berlin Heidelberg 1999.
CITATION STYLE
Crop, J. B., & Wilde, D. K. (1999). Scheduling structured systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 409–412). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_53
Mendeley helps you to discover research relevant for your work.