Hello list, how would one go about analyzing an assembly code in terms of data dependencies and instruction latency and throughput? What I am looking for is a way to help me analyze the potential performance of an instruction sequence and a way to tell me where I could possibly improve the sequence due to data dependencies, i.e. instruction latency issues, or instruction throughput issues. Although I can lookup the latency/throughput values in the Intel Optimization manual, I still have a hard time figuring out how to estimate the issue rate of the processor and therefore how the instruction overlap in the execution core. Thanks in advance, nick -- To unsubscribe from this list: send the line "unsubscribe linux-assembly" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
- Prev by Date: Fwd: 4x4 single-precision matrix product with SSE
- Next by Date: writing a jump table
- Previous by thread: 4x4 single-precision matrix product with SSE
- Next by thread: writing a jump table
- Index(es):