会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • System for synchronizing execution by a processing element of threads
within a process using a state indicator
    • 用于通过使用状态指示符的进程内的线程的处理元件同步执行的系统
    • US5553305A
    • 1996-09-03
    • US914686
    • 1992-07-15
    • Steven L. GregorRobert A. Iannucci
    • Steven L. GregorRobert A. Iannucci
    • G06F9/46G06F9/48G06F9/52G06F15/16G06F15/177
    • G06F9/4843G06F9/52G06F2209/503
    • A method and system for synchronizing execution by a processing element of threads within a process. Before execution of a thread commences, a determination is made as to whether all of the required resources for execution of the thread are available in a cache local to the processing element. If the resources are not available, then the resources are fetched from main storage and stored in one or more local caches before execution begins. If the resources are available, then execution of the thread may begin. During execution of the thread and, in particular, an instruction within the thread, the instruction may require data in order to successfully complete its execution. When this occurs, a determination is made as to whether the necessary data is available. If the data is available, the result of the instruction execution is stored and execution of the thread continues. However, if the data is unavailable, then the thread is deferred until the data becomes available and a new thread is processed. When deferring a thread, the thread is placed in the memory location which is to receive the required data. Once the data is available, the thread is removed from the data location and placed on a queue for execution and the data is stored in the location.
    • 一种用于通过进程内的线程的处理元件同步执行的方法和系统。 在执行线程开始之前,确定用于执行线程的所有所需资源是否在处理元件本地的高速缓存中可用。 如果资源不可用,则在执行开始之前资源从主存储器获取并存储在一个或多个本地高速缓存中。 如果资源可用,则可以开始执行线程。 在执行线程期间,特别是线程内的指令时,指令可能需要数据才能成功完成其执行。 当发生这种情况时,确定所需数据是否可用。 如果数据可用,则存储指令执行的结果并继续执行线程。 然而,如果数据不可用,则线程被延迟,直到数据变得可用并且处理新的线程。 延迟线程时,线程被放置在要接收所需数据的存储器位置。 一旦数据可用,线程将从数据位置中删除并放置在队列上执行,数据存储在该位置。
    • 2. 发明授权
    • High performance memory system utilizing pipelining techniques
    • 采用流水线技术的高性能内存系统
    • US4685088A
    • 1987-08-04
    • US722920
    • 1985-04-15
    • Robert A. Iannucci
    • Robert A. Iannucci
    • G11C7/00G06F12/00G06F13/16G06F17/16G11C7/10G11C8/08G11C11/401G11C11/413G11C8/00
    • G06F13/1615G06F13/161G11C7/1039G11C8/08
    • A novel memory system is disclosed which utilizes pipelining techniques to read data from a memory array and to write data to a memory array. More data may be read from the novel memory system, within a unit of time, relative to the amount of data which may be read from a conventional memory system during the unit of time. The novel memory system comprises a plurality of standard elements which include a memory array, including a plurality of rows and columns, a row decoder, a row driver, column sense amplifiers, and a column multiplexer. However, the novel memory system further includes latch circuits interposed between the row decoder and the row driver, between the row driver and the memory array, between the memory array and the column sense amplifiers, and between the column sense amplifiers and the column multiplexer. The same number of latch circuits are interposed in serial fashion between the incoming row and column address bus and the column multiplexer. Consequently, as a result of the use of these latch circuits in a memory system, pipelining techniques are utilized in the memory system for the improvement of the performance of the memory system.
    • 公开了一种新颖的存储器系统,其利用流水线技术从存储器阵列读取数据并将数据写入存储器阵列。 相对于在单位时间内可以从常规存储器系统读取的数据量,可以在时间单位内从新颖存储器系统读取更多的数据。 新颖的存储器系统包括多个标准元件,其包括包括多个行和列的存储器阵列,行解码器,行驱动器,列读出放大器和列复用器。 然而,新颖的存储器系统还包括插入行解码器和行驱动器之间的行驱动器和存储器阵列之间,存储器阵列和列读出放大器之间以及列读出放大器和列复用器之间的锁存电路。 在输入行和列地址总线和列多路复用器之间以串行方式插入相同数量的锁存电路。 因此,作为在存储器系统中使用这些锁存电路的结果,在存储器系统中利用流水线技术来改善存储器系统的性能。
    • 3. 发明授权
    • Method and apparatus for division employing associative memory
    • 使用关联记忆的划分方法和装置
    • US4466077A
    • 1984-08-14
    • US305765
    • 1981-09-25
    • Robert A. IannucciJames R. Kleinsteiber
    • Robert A. IannucciJames R. Kleinsteiber
    • G06F7/493G06F7/496G06F7/52G06F7/533G06F7/535G06F7/544
    • G06F7/535G06F7/4917G06F2207/5353
    • A method and apparatus for the arithmetic division operation is disclosed in which a set of multiples of the divisor are stored in an associative memory in addresses which match the respective multiples. The most significant byte of the numerator is then compared to the contents of each associative entry. A flag is generated signifying that the corresponding entry is less than or equal to the most significant byte of the numerator. After the flags have been generated, the address of the last flag which is on, is selected. This provides a trial "digit out", which is used to address the true table of multiples and select a value which is subtracted from the left-digit-shifted numerator (or intermediate result). If no underflow condition results, the trial "digit out" is valid and should be stored and the next iteration started. For an underflow condition, the "digit out" is decremented and stored, the X1 multiple is added to the numerator and the next iteration is carried out. If the flag indicating X8 is on or at a value of 1, an X8 latch is set and a second pass is carried out, with the X8 latch output becoming part of the "digit out".
    • 公开了一种用于算术分割操作的方法和装置,其中除数的一组倍数存储在与各个倍数匹配的地址中的关联存储器中。 然后将分子的最高有效字节与每个关联条目的内容进行比较。 生成一个标志,表示对应的条目小于或等于分子的最高有效字节。 标志生成后,选择最后一个标志位的地址。 这提供了一个试验“数字输出”,用于解决真实的多个表,并选择从左数位移分子(或中间结果)中减去的值。 如果没有下溢条件结果,试用“数字输出”是有效的,应该被存储并且下一次迭代开始。 对于下溢条件,“数字输出”递减并存储,将X1倍数加到分子中,并进行下一次迭代。 如果指示X8的标志为1或值为1,则X8锁存器被设置并执行第二遍,X8锁存器输出成为“数字输出”的一部分。