You must using original code that I provieded
Extend your program from Assignment 1 (or the provided solution) to simulate a miner that prioritizes
high value transactions, packs blocks for maximal profit but, ensures that all transactions eventually get
processed. Your program must be compiled to an executable called miner. The program will read in five
events. The first four are the same events as in Assignment 1 and the fifth event, called epoch triggers an
aging operation in the miner’s transaction queue.
Please see the Problem Statement in Assignment 1 for a description of the first four events.
On an epoch event, your program must
1. Update the priorities of transactions in the mempool as described in the Processing Section below.
Note: the changes to the simulator in Assignment 2 deal with how the transactions are selected for processing. All other functionality remains the same.
0 comments