Abstract: Provided is a system and method for increasing file transmission speed of a server, and a method for replicating a data object over a plurality of nodes. The system includes a server communicatively coupled to a plurality of nodes. The server may detect a plurality of nodes. The server may determine that a data object stored by the server is to be replicated to the plurality of nodes. The server may divide the data object into a plurality of data pieces. The server may send a different data piece to each node of the plurality of nodes. Each node may receive the different data piece from the server. Each node may send a copy of the received data piece to all other nodes. Each node may receive copies of all other data pieces from the other nodes. Each node may replicate a full copy of the data object.

Abstract: An example operation may include one or more of receiving, by a data server node, requests for data from a plurality of user nodes connected to a blockchain, retrieving, by the data server node, the data from the blockchain, dividing, by the data server node, the data into a plurality of portions and generating copies of the plurality of the portions, changing, by the data server node, at least one bit in each of the copies, encrypting, by the data server node, the copies and recording the copies into blocks on a second blockchain, recording, by the data server node, a plurality of sequence numbers of the blocks, and storing, by the data server node, the plurality of the sequence numbers on a second blockchain to be accessed by the plurality of the user nodes.

Abstract: Methods that can protect sensitive data are provided. One method includes determining, by a processor, whether a user is focusing on an obscured set of sensitive data displayed on a computing device, clarifying the obscurity of a portion of the displayed set of sensitive data in response to determining that the user focusing on the portion of the displayed set of sensitive data, and maintaining the obscurity of one or more other portions of the displayed set of sensitive data in response to determining that the user not focusing on the one or more other portions of the displayed set of sensitive data. Apparatus and computer program products that can include, perform, and/or implement the methods are also provided.

Abstract: For resource management for a parent child workload, a processor organizes a plurality of processes into a plurality of process groups. Each process group includes a given parent process and all child processes of the given parent process. Each process group has a process level. The processor further calculates a process cost for each process group and assigns a process priority to each process group based on the process cost for the process group. The processor iteratively assigns computing resources to subgroups of a given process group with a highest process priority at a given process level.

Abstract: A system and a method for scheduling a reduce task on nodes is disclosed. The various nodes in a cluster of nodes are bucketized into intermediate data items. A counter is created that provides a count of the intermediate data items that are placed into the each of the buckets for the node. This counter value is provided to a scheduler. From the counter information the scheduler is able to determine the cost of moving the intermediate data for the bucket to different ones of the nodes. Once the cost of moving the intermediate data is determined the scheduler is able to determine which of the nodes should perform the reduce task for that particular bucket. The scheduler minimizes the amount of shuffling of the intermediate data between the nodes for each of the buckets, by determining the lowest cost shuffle option for each of the buckets.

Abstract: A system and a method for scheduling a reduce task on nodes is disclosed. The various nodes in a cluster of nodes are bucketized into intermediate data items. A counter is created that provides a count of the intermediate data items that are placed into the each of the buckets for the node. This counter value is provided to a scheduler. From the counter information the scheduler is able to determine the cost of moving the intermediate data for the bucket to different ones of the nodes. Once the cost of moving the intermediate data is determined the scheduler is able to determine which of the nodes should perform the reduce task for that particular bucket. The scheduler minimizes the amount of shuffling of the intermediate data between the nodes for each of the buckets, by determining the lowest cost shuffle option for each of the buckets.

Abstract: Embodiments for optimizing resource usage in a distributed computing environment. Resource usage of each task in a set of running tasks associated with a job is monitored to collect resource usage information corresponding to each respective task. A resource unit size of at least one resource allocated to respective tasks in the set of running tasks is adjusted based on the resource usage information to improve overall resource usage in the distributed computing environment.

Abstract: A system and a method for scheduling a reduce task on nodes is disclosed. The various nodes in a cluster of nodes are bucketized into intermediate data items. A counter is created that provides a count of the intermediate data items that are placed into the each of the buckets for the node. This counter value is provided to a scheduler. From the counter information the scheduler is able to determine the cost of moving the intermediate data for the bucket to different ones of the nodes. Once the cost of moving the intermediate data is determined the scheduler is able to determine which of the nodes should perform the reduce task for that particular bucket. The scheduler minimizes the amount of shuffling of the intermediate data between the nodes for each of the buckets, by determining the lowest cost shuffle option for each of the buckets.