Patent application number | Description | Published |
20100050173 | Provisioning Virtual Resources Using Name Resolution - A data string including a resource identifier and one or more resource attributes is parsed at a name resolution module and provided to a computing resource provisioning system. The computer resource provisioning system provisions a resource that corresponds to the resource identifier and that has the at least one. A handle is returned to provide access to the resource at a client system. | 02-25-2010 |
20120060018 | Collective Operations in a File System Based Execution Model - A mechanism is provided for group communications using a MULTI-PIPE synthetic file system. A master application creates a multi-pipe synthetic file in the MULTI-PIPE synthetic file system, the master application indicating a multi-pipe operation to be performed. The master application then writes a header-control block of the multi-pipe synthetic file specifying at least one of a multi-pipe synthetic file system name, a message type, a message size, a specific destination, or a specification of the multi-pipe operation. Any other application participating in the group communications then opens the same multi-pipe synthetic file. A MULTI-PIPE file system module then implements the multi-pipe operation as identified by the master application. The master application and the other applications then either read or write operation messages to the multi-pipe synthetic file and the MULTI-PIPE synthetic file system module performs appropriate actions. | 03-08-2012 |
20120191946 | FAST REMOTE COMMUNICATION AND COMPUTATION BETWEEN PROCESSORS - A method for fast remote communication and computation between processors is provided in the illustrative embodiments. A direct core to core communication unit (DCC) is configured to operate with a first processor, the first processor being a remote processor. A memory associated with the DCC receives a set of bytes, the set of bytes being sent from a second processor. An operation specified in the set of bytes is executed at the remote processor such that the operation is invoked without causing a software thread to execute. | 07-26-2012 |
20120303681 | Collective Operations in a File System Based Execution Model - A mechanism is provided for group communications using a MULTI-PIPE synthetic file system. A master application creates a multi-pipe synthetic file in the MULTI-PIPE synthetic file system, the master application indicating a multi-pipe operation to be performed. The master application then writes a header-control block of the multi-pipe synthetic file specifying at least one of a multi-pipe synthetic file system name, a message type, a message size, a specific destination, or a specification of the multi-pipe operation. Any other application participating in the group communications then opens the same multi-pipe synthetic file. A MULTI-PIPE file system module then implements the multi-pipe operation as identified by the master application. The master application and the other applications then either read or write operation messages to the multi-pipe synthetic file and the MULTI-PIPE synthetic file system module performs appropriate actions. | 11-29-2012 |
20130282788 | File System Optimization by Log/Metadata Analysis - 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. | 10-24-2013 |
20140013073 | USING LARGE FRAME PAGES WITH VARIABLE GRANULARITY - 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. | 01-09-2014 |
20140040330 | Establishment, Optimization, and Routing of Remote Transitive Name Space Access - A mechanism is provided for establishment, optimization, and routing of remote transitive name space access. The illustrative mechanism adds a new protocol primitive to distributed file systems, which establishes a new multiplexed client connection between the client, the transitive server, and the destination server(s). The protocol allows establishment of remote mounts on a transitive file server. The protocol allows the client to request a “recipe” for a direct connection to the destination file server without intermediate nodes. The protocol allows the intermediate server to be established as a multiplexer that forwards requests/responses to/from destination servers without unmarshalling/remarshalling. | 02-06-2014 |
20140040577 | Automatic Use of Large Pages - 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. | 02-06-2014 |
20140074898 | CLIENT TO CLIENT RESOURCE SHARING IN A CLIENT-SERVER FILE-SYSTEM - 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. | 03-13-2014 |