International Business Machines Corporation

Arm Limited

Eric Van Hensbergen

Ahmed Gheith

James Xenidis

Ramakrishnan Rajamony

Freeman Leigh Rawson, Iii

Rhonda L Childress

Itzhack Goldberg

Lorraine M Herger

Steven Michael French

Venkateswararao Jujjuri

Thomas W Keller, Jr

Jonathan Curtis Beard

Martin Tross

Badari Pulavarty

Anthony Nicholas Liguori

Aneesh K Veetil

Ziv Rafalovich

Pravin Shinde

Charles Robert Lefurgy

Elmootazbellah Nabil Elnozahy

Stephan Diestelhorst

Hai Huang

Remy Pottier

Wendy Arnott Elsasser

Anthony N Hylick

Christopher Daniel Emmons

Simon Roger Holland

The present disclosure relates to a method of augmenting human perception of the surroundings, comprising: receiving a first set of data from a user device associated with the user, the first set of data comprising at least location information; receiving a second set of data from a local distributed database associated with the location information, the second set of data comprising a position of one or more entities; constructing a digital model representing the user and the one or more entities using the first and second set of data; projecting a respective course for the user and for the or each entity by inputting the digital model into a first machine learning algorithm (MLA) to infer one or more events; identifying at least one inferred event relevant to the user by inputting the one or more inferred events to the first MLA; and communicating the at least one relevant inferred event to the user.

Method of augmenting human perception of the surroundings

A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.

File versions within content addressable storage

A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.

Files having unallocated portions within content addressable storage

A data processing apparatus, and method of operation thereof, for executing instructions. The apparatus includes one or more host processors, each having a first processing unit, and a multi-level memory system. One or more levels of the memory system are tightly coupled to a corresponding second processing unit. At least one of the host processors includes an instruction scheduler that routes instructions selectively to at least one of the first and second processing units, dependent upon the availability of the processing units and the location, within the memory system, of data to be used when executing the instructions.

Method and apparatus for scheduling in a non-uniform compute device

A virtual link buffer provides communication between processing threads or cores. A first cache is accessible by a first processing device and a second cache accessible by a second processing device. An interconnect structure couples between the first and second caches and includes a link controller. A producer cache line in the first cache stores data produced by the first processing device and the link controller transfers data in the producer cache line to a consumer cache line in the second cache. Each new data element is stored at a location in the producer cache line indicated by a store position or tail indicator that is stored at a predetermined location in the same cache line. Transferred data are loaded from a location in the consumer cache line indicated by a load position or head indicator that is stored at a predetermined location in the same consumer cache line.

Cache-based communication between execution threads of a data processing system

Methods, systems and computer program products are provided that may relate to controlling access to or accessing computer files over a computer network. A file server may execute on a first computer system and a client may execute on a second computer system. The client may be configured to send a first communication to the file server relating to a first computer file stored on the first computer system. The first communication may include first access control data associated with the first computer file. The file server may be configured to receive the first communication and extract the first access control data from the first communication. The file server may then store the extracted first access control data in extended attributes of the first computer file on the first computer system.

Accessing and providing access to computer files over a computer network

A method, system, and computer program product for resolving cache lookup of large pages with variable granularity are provided in the illustrative embodiments. A number of unused bits in an available number of bits is identified. The available number of bits is configured to address a page of data in memory, wherein the page exceeding a threshold size, and the page comprising a set of parts. The unused bits are mapped to the plurality of parts such that a value of the unused bits corresponds to existence of a subset of the set of parts in a memory. A virtual address is translated to a physical address of a requested part in the set of parts. A determination is made, using the unused bits, whether the requested part exists in the memory.

Resolving cache lookup of large pages with variable granularity

A request is received from a first client, at a file-server, to use a handle available at the file-server, the handle corresponding to a resource available at a second client. A response message is selected, the selected response being specified in a file-system protocol. The request is multiplexed with the selected response. An identifier is added to the multiplexed response, the identifier associating a set of requests and responses between the first client and the second client concerning the resource. The multiplexed response is sent to the second client. A second response is received from the second client. Responsive to the request from the first client, and further responsive to the second response from the second client, a third response is sent to the first client, the third response enabling the client to client resource sharing in the client-server file-system.

Client to client resource sharing in a client-server file-system

The page tables in existing art are modified to allow virtual address resolution by mapping to multiple overlapping entries, and resolving a physical address from the most specific entry. This enables more efficient use of system resources by allowing smaller frames to shadow larger frames. A page table is selected. When a virtual address in a request corresponds to an entry in the page table, which identifies a next page table associated with the large frame, a determination is made that the virtual address corresponds to an entry in the next page table, the entry in the next page table referencing a small frame overlay for the large frame. The virtual address is mapped to a physical address in the small frame overlay using data of the entry in the next page table. The physical address in a process-specific view of the large frame is returned.

Process-specific views of large frame pages with variable granularity

A mechanism is provided in a data processing system for optimization of a distributed file system by log data analysis. A name node in the distributed file system initiates a log analysis map/reduce job on one or more connected data nodes via a map/reduce processing framework in the distributed file system and receives result data resulting from the log analysis map/reduce job from the one or more connected data nodes via the map/reduce processing framework in the distributed file system. The name node performs analysis on the received result data and generates an optimization plan for the one or more connected data nodes based on results of the analysis. The name node initiates the optimization plan on the one or more connected data nodes via the map/reduce processing framework in the distributed file system.

File system optimization by log/metadata analysis

A mechanism is provided for automatic use of large pages. An operating system loader performs aggressive contiguous allocation followed by demand paging of small pages into a best-effort contiguous and naturally aligned physical address range sized for a large page. The operating system detects when the large page is fully populated and switches the mapping to use large pages. If the operating system runs low on memory, the operating system can free portions and degrade gracefully.

Growing community of inventors

Austin, TX, United States of America

Eric Van Hensbergen