Charles Schwab Co., Inc.

Td Ameritrade IP Compnay, Inc.

Eric Tesse

A computationally-efficient system for encoding a message object implements instructions including determining a token of the message object. The token identifies a structure of the message object. The instructions include obtaining a dictionary definition based on the token. The dictionary definition describes the structure of the message. The message includes multiple entries. Each of the entries is characterized by a data type and a field identifier. The dictionary definition defines an order of the entries. The instructions include, according to an order specified by the dictionary definition, selecting each entry of a set of entries in the message in sequence and writing the entry to a byte queue exclusive of the data type and the field identifier. The instructions include initiating transmission of the byte queue over a communications network.

Byte queue parsing in high-performance network messaging architecture

A computationally-efficient object conversion system maintains multiple objects. Each object includes an array of characters and a hash value. Instructions include maintaining strings in a one-to-one relationship with the objects. The instructions include, for each object, calculating the hash value in response to values being written to the array of the object. The instructions include defining an equals method that, for first and second objects, returns a true value in response to values of the array of the first object matching values of the array of the second object. The instructions include defining a hash method that, for a selected object, returns the hash value. The instructions include, in response to a request including a request string, determining whether one of the strings is equal to the request string and, if so, returning the object related to the one of the strings.

Immutable object handling in high-performance network messaging architecture

A memory management system implements instructions including maintaining multiple pool data structures, each associated with a linked list of objects and including a head pointer pointing to the first element in the linked list. The instructions include, in response to a first object no longer being needed, recycling the first object by identifying a first pool data structure that corresponds to the first object and inserting the first object into the linked list without deallocating the memory for the first object. The instructions include, in response to a new object request, identifying a second pool data structure according to a feature of the new object. If the corresponding linked list is empty, memory is allocated for the new object and the new object is assigned to the second pool data structure. If the linked list is not empty, the first object is removed from the linked list and returned.

Memory pooling in high-performance network messaging architecture

A communications system implements instructions including maintaining a message object that includes an array of entries. Each entry of the array includes a field identifier, a data type, and a next entry pointer. The next entry pointers and a head pointer establish a linked list of entries. The instructions include, in response to a request to add a new entry to the message object, calculating an index based on a field identifier of the new entry and determining whether the entry at the calculated index within the array of entries is active. The instructions include, if the entry is inactive, writing a data type, field identifier, and data value of the new entry to the calculated index, and inserting the new entry into the linked list. The instructions include, if the entry is already active, selectively expanding the size of the array and repeating the calculating and determining.

Growing community of inventors

New York, NY, United States of America

Eric Tesse