Patent application number | Description | Published |
20150286563 | READ AND WRITE OPERATIONS ON SHARED DATA RESOURCES IN PARALLEL PROCESSING SYSTEMS - Providing unblocked read operations concurrent with write operations with respect to shared data resources in parallel processing systems. In an embodiment, for each data resource, a pair of fields and an index field is maintained. The index field indicates which of the two fields (e.g., first field) stores a current value for the data resource. However, when a new value is to be stored for the data resource, the value is first stored in the second field using a execution entity, while ensuring exclusive access for the execution entity to the second field. The index field is then updated to indicate that the second field stores the current value, such that the new value in the second field is thereafter available as the current value for read operations. All read operations by any corresponding concurrent execution entities, during the write operation, are continued unblocked. | 10-08-2015 |
20150286664 | REDUCING BLOCKING INSTANCES IN PARALLEL PROCESSING SYSTEMS PERFORMING OPERATIONS ON TREES - An aspect of the present invention reduces blocking instances in parallel processing systems performing operations on trees. In one embodiment, a change operation is performed in a first execution entity and a traversal operation is performed in a second execution entity, with both the change operation and the traversal operation being designed to operate on a same node of a tree, and with the first execution entity and the second execution entity being executed concurrently in a digital processing system. A non-blocking access of the same node to both of the first execution entity and the second execution entity is permitted, thereby enabling the change operation and the traversal operation to be performed concurrently. | 10-08-2015 |
20150350039 | DEEP PACKET INSPECTION (DPI) OF NETWORK PACKETS FOR KEYWORDS OF A VOCABULARY - An aspect of the present disclosure provides deep packet inspection (DPI) of network packets for keywords of a vocabulary. In one embodiment, a mapping specifying association of respective keywords to corresponding unique pattern codes is maintained, with each pattern code being shorter in length compared to the corresponding keyword and being computed based on a formula. Upon receiving a network packet, a token (containing a sequence of characters) present in the network packet is first identified and the formula then applied to the identified token to generate a token code. The token is determined to match a specific keyword when the token code equals the pattern code corresponding to the specific keyword in the mapping. | 12-03-2015 |
20160044143 | DATA STRUCTURE AND ASSOCIATED MANAGEMENT ROUTINES FOR TCP CONTROL BLOCK (TCB) TABLE IN NETWORK STACKS - A method for transport layer lookup involves receiving a first incoming transport layer packet, and searching a pointer cache for a first matching transport layer data structure including state information corresponding to the first incoming packet. The pointer cache includes pointer cache lines, each of which stores at least one pointer to a subset of global transport layer data structures. The method further involves returning the state information corresponding to the first incoming packet using the first matching transport layer data structure when a pointer cache hit occurs, receiving a second incoming transport layer packet, searching the pointer cache for a second matching transport layer data structure including state information corresponding to the second incoming packet, and searching the plurality of global transport layer data structures in main memory to obtain the matching second transport layer data structure, when a pointer cache miss occurs. | 02-11-2016 |
Patent application number | Description | Published |
20130304699 | SYSTEM AND METHOD FOR SUPPORTING CONFIGURATION DAEMON (CD) IN A NETWORK ENVIRONMENT - A system and method can support network management in a network environment. The network environment can include a plurality of configuration daemons (CDs), wherein a master CD is an active CD on a switch with a master subnet manager (SM). The master CD operates to perform consistency check on one or more states associated with one or more peer CDs in the network environment, and replicate a configuration file to the one or more peer CDs, wherein the configuration file includes at least one management key (M_Key) value. | 11-14-2013 |
20130304883 | SYSTEM AND METHOD FOR SUPPORTING STATE SYNCHRONIZATION IN A NETWORK ENVIRONMENT - A system and method can support network management in a network environment. The network environment can include a plurality of configuration daemons (CDs), wherein each CD resides on a switch in the network environment. The CD operates to receive a configuration file that includes a list of known management key (M_Key) values. Furthermore, the CD operates to store the configuration file, and make the configuration file available to a local subnet manager(SM) on the switch, wherein the local SM is associated with a currently used M_Key value. Then, the CD operates to update the local SM with a new M_Key, after receiving an instruction from a master CD that is associated with a master SM in the network environment. | 11-14-2013 |
20130304889 | SYSTEM AND METHOD FOR PROVIDING A TRANSACTIONAL COMMAND LINE INTERFACE (CLI) IN A NETWORK ENVIRONMENT - A system and method can support subnet management in a network environment. A network switch in the network environment can provide a transactional interface, wherein the transactional interface allows a user to interact with the network environment using a transaction. The transactional interface allows a user to group one or more operations in the transaction, and ensures that no conflicting operations are included in the transaction. | 11-14-2013 |
Patent application number | Description | Published |
20090150325 | System and method for root cause analysis of the failure of a manufactured product - A system, method and computer program product for the root cause analysis of the failure of a manufactured product is disclosed. The present invention includes the development of a knowledge model, based on information obtained from historical warranty claim forms and various manufacturing data sources. The invention also includes processing text information in a free-form text that is obtained from warranty claim forms by using text-tagging and annotation techniques. Thereafter, the knowledge model is converted to a Bayesian network. The present invention provides a user interface to select parameters and corresponding instances from current warranty claim forms. The selected parameters and corresponding instances are used as input evidence for the Bayesian network. The present invention facilitates the process of drawing inferences for root cause analysis of the failure of manufactured products and corresponding probabilities. | 06-11-2009 |
20120253865 | SYSTEM AND METHOD FOR OPTIMIZING PLANNING PRODUCTION USING FEATURE DRIVEN VALUE APPROXIMATION TECHNIQUES - A system and method is disclosed of implementing a production planning module that is configured to optimize overall costs associated with reconfiguring a production facility during a changeover between to produce a another product family over a plurality of cycles. User input data is received via a user interface and a first state vector is created and is representative of a first product family and a first inventory of items of all product families manufactured at the production facility. A first action vector is created of a first quantity of items to be produced of the first product family in a first current cycle and a second product family to be produced in a second cycle. A first state-action value function is calculated for the first action vector in a first iteration and incorporates a first sampled demand of the first inventory items of the product families, a first inventory cost associated with the first inventory and a first set up cost. A second state vector is created based on the first state vector, the first action vector and the first sampled demand. The second state vector is made of a second inventory of items of all the product families. The method comprises creating a second action vector of a second quantity of items to be produced of the second product family in the second cycle and a third product family to be produced in a third cycle. A second state-action value function is calculated for the second action vector, a second sample demand of items, a second inventory cost associated with production of the second quantity of items and a second set up cost associated with reconfiguration of the production facility from producing the second product family to producing the third product family. A cost optimization result policy is output by minimizing, over all actions vectors, the first state-action value function in the user interface. | 10-04-2012 |
20120290495 | SYSTEM AND METHOD FOR ESTABLISHING TRANSSHIPMENT OF A PRODUCT BETWEEN STOCKING LOCATIONS - The disclosed embodiment relates to methods, systems, and computer readable code for establishing transshipment of a product between stocking locations. The exemplary method comprises the steps of transmitting a transshipment request to at least one supplier requesting transshipment of a product, the transshipment request including information regarding the product and specifying a reward for transshipment of the product, receiving a handshake request from one of the suppliers in response to the transshipment request, the handshake request indicating the willingness of the one of the suppliers to provide the product as specified in the transshipment request and including information regarding the transshipment; and accepting the handshake request, thereby initiating transshipment of the product from the one of the suppliers in accordance with the accepted handshake request. The method may further comprise determining whether to accept the handshake request based on the information regarding the transshipment included in the handshake request. | 11-15-2012 |