A Proof of Correctness of a Processor Implementing Tomasulo's Algorithm without a Reorder Buffer.
Ravi HosabettuGanesh GopalakrishnanMandayam K. SrivasPublished in: CHARME (1999)
Keyphrases
- dynamic programming
- learning algorithm
- np hard
- times faster
- detection algorithm
- provably correct
- computational complexity
- experimental evaluation
- linear programming
- improved algorithm
- computationally efficient
- similarity measure
- input data
- expectation maximization
- computational cost
- objective function
- recognition algorithm
- probabilistic model
- high accuracy
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- multiprocessor systems
- buffer size
- significant improvement
- matching algorithm
- cost function
- neural network
- scheduling problem