公开(公告)号：WO2007035904A1

公开(公告)日：2007-03-29

申请号：PCT/US2006/036938

申请日：2006-09-21

Applicant: QUALCOMM INCORPORATED ,  STEMPEL, Brian, Michael ,  DIEFFENDERFER, James, Norris ,  BRIDGES, Jeffrey, Todd ,  SARTORIUS, Thomas, Andrew ,  SMITH, Rodney, Wayne ,  CLANCY, Robert, Douglas ,  AUGSBURG, Victor, Roberts

Inventor： STEMPEL, Brian, Michael ,  DIEFFENDERFER, James, Norris ,  BRIDGES, Jeffrey, Todd ,  SARTORIUS, Thomas, Andrew ,  SMITH, Rodney, Wayne ,  CLANCY, Robert, Douglas ,  AUGSBURG, Victor, Roberts

IPC: G06F12/12

CPC classification number: G06F12/126

Abstract: A method of managing cache partitions provides a first pointer for higher priority writes and a second pointer for lower priority writes, and uses the first pointer to delimit the lower priority writes. For example, locked writes have greater priority than unlocked writes, and a first pointer may be used for locked writes, and a second pointer may be used for unlocked writes. The first pointer is advanced responsive to making locked writes, and its advancement thus defines a locked region and an unlocked region. The second pointer is advanced responsive to making unlocked writes. The second pointer also is advanced (or retreated) as needed to prevent it from pointing to locations already traversed by the first pointer. Thus, the first pointer delimits the unlocked region and allows the locked region to grow at the expense of the unlocked region.

Abstract translation: 管理高速缓存分区的方法提供用于较高优先级的写入的第一指针和用于较低优先级写入的第二指针，并且使用第一指针来划分较低优先级的写入。 例如，锁定的写入具有比解锁的写入更高的优先级，并且第一指针可以用于锁定的写入，并且第二指针可以用于解锁的写入。 响应于锁定写入，第一指针是高级的，并且其进步因此定义了锁定区域和解锁区域。 响应于解锁写入，第二个指针是高级的。 第二个指针也根据需要进行高级（或撤销），以防止它指向已经被第一个指针所遍历的位置。 因此，第一指针限定未锁定区域，并允许锁定区域以解锁区域为代价而增长。

公开(公告)号：WO2006124410A3

公开(公告)日：2007-09-20

申请号：PCT/US2006017899

申请日：2006-05-08

Applicant: QUALCOMM INC ,  DOCKSER KENNETH ALAN ,  AUGSBURG VICTOR ROBERTS ,  DIEFFENDERFER JAMES NORRIS ,  BRIDGES JEFFREY TODD ,  CLANCY ROBERT DOUGLAS ,  SARTORIUS THOMAS ANDREW

Inventor： DOCKSER KENNETH ALAN ,  AUGSBURG VICTOR ROBERTS ,  DIEFFENDERFER JAMES NORRIS ,  BRIDGES JEFFREY TODD ,  CLANCY ROBERT DOUGLAS ,  SARTORIUS THOMAS ANDREW

IPC: G06F13/38

CPC classification number: G06F13/4059 ,  G06F5/06 ,  G06F2205/126

Abstract: Data from a source domain (311 ) operating at a first data rate is transferred to a FIFO (319) in another domain (313) operating at a different data rate. The FIFO (319) buffers data before transfer to a sink for further processing or storage. A source side counter (325) tracks space available in the FIFO. In disclosed examples, the initial counter value corresponds to FIFO depth. The counter (325) decrements in response to a data ready signal from the source domain (311)1 without delay. The counter (325) increments in response to signaling from the sink domain (313) of a read of data off the FIFO (319). Hence, incrementing is subject to the signaling latency between domains. The source (315) may send one more beat of data when the counter (325) indicates the FIFO (319) is full. The last beat of data is continuously sent from the source until it is indicated that a FIFO position became available; effectively providing one o more FIFO positions.

Abstract translation: 来自以第一数据速率运行的源域（311）的数据被传送到以不同数据速率工作的另一域（313）中的FIFO（319）。 FIFO（319）在传输到宿之前缓冲数据以进一步处理或存储。 源侧计数器（325）跟踪FIFO中可用的空间。 在所公开的示例中，初始计数器值对应于FIFO深度。 计数器（325）响应于来自源域（311）1的数据就绪信号而没有延迟地递减。 计数器（325）响应于来自接收器域（313）的从FIFO（319）读取的数据的信令而递增。 因此，增量受到域之间的信令等待时间的限制。 当计数器（325）指示FIFO（319）已满时，源（315）可以再发送一个数据节拍。 数据的最后一次节拍从源头连续发送到指示FIFO位置可用为止; 有效提供一个以上的FIFO位置。

公开(公告)号：WO2006124410A2

公开(公告)日：2006-11-23

申请号：PCT/US2006/017899

申请日：2006-05-08

Applicant: QUALCOMM INCORPORATED ,  DOCKSER, Kenneth, Alan ,  AUGSBURG, Victor, Roberts ,  DIEFFENDERFER, James, Norris ,  BRIDGES, Jeffrey, Todd ,  CLANCY, Robert, Douglas ,  SARTORIUS, Thomas, Andrew

Inventor： DOCKSER, Kenneth, Alan ,  AUGSBURG, Victor, Roberts ,  DIEFFENDERFER, James, Norris ,  BRIDGES, Jeffrey, Todd ,  CLANCY, Robert, Douglas ,  SARTORIUS, Thomas, Andrew

IPC: G06F13/38

CPC classification number: G06F13/4059 ,  G06F5/06 ,  G06F2205/126

Abstract: Data from a source domain operating at a first data rate is transferred to a FIFO in another domain operating at a different data rate. The FIFO buffers data before transfer to a sink for further processing or storage. A source side counter tracks space available in the FIFO. In disclosed examples, the initial counter value corresponds to FIFO depth. The counter decrements in response to a data ready signal from the source domain, without delay. The counter increments in response to signaling from the sink domain of a read of data off the FIFO. Hence, incrementing is subject to the signaling latency between domains. The source may send one more beat of data when the counter indicates the FIFO is full. The last beat of data is continuously sent from the source until it is indicated that a FIFO position became available; effectively providing one more FIFO position.

Abstract translation: 来自以第一数据速率运行的源域的数据被传送到以不同数据速率操作的另一域中的FIFO。 FIFO在传输到接收器之前缓冲数据以进一步处理或存储。 源侧计数器跟踪FIFO中可用的空间。 在所公开的示例中，初始计数器值对应于FIFO深度。 响应于来自源域的数据就绪信号，计数器无延迟地递减。 计数器响应来自接收器域的信令从FIFO的数据读取而递增。 因此，增量受到域之间的信令等待时间的限制。 当计数器指示FIFO已满时，源可能再发送一次数据。 数据的最后一次节拍从源头连续发送到指示FIFO位置可用为止; 有效提供一个FIFO位置。