Data processing system

• US 20050132377A1
• Filed: 01/19/2005
• Published: 06/16/2005
• Est. Priority Date: 07/24/2002
• Status: Active Grant

• Current Assignee: Information Mosaic Ltd. (S&P Global Inc.)
• Original Assignee: Information Mosaic Ltd. (S&P Global Inc.)
• Inventors: Byrne, John, Mcilhagga, Elaine, O'Donnell, Grace
• Granted Patent: US 7,712,097 B2
• Time in Patent Office: Days
• US Class Current: 718/101
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions

Abstract

A data processing system (1) is programmed with objects (2) according to the object-oriented architecture. Each object (2) is for implementing an event, which for financial securities processing is often referred to as a corporate action. An object (2) has a container (3) containing a series of masks (4), all at the same level in a flat structure. Each mask has four binary bit flags, each switching on or off a pre-stored unit (5) of executable code for an asynchronous transaction. Initialisation or modifications of the system involves only processing through a series of decisions and setting mask flags accordingly.

Claims

1. A data processing system comprising:

a processor,

a memory,

an input interface,

an output interface,

the processor being programmed to perform data processing operations to complete an event,

wherein an event is represented in the processor as an object comprising a mask switching on or off one or more of a number of units of executable code, and

wherein each unit of executable code is for implementing a transaction.

2. A data processing system as claimed in claim 1, wherein there is a pre-defined and fixed number of units of executable code.

3. A data processing system as claimed in claim 1, wherein:

there is a pre-defined and fixed number of units of executable code,

the mask comprises a series of flags,

each flag position is associated with a unit of executable code, and

each flag value sets an on or off switch value for an associated unit of executable code.

4. A data processing system as claimed in claim 1, wherein:

the object comprises a plurality of masks,

each mask is associated with a subsidiary event within the event, and

each subsidiary event comprises one or more transactions.

5. A data processing system as claimed in claim 4, wherein:

the masks are stored in at least one word having a plurality of masks, and

each mask has a plurality of flags.

6. A data processing system as claimed in claim 1, wherein:

there is a pre-defined and fixed number of units of executable code,

the mask comprises a series of flags,

each flag position is associated with a unit of executable code,

each flag value sets an on or off switch value for an associated unit of executable code, and

a flag is a binary bit.

7. A data processing system as claimed in claim 4, wherein:

the masks are stored in at least one word having a plurality of masks,

each mask has a plurality of flags, and

a word is a 64-bit long.

8. A data processing system as claimed in claim 4, wherein:

the masks are stored in at least one word having a plurality of masks,

each mask has a plurality of flags, and

the object stores a numerical value representing the bits of each word.

9. A data processing system as claimed in claim 4, wherein:

the masks are stored in at least one word having a plurality of masks,

each mask has a plurality of flags,

the object stores a numerical value representing the bits of each word, and

the word comprises binary bits and the numerical value is a decimal value.

10. A data processing system as claimed in claim 1, wherein:

the masks are in a linear series flat logical structure, and

the processor is programmed to execute the units of the masks in sequence.

11. A data processing system as claimed in claim 4, wherein:

the masks are stored in at least one word having a plurality of masks,

each mask has a plurality of flags,

the object contains an array comprising a plurality of indexes, and

each index addresses a word comprising a plurality of masks.

12. A data processing system as claimed in claim 1, wherein at least some of the transactions are asynchronous, without a return direction acknowledgement.

13. An initialisation method for a system as claimed in claim 1, the method comprising the steps of:

deciding in sequence if each of a limited number of pre-stored units of

executable code are required for an event, and

setting a switch value in a mask for the event accordingly.

14. An initialisation method as claimed in claim 13, wherein the switch values are set as attributes of an object representing the event.

15. An initialisation method as claimed in claim 13, wherein:

the switch values are set as attributes of an object representing the event, and

the flags are set with a fixed offset in a word for each unit decision.

16. A computer program product comprising software code for performing a method of claim 13 when executing on a digital computer.