Activity Based Electrical Computer System Request Processing Architecture

2. The system of claim 1, wherein different subsets of the one or more sources are located in different geographic regions, at least one which is different from a geographic region in which the matching engine is located, one or more of the different geographic regions being characterized as being in a different time zone from another of the geographic regions.

3. The system of claim 2, wherein requests are received by the matching engine from each subset of the one or more sources during a working day in the time zone of the geographic region in which the subset of the one or more sources is located.

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

5. The system of claim 1, wherein the matching engine is further configured to transmit a notification to the one or more sources that the one or more stored requests have been removed from the memory, the time interval comprising a delay between when the one or more stored requests have been removed from the memory and when the one or more sources are expected to have received the notification.

6. The system of claim 1, wherein the time interval is defined based on a delay between when a source of the one or more sources is expected to have learned of a request being stored in the memory to when that source is expected to have learned that the stored request has been removed from the memory.

7. The system of claim 1, wherein the time interval is first determined by determining how much time it takes to receive a predetermined number of requests.

8. The system of claim 1, wherein the processor is further configured to store the received request in the memory to be matched with a subsequently received request counter thereto when the received request does not match with any of the stored requests.

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

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

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

12. The system of claim 1, wherein the processor is further configured to determine, upon expiration of the time interval, a transaction price for the matched received request and the one or more of the stored requests complementary thereto.

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

15. The computer implemented method of claim 14, wherein different subsets of the one or more sources are located in different geographic regions, at least one which is different from a geographic region in which the matching engine is located, one or more of the different geographic regions being characterized as being in a different time zone from another of the geographic regions.

16. The computer implemented method of claim 15, wherein requests are received by the matching engine from each subset of the one or more sources during a working day in the time zone of the geographic region in which the subset of the one or more sources is located.

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

18. The computer implemented method of claim 14, further comprising transmitting a notification to the one or more sources that the one or more stored requests have been removed from the memory, the time interval comprising a delay between when the one or more stored requests have been removed from the memory and when the one or more sources are expected to have received the notification.

19. The computer implemented method of claim 14, wherein the time interval is defined based on a delay between when a source of the one or more sources is expected to have learned of a request being stored in the memory to when that source is expected to have learned that the stored request has been removed from the memory.

20. The computer implemented method of claim 14, further comprising determining the time interval by first determining how much time it takes to receive a predetermined number of requests.

21. The computer implemented method of claim 14, wherein the time interval is dynamically defined based on a count of unique requests received by the matching engine.

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

23. The computer implemented method of claim 14, wherein the counted number of received requests is an indication of volatility.

24. The computer implemented method of claim 14, further comprising determining, upon expiration of the time interval, a transaction price for the matched received request and the one or more of the stored requests complementary thereto.