Identify algorithm for my resource allocation needs
I’m trying to automate a task and I lack the right vocabulary to look up the correct algorithm. It really feels like a common problem that has likely been solved many times before.
Identify algorithm for my resource allocation needs
I’m trying to automate a task and I lack the right vocabulary to look up the correct algorithm. It really feels like a common problem that has likely been solved many times before.
Identify algorithm for my resource allocation needs
I’m trying to automate a task and I lack the right vocabulary to look up the correct algorithm. It really feels like a common problem that has likely been solved many times before.
Scheduling a few CPU-intensive tasks
I need to schedule a small number of CPU-intensive tasks to run every so often, reading from shared data and writing to dedicated buffers. I don’t necessarily want to roll my own scheduling, but am unsure if libraries like Quartz are appropriate for this small of scale. I’m using Java 8 in a server environment, but with isolated nodes and it doesn’t matter if a few iterations are lost every now and then.
Converting cron schedule to time intervals
I have, on the server, many jobs defined by users and some of those jobs are scheduled using cron expressions. I need to check (I can execute Groovy/Java on the server) if those jobs take longer than they are scheduled (I mean job is taking 10 minutes, but scheduled to run every 5 minutes).
Converting cron schedule to time intervals
I have, on the server, many jobs defined by users and some of those jobs are scheduled using cron expressions. I need to check (I can execute Groovy/Java on the server) if those jobs take longer than they are scheduled (I mean job is taking 10 minutes, but scheduled to run every 5 minutes).
How to effectively split jobs into groups for multiprocessing when the job sizes are unknown
With K processor cores, how to optimally split N jobs into groups, with each group to be processed sequentially by one processor core, when the time to process each job is unknown ahead of time and there is overhead associated with processing each group of jobs?
Ensure scheduled event only runs once a day?
In a hobby project of mine, a “smart home” for controlling lights, I’m planning to create a feature which turns off all lights at a given time of day. There are also several other features which runs on command.
Correct definition of “bandwidth preserving algorithms” in real-time scheduling?
I’ve seen conflicting definitions for the term “bandwidth preserving algorithms”. The two definitions I’ve seen are:
Real-time theory: how is period transformation implemented with delay requests?
To deal with transient overloads with a real-time system scheduled with rate-monotonic scheduling, one can use period transformation to reduce the period of important processes so that they have greater priority. In Scheduling Hard Real-Time Systems: a Review, A. Burns says (pages 4 to 5 of the PDF) that this can be done by: