Patents by Inventor Steven A. Przybylski

Steven A. Przybylski has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8594110
    Abstract: In a ring-of-clusters network topology, groups of slave devices are accessed in parallel, such that the latency around the ring is proportional to the number of clusters and not proportional to the number of integrated circuits. The devices of a cluster share input and output ring segments such that packets arriving on the input segment are received and interpreted by all the devices in a cluster. In other embodiments, none, some or all but one slaves per cluster are asleep or otherwise disabled so that they do not input and interpret incoming packets. Regardless, in all embodiments, the slaves of a cluster cooperate, potentially under the controller's direction, to ensure that at most one of them is actively driving the output segment at any given time. The devices may be addressed through a device ID, a cluster ID, or a combination thereof. Embodiments of the invention are suited to exploit multi-chip module implementations and forms of vertical circuit stacking.
    Type: Grant
    Filed: January 11, 2008
    Date of Patent: November 26, 2013
    Assignee: MOSAID Technologies Incorporated
    Inventor: Steven A. Przybylski
  • Publication number: 20090180483
    Abstract: In a ring-of-clusters network topology, groups of slave devices are accessed in parallel, such that the latency around the ring is proportional to the number of clusters and not proportional to the number of integrated circuits. The devices of a cluster share input and output ring segments such that packets arriving on the input segment are received and interpreted by all the devices in a cluster. In other embodiments, none, some or all but one slaves per cluster are asleep or otherwise disabled so that they do not input and interpret incoming packets. Regardless, in all embodiments, the slaves of a cluster cooperate, potentially under the controller's direction, to ensure that at most one of them is actively driving the output segment at any given time. The devices may be addressed through a device ID, a cluster ID, or a combination thereof. Embodiments of the invention are suited to exploit multi-chip module implementations and forms of vertical circuit stacking.
    Type: Application
    Filed: January 11, 2008
    Publication date: July 16, 2009
    Inventor: Steven A. Przybylski
  • Publication number: 20080155219
    Abstract: A plurality of memory devices (e.g., DRAMs, SRAMs, NAND Flash, NOR Flash) is serially interconnected. Each of the interconnected devices receives a device identifier (ID) and latches it as its ID. Each device includes a circuit for calculating another ID or an incremented ID to generate it. The generated ID is transferred to another device and the ID is incremented in each of the devices in the serial interconnection. The last device in the interconnection provides a last generated ID that is provided to a memory controller having a recognition circuit that recognizes the total number of the serially interconnected devices, from the provided last generated ID. The recognition circuit recognizes the total output latency of the devices in the serial interconnection.
    Type: Application
    Filed: December 20, 2006
    Publication date: June 26, 2008
    Applicant: MOSAID TECHNOLOGIES INCORPORATED
    Inventors: Hong Beom PYEON, HakJune OH, Jin-Ki KIM, Steven A. PRZYBYLSKI
  • Patent number: 5113506
    Abstract: A cache-based computer architecture is disclosed in which the address generating unit and the tag comparator are packaged together and separately from the cache RAMs. If the architecture supports virtual memory, an address translation unit may be included on the same chip as, and logically between, the address generating unit and the tag comparator logic. Further, interleaved access to more than one cache may be accomplished on the external address, data and the tag busses.
    Type: Grant
    Filed: March 9, 1990
    Date of Patent: May 12, 1992
    Assignee: MIPS Computer Systems, Inc.
    Inventors: John P. Moussouris, Lester M. Crudele, Steven A. Przybylski
  • Patent number: 4959779
    Abstract: A CPU or other function unit is disclosed which follows one data ordering scheme internally, and in which incoming and/or outgoing data pass through a data order conversion unit for adapting it to a selectable external data ordering scheme. The means for specifying the external data ordering scheme is accessible from outside the physical package(s) in which the functional unit is housed. The data order conversion unit may comprise a load aligner and/or a store aligner, one or both of which may comprise means for shifting informational units of a smaller size within informational units of a larger size. The shift amount may derive from the low order address bits and may be altered depending on the external data ordering means selected.
    Type: Grant
    Filed: November 28, 1988
    Date of Patent: September 25, 1990
    Assignee: Mips Computer Systems, Inc.
    Inventors: Larry B. Weber, Craig C. Hansen, Thomas J. Riordan, Steven A. Przybylski
  • Patent number: 4953073
    Abstract: A cache-based computer architecture has the address generating unit and the tag comparator packaged together and separately from the cache RAMS. If the architecture supports virtual memory, an address translation unit may be included on the same chip as, and logically between, the address generating unit and the tag comparator logic. Further, interleaved access to more than one cache may be accomplished on the external address, data and tag busses.
    Type: Grant
    Filed: February 6, 1986
    Date of Patent: August 28, 1990
    Assignee: MIPS Computer Systems, Inc.
    Inventors: John P. Moussouris, Lester M. Crudele, Steven A. Przybylski