Resource theory for multiprocessors
A theory on the resource utilization in microprocessors is presented.The theory shows that automatic placement, duplication and other control can be used to implement microprocessors.
Usually implementing any program on a microprocessor without knowledge of its architecture is possible.
Latency time and memory volume can be computed for any program using a number of characteristic figures known for the program.
The theory can be used to optimize the design of microprocessors. The processors can be of fine or course type.