首页> 外文会议>Annual IEEE International ASIC/SOC Conference >An oldest-first selection logic implementation for non-compacting issue queues
【24h】

An oldest-first selection logic implementation for non-compacting issue queues

机译:用于非压缩问题队列的最旧的选择逻辑实现

获取原文

摘要

Microprocessor power dissipation is a growing concern, so much so that it threatens to limit future performance improvements. A major consumer of microprocessor power is the issue queue. Many microprocessors, such as the Compaq Alpha 21264 and IBM POWER4, use a compacting latch-based issue queue design which has the advantage of simplicity of design and verification. The disadvantage of this structure, however, is its high power dissipation. In this paper, we propose a new selection logic implementation in conjunction with a non-compacting issue queue. This scheme achieves comparable delays to the existing position-based selection approach used for compacting issue queues, yet results in far less power with a small performance loss.
机译:微处理器功耗是一个不断增长的问题,因此可能会限制未来的绩效改进。微处理器权力的主要消费者是问题队列。许多微处理器,例如Compaq Alpha 21264和IBM Power4,使用压缩的锁存器的发布队列设计,其具有简单设计和验证的优点。然而,这种结构的缺点是其高功耗。在本文中,我们建议结合非压缩问题队列的新选择逻辑实现。该方案实现了用于压缩问题队列的现有位置的选择方法的可比延迟,但具有较小的性能损失导致的功率远远较低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号