MQSim is a fast and accurate simulator modeling the performance of modern multi-queue (MQ) SSDs as well as traditional SATA based SSDs. MQSim faithfully models new high-bandwidth protocol implementations, steady-state SSD conditions, and the full end-to-end latency of requests in modern SSDs. It is described in detail in the FAST 2018 paper by Arash Tavakkol et al., "MQSim: A Framework for Enabling Realistic Studies of Modern Multi-Queue SSD Devices" (https://people.inf.ethz.ch/omutlu/pub/MQSim-SSD-simulation-framework_fast18.pdf)
Thanks for your open soruce Simulator and Publications, I can have a few knowledge about ssd Transaction scheduling.
I want to learn more and more, so I am watching FLIN code with FILN publication.
I am trying to understand FLIN algorithm with publication and TSU_FLIN.cpp
I think , in TSU_FILN.cpp there is some miss and some codes don't correspond to FLIN publications.
for example , TSU_FLIN::fairness_based_on_average_slowdown() , TSU_FLIN::reorder_for_fairness()
So, I really wondering that TSU_FLIN was perfectly completed to run successfully?
Thanks for your open soruce Simulator and Publications, I can have a few knowledge about ssd Transaction scheduling. I want to learn more and more, so I am watching FLIN code with FILN publication. I am trying to understand FLIN algorithm with publication and TSU_FLIN.cpp
I think , in TSU_FILN.cpp there is some miss and some codes don't correspond to FLIN publications. for example , TSU_FLIN::fairness_based_on_average_slowdown() , TSU_FLIN::reorder_for_fairness()
So, I really wondering that TSU_FLIN was perfectly completed to run successfully?