I’m working on <#C0A974TJ9|ktor> (web framework) a...
# datascience
o
I’m working on #ktor (web framework) and in background thinking about balancing requests queueing in a worker thread pool. The main issue here is when there are several long-running requests, they could fill the queues and other requests that otherwise would be instant are spending their time in queues. Of course, there are plenty of balancing algorithms with this or that idea behind them, like “keep a fast lane for specific preconfigured requests”, etc . I wonder if it is possible, for a given application, train a machine to predict processing time from the URL alone, and then schedule it based on the estimation. It shouldn’t be very precise, but it should train fast. Any ideas?