Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: Systems and methods are provided for a clearing framework for clearing a non-deliverable interest rate swap. The clearing framework includes an application programming interface (API) including functions for processing trade messages including information used by a clearing house computing system in clearing non-deliverable interest rate swaps; one or more user interface screens comprising information corresponding to one or more non-deliverable interest rate swaps and one or more user interface screens comprising information of cleared interest rate swaps, one an API for reporting clearing information, wherein the one or more functions comprise a first messaging function to confirm clearing of the one or more non-deliverable interest rate swaps and a second messaging function to request consent to clear the one or more non-deliverable interest rate swaps.

Abstract: Systems and methods for blending a plurality of swaps may include determining a fixed rate for use in blending a plurality of swaps, each of the plurality of swaps having matching economics and a different associated fixed rate. A computing device may determine a first remnant swap for blending fixed rate components of the plurality of swaps using the fixed rate. In some cases, the computing device may determine second remnant swap for blending floating rate components of the plurality of swaps based on the first remnant swap.

Abstract: The disclosed embodiments relate to a system/apparatus for reducing a data size of a database/data structure stored in a memory of a data transaction processing system, which stores a plurality of data records, each of the plurality of data records being characterized by a record data size and storing data indicative of a position (of one or more portfolios) in one or more financial instruments, such as interest rate swaps, futures contracts, etc. The system/apparatus may be referred to as an architecture which enables post-trade processing of portfolio/position databases/data structures, or subsets thereof, to reduce the data size thereof for storage, communication and/or processing and may further reduce other aspects or characteristics such as gross notional value, total risk, etc.

Abstract: The disclosed embodiments relate to improving the efficiency of an electronic trading system for interest rate swaps (“IRS”) by allowing for IRS contracts to be funded in a base currency while the cash flows, e.g. coupon payments, price alignment interest, variation margin, are denominated in a local currency different from the base currency. Thereby cash flows may be netted and offset minimizing the magnitude of funds needed to be moved and reducing the number of transactions processed by the electronic trading system as well as the consumption of computational resources thereby. Furthermore, the disclosed embodiments facilitate entering into IRS transactions is a currency different from the currency of cash flows while eliminating Herstatt risk due to volatility of foreign exchange rates, which allows for increased off shore participation and thereby increased transaction volume.

Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: Systems and methods for blending a plurality of swaps may include determining a fixed rate for use in blending a plurality of swaps, each of the plurality of swaps having matching economics and a different associated fixed rate. A computing device may determine a first remnant swap for blending fixed rate components of the plurality of swaps using the fixed rate. In some cases, the computing device may determine second remnant swap for blending floating rate components of the plurality of swaps based on the first remnant swap.

Abstract: A computer system may access data corresponding to a portfolio that comprises interest rate swaps and may calculate parameters for a compressed swap. The computer system may determine, based at least in part on the parameters for the compressed swap, a performance bond requirement attributable to the interest rate swaps. The computer system may compare the performance bond requirement to account data associated with a holder of the portfolio and may perform one or more additional actions based on the comparing.

Abstract: Systems and methods are provided for a clearing framework for clearing a non-deliverable interest rate swap. The clearing framework includes an application programming interface (API) including functions for processing trade messages including information used by a clearing house computing system in clearing non-deliverable interest rate swaps; one or more user interface screens comprising information corresponding to one or more non-deliverable interest rate swaps and one or more user interface screens comprising information of cleared interest rate swaps, one an API for reporting clearing information, wherein the one or more functions comprise a first messaging function to confirm clearing of the one or more non-deliverable interest rate swaps and a second messaging function to request consent to clear the one or more non-deliverable interest rate swaps.

Abstract: The disclosed embodiments relate to improving the efficiency of an electronic trading system for interest rate swaps (“IRS”) by allowing for IRS contracts to be funded in a base currency while the cash flows, e.g. coupon payments, price alignment interest, variation margin, are denominated in a local currency different from the base currency. Thereby cash flows may be netted and offset minimizing the magnitude of funds needed to be moved and reducing the number of transactions processed by the electronic trading system as well as the consumption of computational resources thereby. Furthermore, the disclosed embodiments facilitate entering into IRS transactions is a currency different from the currency of cash flows while eliminating Herstatt risk due to volatility of foreign exchange rates, which allows for increased off shore participation and thereby increased transaction volume.

Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: A computer implemented method and associated hardware provides optimization of a delivery or settlement process for a group of portfolios. Data records, identified in a portfolio data structure, are indicative of obligations between participants. A graph data structure is generated and includes vertex data records representing the participants and edge data records representing the obligations between participants. The graph structure is analyzed for at least one circular path. A first edge washing out at least a portion of the circular path is identified. An update message is generated in response to the first edge.

Abstract: A computer system may access data corresponding to a portfolio that comprises interest rate swaps and may calculate parameters for a compressed swap. The computer system may determine, based at least in part on the parameters for the compressed swap, a performance bond requirement attributable to the interest rate swaps. The computer system may compare the performance bond requirement to account data associated with a holder of the portfolio and may perform one or more additional actions based on the comparing.

Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: A computer implemented method and associated hardware provides optimization of a delivery or settlement process for a group of portfolios and calculation of a transaction suggestion to one or more participants. Data records, identified in a portfolio data structure, are indicative of obligations between participants. A weighted directed graph data structure is generated and includes vertex data records representing the participants and edge data records representing the obligations between participants. The weighted directed graph structure is analyzed for at least one series of multiple vertex data records or multiple edge data records. A proposed edge associated with a first vertex of the series and a second vertex of the at least one series is identified. A report is generated that describes at least one transaction in response to the proposed edge associated with the first vertex of the series and the second vertex of the series for the at least one of the participants.

Abstract: A computer implemented method for optimizing a delivery or settlement process for a plurality of portfolios of a plurality of participants. Data records indicative of obligations between the plurality of participants are identified. A weighted directed graph data structure is generated that comprises vertex data records representing the plurality of participants and edge data records representing the obligations between the participants. All paths of edge data records where a vertex data record is reachable from itself in the weighted directed graph data structure are identified. The data records indicative of obligations between the plurality of participants are altered based on the identified paths.

Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.

Abstract: A computer implemented method for optimizing a delivery or settlement process for a plurality of portfolios of a plurality of participants. Data records indicative of obligations between the plurality of participants are identified. A weighted directed graph data structure is generated that comprises vertex data records representing the plurality of participants and edge data records representing the obligations between the participants. All paths of edge data records where a vertex data record is reachable from itself in the weighted directed graph data structure are identified. The data records indicative of obligations between the plurality of participants are altered based on the identified paths.

Abstract: Systems and methods for blending a plurality of FX forwards may include determining a signed sum of notional values associated with each of the primary currency component and the settlement currency component of each of the plurality of FX forwards for use in blending the plurality of FX forwards, each of the plurality of FX forwards having matching economics and a different associated fixed rate. A computing device may determine one or more remnant FX forwards to blend the plurality of FX forwards based, at least in part, using the determined sums of the notional values. This may reduce the gross notional and/or the total clearing line items associated with the original FX forwards. In some cases, the computing device may determine a single currency FX forward for blending the plurality of FX forwards.