A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
An enhanced Co-scheduling method using reduced MS-state diagrams
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing
Instruction scheduling methods based on the construction of state diagrams (or automata) have been used for architectures involving deeply pipelined function units. However, the size of the state diagram is prohibitively large, resulting in high execution time and space requirement. In this paper, we present a simple method for reducing the size of the state diagram by recognizing unique paths of a state diagram. Our experiments show that the number of paths in the reduced state diagram is
doi:10.1109/ipps.1998.669906
dblp:conf/ipps/GovindarajanRAG98
fatcat:yugdyyihf5cbtiyypszx7vgz2m