Locating node of named data elements in coordination namespace

Nair, Ravi; Johns, Charles Ray

Title: Locating node of named data elements in coordination namespace

Full Record
Other Related Research

Abstract

An approach is disclosed that locates a named data element by a local node. A name corresponding to the named data element is received, the named data element exists in a Coordination Namespace allocated in a memory area that is distributed amongst a set of nodes that include the local node and remote nodes. A predicted node identifier is received and then the named data element is requested from the predicted node based on the predicted node identifier.

Inventors:: Nair, Ravi; Johns, Charles Ray

Issue Date:: 2020-06-16

Research Org.:: International Business Machines Corp., Armonk, NY (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 1651023

Patent Number(s):: 10684958

Application Number:: 16/215,244

Assignee:: International Business Machines Corporation (Armonk, NY)

DOE Contract Number:: 7216497

Resource Type:: Patent

Resource Relation:: Patent File Date: 12/10/2018

Country of Publication:: United States

Language:: English

Citation Formats


                    Nair, Ravi, and Johns, Charles Ray. Locating node of named data elements in coordination namespace.  United States: N. p., 2020. 
        Web.

Copy to clipboard


                    Nair, Ravi, & Johns, Charles Ray. Locating node of named data elements in coordination namespace.  United States.

Copy to clipboard


                    Nair, Ravi, and Johns, Charles Ray. Tue .  
        "Locating node of named data elements in coordination namespace".  United States.  https://www.osti.gov/servlets/purl/1651023.

Copy to clipboard


                    
@article{osti_1651023,

  title        = {Locating node of named data elements in coordination namespace},

  author       = {Nair, Ravi and Johns, Charles Ray},

  abstractNote = {An approach is disclosed that locates a named data element by a local node. A name corresponding to the named data element is received, the named data element exists in a Coordination Namespace allocated in a memory area that is distributed amongst a set of nodes that include the local node and remote nodes. A predicted node identifier is received and then the named data element is requested from the predicted node based on the predicted node identifier.},

  doi          = {},

  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2020},

  month        = {6}

}

Copy to clipboard

Patent:

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE Patents and OSTI.GOV collections:

Relocation and persistence of named data elements in coordination namespace

Patent Nair, Ravi; Johns, Charles Ray; Kahle, James Allan; ...

An approach is disclosed that relocates a named data element. A request to move a name corresponding to the named data element is received from a first storage area in a Coordination Namespace to a second storage area in the Coordination Namespace. The first storage area has a first level of persistence, and the second storage area has a second level of persistence. The named data element exists in a Coordination Namespace that is allocated in a memory distributed amongst a plurality of nodes that include the local node and one or more remote nodes. The approach then creates amore » « less
Full Text Available
Distributed directory of named data elements in coordination namespace

Patent Johns, Charles Ray; Kahle, James Allan; Sexton, James C.; ...

An approach is described that provides a distributed directory structure within a storage of an information handling system (a local node). A request is received with the request corresponding to a shared virtual address. The shared virtual address that is shared amongst a number of nodes that includes the local node and some remote nodes. A Global Address Space Directory (GASD) is retrieved that corresponds to a global virtual address space. The GASD is stored in a Coordination Namespace that is stored in a memory that is distributed amongst the nodes. A mapping that is included in the GASD ismore » « less
Full Text Available
Synchronization between processes in a coordination namespace

Patent Jacob, Philip; Strenski, Philip N.; Johns, Charles

A system and method of supporting point-to-point synchronization among processes/nodes implementing different hardware barriers in a tuple space/coordinated namespace (CNS) extended memory storage architecture. The system-wide CNS provides an efficient means for storing data, communications, and coordination within applications and workflows implementing barriers in a multi-tier, multi-nodal tree hierarchy. The system provides a hardware accelerated mechanism to support barriers between the participating processes. Also architected is a tree structure for a barrier processing method where processes are mapped to nodes of a tree, e.g., a tree of degree k to provide an efficient way of scaling the number of processesmore » « less
Full Text Available
Coordination namespace processing

Patent Nair, Rishi; Johns, Charles Ray; Kahle, James A.; ...

An approach is described that accesses data in a shared memory that is shared amongst nodes that include a local node and remote nodes. The local node receives a name corresponding to a named data element in a Coordination Namespace, the Coordination Namespace having been created in a memory distributed amongst the nodes. A hash function is applied to at least a portion of the name with a result of the hash function being a natural node indicator. Data corresponding to the named data element is requested from a natural node identified by the indicator. Based on the request, amore » « less
Full Text Available
Interlinked tuples in coordination namespace

Patent Jacob, Philip; Strenski, Philip Neil; Johns, Charles

A system and method for supporting tuple record interlinking in one or more tuple space/coordinated namespace (CNS) extended memory storage systems. A system-wide CNS provides for efficient storing and communicating of data generated by local processes running at the nodes, and coordinated to generate a union/intersection of multiple CNS where tuple records are interlinked in multiple CNS hashtables, and/or share tuple data between two sets of processes that are part of different CNSs. Local node processes further generate multi-key tuples where two or more tuple records are interlinked within the same CNS hash table, thereby permitting a look up ofmore » « less
Full Text Available

Similar Records