Incorporating speculative execution into scheduling of control-flow intensive behavioral descriptions
Speculative execution refers to the execution of parts of a computation before the execution of the conditional operations that decide whether it needs to be executed. It has been shown to be a promising technique for eliminating performance bottlenecks imposed by control flow in hardware and softwa...
Saved in:
| Published in: | DAC 98: DAC: 35th Annual ACM/IEEE Design Automation Conference pp. 108 - 113 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
01.01.1998
IEEE |
| Series: | ACM Conferences |
| Subjects: |
Theory of computation
> Design and analysis of algorithms
> Approximation algorithms analysis
> Scheduling algorithms
Theory of computation
> Design and analysis of algorithms
> Online algorithms
> Online learning algorithms
> Scheduling algorithms
|
| ISBN: | 0897919645, 9780897919647 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

