Using Parallel Associative Memories (epo) Patents (Class 707/E17.035)
  • Patent number: 11675772
    Abstract: An information processing method can comprise updating, in response to an update request for a first item in a file system, first attribute information associated with the first item in an ordered data set comprising entries corresponding to items in the file system, the entries indicating path information of storage paths of the items and attribute information associated with the items, and entries corresponding to items under the same directory being consecutively organized in the ordered data set; determining a second item associated with the first item, a parent directory of the second item being same as that of the first item; acquiring second attribute information associated with the second item from the ordered data set; and determining, based on at least the first attribute information and the second attribute information, attribute information associated with the parent directory. The management efficiency of the file system can thus be improved.
    Type: Grant
    Filed: June 30, 2020
    Date of Patent: June 13, 2023
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Xingzhou Zhang, Zhen Xu
  • Patent number: 10528524
    Abstract: A method, system, and/or computer program product modify a computer resource that has been moved to a new geolocation. One or more processors detect that a geolocation of a software resource has changed to a new geolocation. In response to detecting that the geolocation of the software resource has changed to the new geolocation, the processor(s) apply a geolocation based resource policy to alter the software resource.
    Type: Grant
    Filed: January 3, 2017
    Date of Patent: January 7, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ashish Kundu, Dimitrios Pendarakis, David R. Safford
  • Patent number: 9916086
    Abstract: Techniques described herein are generally related to storing and retrieving data from a content-addressable memory (CAM). A data value to be stored in the CAM may be received, where the data value has two or more bits. The CAM may include a plurality of memory sets. An index corresponding to the data value may be determined. The index may be determined based on a subset of bits of the data value that correspond to an index bit set. A memory set of the CAM may be identified based on the determined index and the data value may be stored in a storage unit of the identified memory set.
    Type: Grant
    Filed: December 4, 2013
    Date of Patent: March 13, 2018
    Assignee: EMPIRE TECHNOLOGY DEVELOPMENT LLC
    Inventor: Sriram Vajapeyam
  • Patent number: 9716665
    Abstract: Various embodiments of the present disclosure provide methods for randomly mapping entries in a suitable lookup table across multiple switch devices and/or multiple switch chipsets in each of the multiple switch devices by using two or more independent hash functions. In some embodiments, the number of entries in the lookup table is equal to be the least common multiple of all possible M (i.e., a number of switch devices) choosing R values (i.e., a desired redundancy level).
    Type: Grant
    Filed: August 28, 2014
    Date of Patent: July 25, 2017
    Assignee: Cisco Technology, Inc.
    Inventors: Mohammadreza Alizadeh Attar, Navindra Yadav, Satyam Sinha, Thomas J. Edsall, Kit Chiu Chu
  • Patent number: 9256549
    Abstract: In one embodiment, an extent key reconstruction technique is provided for use with a set of hash tables embodying metadata. The metadata includes an extent key associated with a storage location on storage devices for write data of one or more write requests organized into an extent. Each hash table has a plurality of entries, and each entry includes a plurality of slots. A first field of the extent key is recreated implicitly from an entry in a first address space portion of a hash table. A second field of the extent key is stored in the slot. A third field of the extent key is stored in the slot. A fourth field of the extent key is recreated implicitly from the hash table of the set of hash tables.
    Type: Grant
    Filed: January 17, 2014
    Date of Patent: February 9, 2016
    Assignee: NetApp, Inc.
    Inventors: Jeffrey S. Kimmel, T. Byron Rakitzis
  • Patent number: 8886657
    Abstract: A method, apparatus, and non-transitory computer readable storage medium for validating content is provided. Data is parsed into at least a first group of data and a second group of data according to a plurality of types of content present in the data. The data is ingested into an associative memory. The associative memory forms a plurality of associations among the data. The associative memory is configured to be queried based on at least one relationship selected from a group consisting of direct relationships and indirect relationships among the data. The associative memory comprises a content-addressable structure, the content-addressable structure comprising a memory organization in which the data is configured to be accessed by the content as opposed to being configured to be accessed by addresses for the data. The first group of data and the second group of data are communicated in a graphical representation.
    Type: Grant
    Filed: September 30, 2011
    Date of Patent: November 11, 2014
    Assignee: The Boeing Company
    Inventor: Brian Warn
  • Patent number: 7941605
    Abstract: Methods and apparatus are disclosed for generating a result based on a lookup result from a lookup operation using an associative memory and processing based on a discriminator portion of a lookup word. A first lookup operation is performed to generate a lookup result. In one implementation, a second lookup operation is performed based on a discriminator or the lookup result depending on the result of an evaluation, such as whether there was a hit or the lookup result matches a predetermined value. In one implementation, a second lookup operation is performed based on the discriminator, and either the result of the first or second lookup operation is used for subsequent processing. One implementation performs a lookup operation based on a lookup word to generate a lookup result, which is used to retrieve a base address and a bitmap from a memory.
    Type: Grant
    Filed: November 1, 2002
    Date of Patent: May 10, 2011
    Assignee: Cisco Technology, Inc
    Inventors: Eyal Oren, Oded Trainin, Gil Goren
  • Patent number: 7478192
    Abstract: Associative memory systems, methods and/or computer program products include a network of networks of associative memory networks. A network of entity associative memory networks is provided, a respective entity associative memory of which includes associations among a respective observer entity and observed entities that are observed by the respective observer entity, based on input documents. A network of feedback associative memory networks includes associations among observed entities for a respective positive and/or negative evaluation for a respective task of a respective user. A network of document associative memory networks includes associations among observed entities in a respective observed input source, such as a respective input document. A network of community associative memory networks includes associations among a respective observer entity, observed entities that are observed by the respective observer entity, and observed tasks of users in which the observer entity was queried.
    Type: Grant
    Filed: November 3, 2004
    Date of Patent: January 13, 2009
    Assignee: Saffron Technology, Inc.
    Inventors: James S. Fleming, Brian J. McGiverin, Manuel Aparicio, IV
  • Patent number: RE42135
    Abstract: An apparatus is equipped with a content addressable memory (CAM) to store one or more key entries corresponding to a data class represented by the CAM. Each of the one or more key entries is associated with a key tag corresponding to one of one or more subclasses of the data class. The apparatus is further equipped with logic coupled to the CAM to extract a data key from a data stream, to compare all or part of the data key with the one or more key entries to determine if the data key is a member of the data class, and to classify the data key as belonging to one of the one or more subclasses of the data class if the data key is determined to be a member of data class.
    Type: Grant
    Filed: May 4, 2006
    Date of Patent: February 8, 2011
    Inventor: Richard Willardson