会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Hardware interface between a switch adapter and a communications
subsystem in a data processing system
    • 交换适配器与数据处理系统中的通信子系统之间的硬件接口
    • US06111894A
    • 2000-08-29
    • US920084
    • 1997-08-26
    • Carl A. BenderPaul D. DiNicolaKevin J. GildeaRama K. GovindarajuChulho KimJamshed H. MirzaGautam H. Shah
    • Carl A. BenderPaul D. DiNicolaKevin J. GildeaRama K. GovindarajuChulho KimJamshed H. MirzaGautam H. Shah
    • H04L29/06G06F3/00
    • H04L29/06H04L69/161H04L69/164H04L69/16
    • Method, apparatus and program product for communicating from a node to a communications device. A Hardware Abstraction Layer (HAL) provides functions which can be called from user space in a node to access the communications device. An instance of HAL is created in the node. Device specific characteristics from the communications device and a pointer pointing to HAL functions for accessing the communications device are obtained by HAL. HAL then opens multiple ports on the communications device using the functions pointed to by the pointer, and messages are sent between the node and the communications device. The messages thus sent are optimized with respect to the communications device as determined by the obtained device specific characteristics. Multiple processes and protocol stacks may be associated with each port in a single instance of HAL. A further embodiment provides that multiple virtual ports may be associated with a port, with a multiple protocol stacks associated with each virtual port. A further embodiment provides that multiple communications devices may be associated with a single instance of HAL.
    • 用于从节点到通信设备进行通信的方法,装置和程序产品。 硬件抽象层(HAL)提供可从节点中的用户空间调用以访问通信设备的功能。 在节点中创建HAL的一个实例。 来自通信设备的设备特定特征和指向HAL功能的指针用于访问通信设备,由HAL获得。 然后,HAL使用指针指向的功能在通信设备上打开多个端口,并且在节点和通信设备之间发送消息。 如此发送的消息相对于通过所获得的设备特定特性确定的通信设备进行了优化。 多个进程和协议栈可能与HAL的单个实例中的每个端口相关联。 另一实施例提供了多个虚拟端口可以与端口相关联,其中多个协议栈与每个虚拟端口相关联。 另一实施例提供多个通信设备可以与HAL的单个实例相关联。
    • 5. 发明授权
    • Automatic cache bypass for instructions exhibiting poor cache hit ratio
    • 自动缓存旁路,用于显示较差的缓存命中率的指令
    • US5625793A
    • 1997-04-29
    • US685583
    • 1991-04-15
    • Jamshed H. Mirza
    • Jamshed H. Mirza
    • G06F9/38G06F12/08G06F17/16G06F12/12
    • G06F9/383G06F12/0888
    • A cache bypass mechanism automatically avoids caching of data for instructions whose data references, for whatever reason, exhibit low cache hit ratio. The mechanism keeps a record of an instruction's behavior in the immediate past, and this record is used to decide whether its future references should be cached or not. If an instruction is experiencing bad cache hit ratio, it is marked as non-cacheable, and its data references are made to bypass the cache. This avoids the additional penalty of unnecessarily fetching the remaining words in the line, reduces the demand on the memory bandwidth, avoids flushing the cache of useful data and, in parallel processing environments, prevents line thrashing. The cache management scheme is automatic and requires no compiler or user intervention.
    • 缓存旁路机制可以自动避免对数据缓存数据,因为无论什么原因,数据引用都会显示低缓存命中率。 该机制保持了一个指令在过去的行为的记录,并且该记录用于决定其未来的引用是否应被缓存。 如果指令遇到不良缓存命中率,则会将其标记为不可缓存,并将其数据引用绕过缓存。 这避免了不必要地取出行中剩余单词的额外损失,减少了对存储器带宽的需求,避免了刷新有用数据的缓存,并且在并行处理环境中可以防止线路颠覆。 缓存管理方案是自动的,不需要编译器或用户干预。
    • 6. 发明授权
    • Cache prefetch and bypass using stride registers
    • 缓存预取和旁路使用stride寄存器
    • US5357618A
    • 1994-10-18
    • US686221
    • 1991-04-15
    • Jamshed H. MirzaSteven W. White
    • Jamshed H. MirzaSteven W. White
    • G06F9/32G06F9/312G06F9/345G06F9/38G06F12/08G06F13/14
    • G06F9/30043G06F12/0862G06F9/30032G06F9/3013G06F9/3455G06F9/383G06F2212/6026G06F2212/6028G06F8/4442
    • A technique and a mechanism accurately determines the correct prefetch line for loops with strides of 1, N, or a combination of stride values. Stride registers are used to assist in prefetching. Furthermore, stride register values can be used to specify "cacheability" of data on an object by object basis to prevent "cache flushing". The compiler uses a new instruction, "MOVE GPR TO STRIDE REGISTER", prior to a loop to insert the "calculated stride value(s)" into the stride register(s) associated with the index register(s) which will be incremented by that stride value. At the end of the loop, a second new instruction, "CLEAR STRIDE REGISTER SET", is used to place a value of zero in all of the stride registers to inhibit prefetching of data which would most likely not be used. A zero value in the stride registers inhibits prefetching. Non-zero values in the stride registers clearly mark the execution of a loop, which is where prefetching makes the most sense. It also clearly indicates the correct offset from the current address to use in determining the prefetch address. Since the offset is dependent on the particular index register used in specifying the storage address, data for loops with multiple strides can be correctly prefetched. A hardware managed set of stride registers provides a subset of the benefits afforded by the software managed implementation.
    • 技术和机制准确地确定了具有1,N的步幅或步幅值的组合的循环的正确预取行。 Stride寄存器用于辅助预取。 此外,可以使用步幅寄存器值来指定对象上的数据的“缓存”,以防止“缓存刷新”。 在循环之前,编译器使用新的指令“MOVE GPR TO STRIDE REGISTER”,将“计算出的步幅值”插入到与索引寄存器相关联的步幅寄存器中,该寄存器将被递增 那一步的价值。 在循环结束时,第二个新指令“CLEAR STRIDE REGISTER SET”用于在所有的步幅寄存器中设置一个零值,以禁止最可能不使用的数据预取。 步幅寄存器中的零值禁止预取。 步进寄存器中的非零值清楚地标记循环的执行,这是预取最有意义的地方。 它还清楚地指出了与确定预取地址时使用的当前地址的正确偏移。 由于偏移取决于用于指定存储地址的特定索引寄存器,因此可以正确预取具有多个步长的循环的数据。 硬件管理的步进寄存器集提供了软件管理实现提供的一些优点。
    • 8. 发明授权
    • Dynamic look-aside table for multiple size pages
    • 用于多个大小页面的动态查看表
    • US5475827A
    • 1995-12-12
    • US223366
    • 1994-04-01
    • Jeffery Y. LeeJamshed H. MirzaRobert J. Stanton, Jr.
    • Jeffery Y. LeeJamshed H. MirzaRobert J. Stanton, Jr.
    • G06F12/10
    • G06F12/1036G06F2212/652G06F2212/681
    • A dynamic address translation (DAT) mechanism which supports virtual memory pages of different sizes with minimal hardware and design impact. The dynamic look-aside table (DLAT) is modified to allow the addition of a second page size to system architecture. In one approach, the DLAT is divided into two sections, one for small (4KB) pages and one for large (1MB) pages. A steering table indicates whether the segment last contained 4KB pages or a 1MB page. As each segment is translated by the DAT mechanism, the page size (1MB or 4KB) contained in the segment is known, and this information is used to select the address bus used for indexing the DLAT. In an alternative approach, the DLAT is not divided into sections; rather, it can interchangeably hold/test/select either of the two different formats in any entry. The steering table dynamically changes the way in which the DLAT is addressed and selects the bits of the entry to be used in the translation.
    • 动态地址转换(DAT)机制,支持不同大小的虚拟内存页面,最小的硬件和设计影响。 动态看门狗表(DLAT)被修改为允许将第二页大小添加到系统架构。 在一种方法中,DLAT被分为两部分,一部分用于小型(4KB)页面,另一个用于大型(1MB)页面。 转向表指示该段最后是否包含4KB页面或1MB页面。 由于每个段由DAT机制翻译,段中包含的页面大小(1MB或4KB)是已知的,并且该信息用于选择用于索引DLAT的地址总线。 在另一种方法中,DLAT不分为几部分; 相反,它可以互换地保存/测试/选择任何条目中的两种不同格式之一。 转向表动态地改变DLAT的寻址方式,并选择要在转换中使用的条目的位。