公开(公告)号：US11926350B2

公开(公告)日：2024-03-12

申请号：US16967968

申请日：2019-03-04

Applicant: NOWE GMBH

Inventor： Alexander Reich ,  Luc George Imbert ,  Matteo Frea

IPC: B61C15/10 ,  B61C17/08 ,  B61K3/02 ,  E05B47/00 ,  F16N13/16 ,  F16N15/02 ,  G06F12/06 ,  G07C9/00

CPC classification number: B61C15/102 ,  B61C15/107 ,  B61C17/08 ,  B61K3/02 ,  E05B47/00 ,  F16N13/16 ,  F16N15/02 ,  G06F12/0669 ,  G06F12/0684 ,  G07C9/00912 ,  E05B2047/0071 ,  F16N2270/20 ,  F16N2280/02 ,  F16N2280/04

Abstract: A device and method for dispensing a friction-coefficient-optimizing mixture of at least one lubricant and at least one grit into the gap between a rail wheel of a rail vehicle and a rail. The device includes a reservoir for the lubricant, a reservoir for the grit, a metering unit for metering the lubricant, a metering unit for metering the grit, a delivery apparatus for delivering the lubricant, a delivery apparatus for delivering the grit, and a common dispensing nozzle. The apparatus for delivering the lubricant and the apparatus for delivering the grit are separate from each other and end in the common dispensing nozzle, the friction-coefficient-optimizing mixture therefore not being formed until the dispensing, and an additional compressed air line is provided, which ends in the common dispensing nozzle.

公开(公告)号：US11803453B1

公开(公告)日：2023-10-31

申请号：US17213560

申请日：2021-03-26

Applicant: PURE STORAGE, INC.

Inventor： Brian Bunker ,  Krishna Kant ,  Ronald Karr

IPC: G06F11/20 ,  H04L45/12 ,  G06F16/178 ,  G06F16/182 ,  G06F3/06 ,  G06F12/06 ,  G06F12/1072 ,  G06F16/27 ,  G06F11/07 ,  G06F11/14 ,  G06F9/445 ,  H04L67/1095 ,  H04L67/1097 ,  H04L45/00 ,  H04L47/125

CPC classification number: G06F11/2076 ,  G06F3/061 ,  G06F3/0604 ,  G06F3/065 ,  G06F3/0632 ,  G06F3/0659 ,  G06F3/0683 ,  G06F9/44505 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/1464 ,  G06F11/2064 ,  G06F11/2082 ,  G06F12/0684 ,  G06F12/1072 ,  G06F16/178 ,  G06F16/182 ,  G06F16/1844 ,  G06F16/27 ,  G06F16/275 ,  H04L45/12 ,  G06F3/067 ,  G06F11/2053 ,  G06F2003/0697 ,  H04L45/38 ,  H04L47/125 ,  H04L67/1095 ,  H04L67/1097

Abstract: Using host connectivity states to avoid queuing I/O requests: identifying a fault in data communications between a first storage system and a second storage system among a plurality of storage systems across which a dataset is synchronously replicated; updating, upon identifying the fault, an access state of a data communications path between first storage system and a host from an active state to a transitional state with respect to the dataset; and indicating, to the host, a first access state change.

公开(公告)号：US20230289267A1

公开(公告)日：2023-09-14

申请号：US18309924

申请日：2023-05-01

Applicant: PURE STORAGE, INC.

Inventor： DAVID GRUNWALD ,  RONALD KARR ,  THOMAS GILL ,  JOHN COLGROVE ,  KUNAL TRIVEDI

IPC: G06F11/20 ,  G06F3/06 ,  G06F16/178 ,  G06F16/182 ,  G06F12/06 ,  G06F12/1072 ,  G06F16/27 ,  G06F11/07 ,  G06F11/14 ,  G06F9/445 ,  H04L45/12

CPC classification number: G06F11/2076 ,  G06F11/2064 ,  G06F3/067 ,  G06F16/178 ,  G06F16/1844 ,  G06F16/182 ,  G06F3/061 ,  G06F12/0684 ,  G06F12/1072 ,  G06F11/2082 ,  G06F16/27 ,  G06F11/0727 ,  G06F11/1464 ,  G06F3/0604 ,  G06F3/0632 ,  G06F3/065 ,  G06F3/0659 ,  G06F3/0683 ,  G06F16/275 ,  G06F9/44505 ,  G06F11/0751 ,  H04L45/12 ,  G06F11/1471 ,  G06F3/0619 ,  H04L67/1095

Abstract: Continuing to service a dataset after prevailing in mediation, including: requesting, by a first storage system, mediation from a mediation service that is configured to resolve which storage system continues to service a dataset after the triggering event, wherein the dataset is synchronously replicated by a plurality of storage systems that includes the first storage system and a second storage system; and detaching the second storage system from a plurality of storage systems synchronously replicating the dataset.

公开(公告)号：US11698844B2

公开(公告)日：2023-07-11

申请号：US17825031

申请日：2022-05-26

Applicant: PURE STORAGE, INC.

Inventor： Ronald Karr ,  David Grunwald ,  Naveen Neelakantam ,  Zoheb Shivani ,  Thomas Gill ,  Connor Brooks ,  Aswin Karumbunathan ,  Kunal Trivedi

IPC: G06F12/00 ,  G06F11/20 ,  G06F3/06 ,  G06F16/178 ,  G06F16/182 ,  G06F12/06 ,  G06F12/1072 ,  G06F16/27 ,  G06F11/07 ,  G06F11/14 ,  G06F9/445 ,  H04L45/12 ,  H04L67/1095 ,  H04L67/1097 ,  H04L45/00 ,  H04L47/125

CPC classification number: G06F11/2076 ,  G06F3/061 ,  G06F3/0604 ,  G06F3/065 ,  G06F3/067 ,  G06F3/0619 ,  G06F3/0632 ,  G06F3/0659 ,  G06F3/0683 ,  G06F9/44505 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/1464 ,  G06F11/1471 ,  G06F11/2064 ,  G06F11/2082 ,  G06F12/0684 ,  G06F12/1072 ,  G06F16/178 ,  G06F16/182 ,  G06F16/1844 ,  G06F16/27 ,  G06F16/275 ,  H04L45/12 ,  G06F3/06 ,  G06F11/2053 ,  G06F2003/0697 ,  H04L45/38 ,  H04L47/125 ,  H04L67/1095 ,  H04L67/1097

Abstract: Managing storage systems that are synchronously replicating a dataset, including: detecting a change in membership to the set of storage systems synchronously replicating the dataset; and applying one or more membership protocols to determine a new set of storage systems to synchronously replicate the dataset, wherein the one or more membership protocols include a quorum protocol, an external management protocol, or a racing protocol, and wherein one or more I/O operations directed to the dataset are applied to a new set of storage systems.

公开(公告)号：US09959204B1

公开(公告)日：2018-05-01

申请号：US14642666

申请日：2015-03-09

Applicant: Western Digital Technologies, Inc.

Inventor： Glenn Alan Lott

IPC: G06F7/24 ,  G06F12/06 ,  G06F12/109

CPC classification number: G06F12/0684 ,  G06F7/24 ,  G06F12/109 ,  G06F2212/2515 ,  G06F2212/657

Abstract: Embodiments described herein are directed to systems and methods for ordering read sector data that has been returned from a hard disk controller out of order. For example, in typical storage systems, the firmware of the storage system and/or the host interface typically process read sectors in logical block address order. However, some of the data that is received may be received out of order. As such, the disk block hardware within the hard disk controller may accept these out of order sectors from the read channel and subsequently provide information that describes the available sectors that are in order to the firmware and/or the host interface.

公开(公告)号：US20180004658A1

公开(公告)日：2018-01-04

申请号：US15197471

申请日：2016-06-29

Applicant: Oracle International Corporation

Inventor： Edward Alfonso Bucaro

IPC: G06F12/06 ,  G06F13/40

CPC classification number: G06F12/0684 ,  G06F13/4068 ,  G06F2212/2532

Abstract: Aspects of the present disclosure involve a system and method for verifying and validating accurate memory module placement on a printed circuit board. In one embodiment, the printed circuit board is configured to include actuating elements that can be used to verify correct memory module location placement on the printed circuit board. In another embodiment, the actuating elements can be used to validate accurate memory module placement. The actuating elements can be in the form of buttons that may be depressed and configured to trigger light emitting diodes (LEDs) that correspond to the slots on the printed circuit board.

公开(公告)号：US20170300426A1

公开(公告)日：2017-10-19

申请号：US15637241

申请日：2017-06-29

Applicant: HUAWEI TECHNOLOGIES CO., LTD.

Inventor： Yunpeng CHAI ,  Dongwang SUN

IPC: G06F12/12 ,  G06F12/06 ,  G06F12/08

CPC classification number: G06F12/126 ,  G06F12/0246 ,  G06F12/06 ,  G06F12/0684 ,  G06F12/0804 ,  G06F12/0871

Abstract: A read cache management method and apparatus based on a solid state drive, and the method includes: determining whether a read request hits a first queue and a second queue (S101); if both the first queue and the second queue are missed, selecting and deleting an eliminated data block from the first queue (S102); if the eliminated data block is in a stored state, inserting the eliminated data block into the second queue (S103); and determining a target data block in a lower-level storage medium, and inserting the target data block into the first queue, (S104). According to the foregoing read cache management method and apparatus based on the solid state drive, a hit ratio of the solid state drive can be increased, a data write count of the solid state drive can be reduced, and service life of the solid state drive can be extended.

公开(公告)号：US20170193023A1

公开(公告)日：2017-07-06

申请号：US15336410

申请日：2016-10-27

Applicant: International Business Machines Corporation

Inventor： Greg R. Dhuse ,  Kevin M. Freese ,  Jason K. Resch ,  Daniel J. Scholl ,  Ethan S. Wozniak

IPC: G06F17/30

CPC classification number: G06F3/0619 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0611 ,  G06F3/0616 ,  G06F3/0623 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/0644 ,  G06F3/0647 ,  G06F3/0652 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0661 ,  G06F3/0665 ,  G06F3/067 ,  G06F11/1076 ,  G06F11/1092 ,  G06F12/0684 ,  G06F12/0813 ,  G06F12/0888 ,  G06F12/1408 ,  G06F16/182 ,  G06F16/2246 ,  G06F2212/154 ,  G06F2212/263 ,  H03M13/1515 ,  H03M13/3761 ,  H04L43/0852 ,  H04L43/0876 ,  H04L43/0888 ,  H04L43/16 ,  H04L67/1097

Abstract: Methods and systems for estimating a number of entries in a dispersed hierarchical index. The method and systems involve determining a number of random walks N to perform on the dispersed hierarchical index, conducting N walkthroughs based on the number of walkthroughs, determining a number of walk entries for each of the N random walks and averaging the number of walk entries for each of the N random walks to produce an estimated total number of entries for the dispersed hierarchical index. The determining may be based on one or more of a number of levels, a desired confidence interval, a predetermination, and interpretation of system registry information, and an interpretation of a request. Each random walk starts at a root node and ends at a leaf node through L levels of the dispersed hierarchical index.

公开(公告)号：US20170192698A1

公开(公告)日：2017-07-06

申请号：US15336300

申请日：2016-10-27

Applicant: International Business Machines Corporation

Inventor： Bart R. Cilfone ,  Adam M. Gray ,  Scott M. Horan ,  Wesley B. Leggette ,  Jason K. Resch ,  Shikha Shree ,  Ilya Volvovski

IPC: G06F3/06 ,  H04L12/26 ,  H04L29/08

CPC classification number: G06F3/0619 ,  G06F3/0604 ,  G06F3/0608 ,  G06F3/0611 ,  G06F3/0616 ,  G06F3/0623 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/0644 ,  G06F3/0647 ,  G06F3/0652 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0661 ,  G06F3/0665 ,  G06F3/067 ,  G06F11/1076 ,  G06F11/1092 ,  G06F12/0684 ,  G06F12/0813 ,  G06F12/0888 ,  G06F12/1408 ,  G06F16/182 ,  G06F16/2246 ,  G06F2212/154 ,  G06F2212/263 ,  H03M13/1515 ,  H03M13/3761 ,  H04L43/0852 ,  H04L43/0876 ,  H04L43/0888 ,  H04L43/16 ,  H04L67/1097

Abstract: Systems and methods for determining utilization levels of storage within a dispersed storage network (DSN). The methods include obtaining transaction records, updating a cumulative data storage byte-hour count for storage of corresponding bytes of encoded data slices in the storage units of the DSN, and issuing byte-hour usage information based on the updated cumulative data storage byte-hour counts. Each transaction record can include one or more of an operation count, an operation type (e.g., read, write, delete), number of slice bytes transferred, number of slice bytes deleted, a timestamp, a user identifier, and a vault identifier. The updating can include one or more of identifying the one or more affiliated entities, determining a byte-hour adjustment (i.e., up or down) based on a transaction record, and updating a byte-hour record for affiliated entities based on the byte-hour adjustment.

公开(公告)号：US09690488B2

公开(公告)日：2017-06-27

申请号：US14886348

申请日：2015-10-19

Applicant: Intel Corporation

Inventor： Vinodh Gopal ,  James D. Guilford ,  Gilbert M. Wolrich ,  Daniel F. Cutter

IPC: G06F12/00 ,  G06F3/06 ,  G06F12/02 ,  G06F12/0868 ,  G06F12/06 ,  G06F12/1018

CPC classification number: G06F3/0608 ,  G06F3/064 ,  G06F3/0656 ,  G06F3/0661 ,  G06F3/0685 ,  G06F12/0292 ,  G06F12/0638 ,  G06F12/0684 ,  G06F12/0868 ,  G06F12/1018 ,  H03M7/3086 ,  H03M7/6011

Abstract: In an embodiment, a processor includes hardware processing cores, a cache memory, and a compression accelerator comprising a hash table memory. The compression accelerator is to: determine a hash value for input data to be compressed; read a first plurality of N location values stored in a hash table entry indexed by the hash value; perform a first set of string searches in parallel from a history buffer using the first plurality of N location values stored in the hash table entry; read a second plurality of N location values stored in a first overflow table entry indexed by a first overflow pointer included in the hash table entry; and perform a second set of string searches in parallel from the history buffer using the second plurality of N location values stored in the first overflow table entry. Other embodiments are described and claimed.