摘要:
A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.
摘要:
A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.
摘要:
A request from a requestor identifies data stored in a distributed active data storage system and a procedure that is associated with the identified data for a given node of the distributed active data storage system to execute. The execution of the procedure causes the given node to selectively determine an address for routing another request to an element of a plurality of elements of a data structure stored on the plurality of nodes.
摘要:
The present disclosure includes accessing a local storage device using an auxiliary processor An example computing device (100, 202, 303) includes a local storage device (110, 210, 310), a first processor (112, 212, 312) able to access the local storage device (110, 210, 310), an auxiliary processor (114, 220, 360) able to access the local storage device (110, 210, 310) while the first processor (112, 212, 312) is shut down, wherein the auxiliary processor (114, 220, 360) uses less power than the first processor (112, 212, 312), and a management agent (125, 225, 370) to initiate an accessing of the local storage device (110, 210, 310) by the auxiliary processor (114, 220, 360) if a load associated with the computing device (100, 202, 303) falls below a particular threshold. One of the first processor (112, 212, 312) and the auxiliary processor (114, 220, 360) is able to access the local storage device (110, 210, 310) at a time.
摘要:
Data storage apparatus and methods are disclosed. A disclosed example data storage apparatus comprises a cache layer and a processor in communication with the cache layer. The processor is to dynamically enable or disable the cache layer via a cache layer enable line based on a data store access type.
摘要:
Data storage apparatus and methods are disclosed. A disclosed example data storage apparatus comprises a cache layer and a processor in communication with the cache layer. The processor is to dynamically enable or disable the cache layer via a cache layer enable line based on a data store access type.
摘要:
A technique includes receiving a user input in an array-oriented database. The user input indicates a database operation and processing a plurality of chunks of data stored by the database to perform the operation. The processing in dudes selectively distributing the processing of the plurality of chunks between a first group of at least one central processing unit and a second group of at least one co-processor.
摘要:
In a method of implementing a graph storage system, the graph storage system is stored on a plurality of computing systems. A global address space is provided for distributed graph storage. The global address space is managed with graph allocators, in which a graph allocator allocates space from a block of the distributed global memory in order to store a plurality of graphs.
摘要:
In a method of implementing a graph storage system, the graph storage system is stored on a plurality of computing systems. A global address space is provided for distributed graph storage. The global address space is managed with graph allocators, in which a graph allocator allocates space from a block of the distributed global memory in order to store a plurality of graphs.
摘要:
Local checkpointing using a multi-level call is described herein. An example method includes storing a first datum in a first level of a multi-level cell. A second datum is stored in a second level of the multi-level cell, the second datum representing a checkpoint of the first datum. The first datum is copied from the first level to the second level of the multi-level cell to create the checkpoint.