Compiler-assisted, selective out-of-order commit

Duong, Nam; Veidenbaum, Alexander V.

doi:10.1109/l-ca.2012.8

Cited by 6 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two previous works [1,13] allow for early commit or reclaim of resources based on compiler knowledge, but require software recompilation. Checkpoint-free.…”

Section: Non-speculative Structure Releasementioning

confidence: 99%

See 1 more Smart Citation

Maximizing Limited Resources: a Limit-Based Study and Taxonomy of Out-of-Order Commit

Alipour

Carlson

Black-Schaffer

2018

J Sign Process Syst

View full text Add to dashboard Cite

Out-of-order execution is essential for high performance, general-purpose computation, as it can find and execute useful work instead of stalling. However, it is typically limited by the requirement of visibly sequential, atomic instruction execution-in other words, in-order instruction commit. While in-order commit has a number of advantages, such as providing precise interrupts and avoiding complications with the memory consistency model, it requires the core to hold on to resources (reorder buffer entries, load/store queue entries, physical registers) until they are released in program order. In contrast, out-of-order commit can release some resources much earlier, yielding improved performance and/or lower resource requirements. Non-speculative out-of-order commit is limited in terms of correctness by the conditions described in the work of Bell and Lipasti (2004). In this paper we revisit out-of-order commit by examining the potential performance benefits of lifting these conditions one by one and in combination, for both non-speculative and speculative out-of-order commit. While correctly handling recovery for all out-of-order commit conditions currently requires complex tracking and expensive checkpointing, this work aims to demonstrate the potential for selective, speculative out-of-order commit using an oracle implementation without speculative rollback costs. Through this analysis of the potential of out-of-order commit, we learn that: a) there is significant untapped potential for aggressive variants of out-of-order commit; b) it is important to optimize the out-of-order commit depth for a balanced design, as smaller cores benefit from reduced depth while larger cores continue to benefit from deeper designs; c) the focus on implementing only a subset of the out-of-order commit conditions could lead to efficient implementations; d) the benefits of out-of-order commit increases with higher memory latency and in conjunction with prefetching; e) out-of-order commit exposes additional parallelism in the memory hierarchy.

show abstract

“…Two previous works [1,13] allow for early commit or reclaim of resources based on compiler knowledge, but require software recompilation. Checkpoint-free.…”

Section: Non-speculative Structure Releasementioning

confidence: 99%

“…Checkpoint-free. A number of solutions do not use checkpoints [5,13,21] and therefore do not require speculation (they respect the all commit conditions) or used software help to extend knowledge to the hardware. Selective early commit.…”

Section: Non-speculative Structure Releasementioning

confidence: 99%

Maximizing Limited Resources: a Limit-Based Study and Taxonomy of Out-of-Order Commit

Alipour

Carlson

Black-Schaffer

2018

J Sign Process Syst

View full text Add to dashboard Cite

show abstract

A Novel Multi-level Integrated Roofline Model Approach for Performance Characterization

Koskela

Matveev²,

Yang

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

With energy-efficient architectures, including accelerators and many-core processors, gaining traction, application developers face the challenge of optimizing their applications for multiple hardware features including many-core parallelism, wide processing vector-units and onchip high-bandwidth memory. In this paper, we discuss the development and utilization of a new application performance tool based on an extension of the classical roofline-model for simultaneously profiling multiple levels in the cache-memory hierarchy. This tool presents a powerful visual aid for the developer and can be used to frame the many-dimensional optimization problem in a tractable way. We show case studies of real scientific applications that have gained insights from the Integrated Roofline Model.

show abstract

Exploring the Performance Limits of Out-of-order Commit

Alipour

Carlson

2017

Proceedings of the Computing Frontiers Conference

View full text Add to dashboard Cite

Compiler-assisted, selective out-of-order commit

Cited by 6 publications

References 7 publications

Maximizing Limited Resources: a Limit-Based Study and Taxonomy of Out-of-Order Commit

Maximizing Limited Resources: a Limit-Based Study and Taxonomy of Out-of-Order Commit

A Novel Multi-level Integrated Roofline Model Approach for Performance Characterization

Exploring the Performance Limits of Out-of-order Commit

Contact Info

Product

Resources

About