Patent application number | Description | Published |
20120047507 | SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING - Various embodiments for selective constant complexity dismissal in task scheduling of a plurality of tasks are provided. A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch. | 02-23-2012 |
20120144123 | READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE - Various embodiments for read-ahead processing in a networked client-server architecture by a processor device are provided. Read messages are grouped by a plurality of unique sequence identifications (IDs), where each of the sequence IDs corresponds to a specific read sequence, consisting of all read and read-ahead requests related to a specific storage segment that is being read sequentially by a thread of execution in a client application. The storage system uses the sequence id value in order to identify and filter read-ahead messages that are obsolete when received by the storage system, as the client application has already moved to read a different storage segment. Basically, a message is discarded when its sequence id value is less recent than the most recent value already seen by the storage system. The sequence IDs are used by the storage system to determine corresponding read-ahead data to be loaded into a read-ahead cache. | 06-07-2012 |
20120233620 | SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING - A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch. | 09-13-2012 |
20120239749 | READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE - Read messages are grouped by a plurality of unique sequence identifications (IDs), where each of the sequence IDs corresponds to a specific read sequence, consisting of all read and read-ahead requests related to a specific storage segment that is being read sequentially by a thread of execution in a client application. The storage system uses the sequence id value in order to identify and filter read-ahead messages that are obsolete when received by the storage system, as the client application has already moved to read a different storage segment. Basically, a message is discarded when its sequence id value is less recent than the most recent value already seen by the storage system. The sequence IDs are used by the storage system to determine corresponding read-ahead data to be loaded into a read-ahead cache. | 09-20-2012 |
20120311598 | RESOURCE ALLOCATION FOR A PLURALITY OF RESOURCES FOR A DUAL ACTIVITY SYSTEM - Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary. | 12-06-2012 |
20130174175 | RESOURCE ALLOCATION FOR A PLURALITY OF RESOURCES FOR A DUAL ACTIVITY SYSTEM - Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary. | 07-04-2013 |
20130185518 | DETERMINING DATA CONTENTS TO BE LOADED INTO A READ-AHEAD CACHE IN A STORAGE SYSTEM - Read messages are issued by a client for data stored in a storage system of the networked client-server architecture. A client agent mediates between the client and the storage system. Each sequence of read requests generated by a single thread of execution in the client to read a specific data segment in the storage is defined as a client read session. Each read request sent from the client agent to the storage system includes positions and size for reading. A read-ahead cache is maintained for each client read session. The read-ahead cache is partitioned into two buffers. Data is loaded into the logical buffers according to the changes of the positions in the read requests of the client read session and loading of new data into the buffers is triggered by the read requests positions exceeding a position threshold in the data covered by the second logical buffer. | 07-18-2013 |
20130191448 | FILTERING OBSOLETE READ REQUESTS IN NETWORKED CLIENT-SERVER ARCHITECTURE - Read messages are issued by a client for data stored in a storage system of the networked client-server architecture. A client agent mediates between the client and the storage system. A sequence identification (ID) value is conveyed by each of the read requests sent from the client agent to the storage system. The read requests, which are related to a specific data segment, that are being read sequentially by an execution thread in the client are assigned with an identical unique sequence ID value. A read request having the sequence ID value that is less recent than a most recent sequence ID value already seen by the storage system are discarded. | 07-25-2013 |
20130191490 | SENDING DATA OF READ REQUESTS TO A CLIENT IN A NETWORKED CLIENT-SERVER ARCHITECTURE - Read messages are issued by a client for data stored in a storage system of the networked client-server architecture. A client agent mediates between the client and the storage system. The storage system sends to the client agent the requested data by partitioning the returned data into segments for each read request. The storage system sends each segment in a separate network message. | 07-25-2013 |
20130191602 | CALCULATING READ OPERATIONS AND FILTERING REDUNDANT READ REQUESTS IN A STORAGE SYSTEM - Read messages are issued by a client for data stored in a storage system of the networked client-server architecture. A client agent mediates between the client and the storage system. Each sequence of read requests generated by a single thread of execution in the client to read a specific data segment in the storage is defined as a client read session. The client agent maintains a read-ahead cache for each client read session and generates read-ahead requests to load data into the read-ahead cache. Each read request and read-ahead request sent from the client agent to the storage system includes positions and a size for reading and a sequence id value. The storage system filters and modifies incoming read request and read-ahead requests based on sequence ID values, positions and sizes of the incoming read request and read-ahead requests. | 07-25-2013 |
20130205095 | PROCESSING READ REQUESTS BY A STORAGE SYSTEM - Read messages are issued by a client for data stored in a storage system. A client agent mediates between the client and the storage system. Each sequence of read requests generated by a single thread of execution in the client to read a specific data segment in the storage is defined as a client read session. Each read request sent from the client agent to the storage system includes a position and a size for reading. The read-ahead cache and a current sequence ID value for each client read session are maintained. For each incoming read request, the storage system determines whether to further process the read request based on a sequence ID value of the read request, and the source from which to obtain data for the read request, and which of the data to load into the read-ahead cache according to data positions of the read request. | 08-08-2013 |
20140181832 | RESOURCE ALLOCATION FOR A PLURALITY OF RESOURCES FOR A DUAL ACTIVITY SYSTEM - For resource allocation of resources for a dual activity system, each of the dual activities may be started at a static quota and is allocated its respective static quota of resources, and determining which of the dual activities is a demanding dual activity. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. A reduced actual resource boundary for the demanding dual activity based on a multiplicative decrease of the dual activity's actual resource boundary is calculated, and the resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary. | 06-26-2014 |
20140280824 | EFFICIENT CENTRALIZED STREAM INITIATION AND RETRY CONTROL - For efficient centralized stream initiation and retry control in a computing environment, using a centralized data streams management module for both managing when data streams should be opened and sent from a source location to a destination and for determining when to reattempt opening data streams sent from the source location to the destination after an nth number of consecutive failed attempts using an incrementing time calculation. The incrementing time calculation computes a dynamically calculated time period. | 09-18-2014 |
20150039766 | DYNAMICALLY BALANCING RESOURCE REQUIREMENTS FOR CLIENTS WITH UNPREDICTABLE LOADS - In one embodiment, by way of example only, a resource threshold limits the resource usage of each of the multiplicity of clients. The resource threshold of each of the multiplicity of clients increases over time and decreases when the resources deplete and a resource request of a client is rejected. A subset of clients is created from the multiplicity of clients having a resource usage greater than the resource usage of the rejected client. A dynamic average of a normalized number of resources is calculated from the subset of clients. The resource threshold of each client from the subset of clients is decreased based on the dynamic average of the subset of clients, and further acquisition of resources is restricted from each client from the subset of clients in order to bring the resource usage of each of the subset of clients under the resource threshold. | 02-05-2015 |