专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

2. 发明申请

WO2010013189A3 DATA PROCESSING CIRCUIT WITH ARBITRATION BETWEEN A PLURALITY OF QUEUES 审中-公开
标题翻译：具有多个队列之间仲裁的数据处理电路
公开(公告)号：WO2010013189A3
公开(公告)日：2010-03-25
申请号：PCT/IB2009053260
申请日：2009-07-27
申请人： NXP BV , HENRIKSSON TOMAS , STEFFENS ELISABETH FRANCISCA M
发明人： HENRIKSSON TOMAS , STEFFENS ELISABETH FRANCISCA MARIA
IPC分类号： G06F13/16
CPC分类号： G06F12/00 , G06F13/1642
摘要： Requests from a plurality of different agents (10) are passed to a request handler via a request concentrator. In front of the request concentrator the requests are queued in a plurality of queues (12). A first one of the agents is configured to issue a priority changing command with a defined position relative to pending requests issued by the first one of the agents (10) to the first one of the queues (12). An arbiter (16), makes successive selections selecting queues (12) from which the request concentrator (14) will pass requests to the request handler (18), based on relative priorities assigned to the queues (12). The arbiter (16) responds to the priority changing command by changing the priority of the first one of the queues (12), selectively for a duration while the pending requests up to the defined position are in the first one of the queues (12). Different queues may be provided for read and write requests from the first one of the agents. In this case, the priority raising request from the agent may be used to raise the priority level of the write queue temporarily to the level of the read queue, until all write requests issued before the priority raising command from the agent have been passed to the request handler.
摘要翻译：通过请求集中器将来自多个不同代理（10）的请求传递给请求处理程序。在请求集中器之前，请求在多个队列（12）中排队。第一代理被配置为发出具有相对于第一代理（10）向队列（12）中的第一队列发出的未决请求的定义位置的优先级改变命令。仲裁器（16）基于分配给队列（12）的相对优先级，进行选择队列（12）的连续选择，请求集中器（14）将根据队列（12）将请求传递到请求处理器（18）。仲裁器（16）通过改变第一个队列（12）的优先级，选择性地持续一段时间，直到到定义位置的未决请求在队列（12）中的第一个队列中时，仲裁器（16）。可以为来自第一个代理的读取和写入请求提供不同的队列。在这种情况下，来自代理的优先级提升请求可用于将写入队列的优先级暂时提高到读取队列的级别，直到在来自代理的优先级提升命令之前发出的所有写入请求已被传递给请求处理器。

IPRDB

热门服务

关于我们

友情链接

联系方式