Activity based electrical computer system request processing architecture

1. A system comprising:

a plurality of client computers coupled with a server by a computer network via which each of the client computers is configured to provide requests thereto;

the server comprising a memory for storing requests received from the plurality of client computers which have not yet been matched with a complementary request, the server being configured to:

match a request received from one of the plurality of client computers with one or more of the stored requests complementary thereto and, based thereon, remove the one or more stored requests from the memory;

count, during a time interval subsequent to the match, unmatched requests received from the plurality of client computers which are complementary to the removed one or more stored requests; and

output the counted number of unmatched requests as an indication of activity in the system.

2. The system of claim 1 , wherein the server is one of a plurality of servers, each located in a different geographic region.

3. The system of claim 2 , wherein each of the plurality of servers is coupled with a different plurality of client computers.

4. The system of claim 2 , wherein each of the plurality of servers synchronizes the requests stored in the memory thereof with requests stored in the memories of the others of the plurality of servers.

5. The system of claim 1 , wherein each of the plurality of client computers is located in a different geographic region.

6. The system of claim 1 , wherein the server is further configured to store, in the memory, received requests for which no stored requests are complementary thereto.

7. The system of claim 1 , wherein each of the requests comprise orders to trade one or more financial instruments.

8. The system of claim 1 , wherein the server comprises a matching engine.

9. The system of claim 1 , wherein the stored requests comprise a central limit order book.

10. The system of claim 1 , wherein the requests are provided in XML format.

11. The system of claim 1 , wherein stored requests are matched with a received request by price and time priority.

12. The system of claim 1 , wherein the time interval is different for different received requests.

13. The system of claim 1 , wherein the time interval is defined based on a delay between a client computer of the plurality of client computers learning of a request being stored in the memory to learning that the stored request has been removed from the memory.

14. The system of claim 1 , wherein the time interval is dynamically defined based on a count of unique requests received by the server.

15. The system of claim 1 , wherein the server is further configured to execute another transaction at a value computed based on the counted number of unmatched requests.

16. The system of claim 1 , wherein the counted number of unmatched requests is an indication of volatility.

17. A computer implemented method comprising:

receiving, by a server, a request from one of a plurality of client computers coupled with a server by a computer network via which each of the client computers is configured to provide requests thereto, the server comprising a memory for storing requests received from the plurality of client computers which have not yet been matched with a complementary request;

matching, by the server, the received request with one or more of the stored requests complementary thereto and, based thereon, removing the one or more stored requests from the memory;

counting, by the server during a time interval subsequent to the matching, unmatched requests received from the plurality of client computers which are complementary to the removed one or more stored requests; and

outputting, by the server, the counted number of unmatched requests as an indication of activity.

18. The computer implemented method of claim 17 , wherein the server is one of a plurality of servers, each located in a different geographic region.

19. The computer implemented method of claim 18 , wherein each of the plurality of servers is coupled with a different plurality of client computers.

20. The computer implemented method of claim 18 , further comprising synchronizing, by each of the plurality of servers, the requests stored in the memory thereof with requests stored in the memories of the others of the plurality of servers.

21. The computer implemented method of claim 17 , wherein each of the plurality of client computers is located in a different geographic region.

22. The computer implemented method of claim 17 , further comprising storing, by the server in the memory, received requests for which no stored requests are complementary thereto.

23. The computer implemented method of claim 17 , wherein each of the requests comprise orders to trade one or more financial instruments.

24. The computer implemented method of claim 17 , wherein the server comprises a matching engine.

25. The computer implemented method of claim 17 , wherein the stored requests comprise a central limit order book.

26. The computer implemented method of claim 17 , wherein the requests are provided in XML format.

27. The computer implemented method of claim 17 , wherein stored requests are matched with a received request by price and time priority.

28. The computer implemented method of claim 17 , wherein the time interval is different for different received requests.

29. The computer implemented method of claim 17 , wherein the time interval is defined based on a delay between a client computer of the plurality of client computers learning of a request being stored in the memory to learning that the stored request has been removed from the memory.

30. The computer implemented method of claim 17 , wherein the time interval is dynamically defined based on a count of unique requests received by the server.

31. The computer implemented method of claim 17 , further comprising executing, by the server, another transaction at a value computed based on the counted number of unmatched requests.

32. The computer implemented method of claim 17 , wherein the counted number of unmatched requests is an indication of volatility.

33. An apparatus comprising:

a memory for storing requests received from a plurality of client computers via a computer network which have not yet been matched with a complementary request; and

the apparatus being configured to:

match a request received from one of the plurality of client computers with one or more of the stored requests complementary thereto and, based thereon, remove the one or more stored requests from the memory;

count, during a time interval subsequent to the match, unmatched requests received from the plurality of client computers which are complementary to the removed one or more stored requests; and

output the counted number of unmatched requests as an indication of activity in the system.

34. A non-transitory computer readable medium comprising instructions executable by a processor which, when executed by the processor, cause the processor to:

receive a request from one of a plurality of client computers via a computer network via which each of the client computers is configured to provide requests thereto;

store, in a memory, requests received from the plurality of client computers which have not yet been matched with a complementary request;

match the received request with one or more of the stored requests complementary thereto and, based thereon, remove the one or more stored requests from the memory;

count, during a time interval subsequent to the match, unmatched requests received from the plurality of client computers which are complementary to the removed one or more stored requests; and

output the counted number of unmatched requests as an indication of activity.