Split queuing archive requests in top and bottom half.
The top half goes as far as when the request is safe in the object store. At that point, the bottom half is launched in a new thread, and success is returned the called. This will enable lower latency for the users while retaining the same data safety. This version is experimental aas it spans an undetermined number of threads. A more controlled version with a work queue should be implenented on the long run.
Showing
- scheduler/OStoreDB/OStoreDB.cpp 111 additions, 88 deletionsscheduler/OStoreDB/OStoreDB.cpp
- scheduler/OStoreDB/OStoreDB.hpp 3 additions, 0 deletionsscheduler/OStoreDB/OStoreDB.hpp
- scheduler/OStoreDB/OStoreDBFactory.hpp 4 additions, 0 deletionsscheduler/OStoreDB/OStoreDBFactory.hpp
- scheduler/OStoreDB/OStoreDBTest.cpp 1 addition, 0 deletionsscheduler/OStoreDB/OStoreDBTest.cpp
- scheduler/Scheduler.cpp 7 additions, 0 deletionsscheduler/Scheduler.cpp
- scheduler/Scheduler.hpp 5 additions, 0 deletionsscheduler/Scheduler.hpp
- scheduler/SchedulerDatabase.hpp 4 additions, 0 deletionsscheduler/SchedulerDatabase.hpp
- scheduler/SchedulerTest.cpp 4 additions, 0 deletionsscheduler/SchedulerTest.cpp
- tapeserver/castor/tape/tapeserver/daemon/DataTransferSessionTest.cpp 4 additions, 0 deletions...castor/tape/tapeserver/daemon/DataTransferSessionTest.cpp
Loading
Please register or sign in to comment