A topological sorting and loop cleansing algorithm for a constrained MIMD compiler of shift-invariant flow graphs
- 24 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11, 2927-2930
- https://doi.org/10.1109/icassp.1986.1168609
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Optimum implementation of single time index signal flow graphs on synceronous multiprocessor machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An SSIMD compiler for the implementation of linear shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Cyclo-static multiprocessor scheduling for the optimal realization of shift-invariant flow graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The maximum sampling rate of digital filters under hardware speed constraintsIEEE Transactions on Circuits and Systems, 1981
- Analysis of Graphs by Ordering of NodesJournal of the ACM, 1972