- Test:
- document the memory management scheme used by the Scheduler.
- See also
- SchedulerActivity_test
-
SchedulerUsage_test
Definition at line 81 of file block-flow-test.cpp.
|
virtual void | run (Arg arg)=0 |
|
◆ simpleUsage()
◆ handleEpoch()
- Test:
- cover properties and handling of Epochs (low-level)
- demonstrate that each Epoch is placed into an Extent
- verify that both Extent and Epoch access the same memory block
- demonstrate the standard setup and initialisation of an Epoch
- allocate some Activities into the storage and observe free-managment
- detect when the Epoch is filled up
- verify alive / dead decision relative to given deadline
- Note
- this test covers helpers and implementation structures of BlockFlow, without actually using a BlockFlow instance; rather, the typical handling and low-level bookkeeping aspects are emulated and observed
Definition at line 132 of file block-flow-test.cpp.
◆ placeActivity()
◆ adjustEpochs()
- Test:
- load based regulation of Epoch spacing
- on overflow, capacity is boosted by a fixed factor
- on clean-up, a moving average of (in hindsight) optimal length is computed and used as the new Epoch spacing
Definition at line 323 of file block-flow-test.cpp.
◆ announceLoad()
◆ storageFlow()
- Test:
- investigate progression of epochs under realistic load
- expose the allocator to a load of 200fps for simulated 3 Minutes
- assuming 10 Activities per frame, this means a throughput of 360000 Activities
- run this load exposure under saturation for performance measurement
- use a planning to deadline delay of 500ms, but with ±200ms random spread
- after 250ms (500 steps), »invoke« by accessing and adding the random checksum
- run a comparison of all-pre-allocated ⟷ heap allocated ⟷ Refcount ⟷ BlockFlow
Definition at line 403 of file block-flow-test.cpp.
The documentation for this class was generated from the following file: