scheduling | 易学教程

Run a powershell script in the background once per minute

阅读更多关于 Run a powershell script in the background once per minute

问题 I want a powershell script to be run once per minute in the background. No window may appear. How do I do it? 回答1: Use the Windows Task Scheduler and run your script like this: powershell -File myScript.ps1 -WindowStyle Hidden Furthermore create the script that it runs under a specific user account and not only when that user is logged on . Otherwise you'll see a console window. 回答2: Perhaps this scenario will do. We do not start PowerShell executable every minute (this is expensive, BTW).

Optimized algorithm to schedule tasks with dependency?

阅读更多关于 Optimized algorithm to schedule tasks with dependency?

问题 There are tasks that read from a file, do some processing and write to a file. These tasks are to be scheduled based on the dependency. Also tasks can be run in parallel, so the algorithm needs to be optimized to run dependent tasks in serial and as much as possible in parallel. eg: A -> B A -> C B -> D E -> F So one way to run this would be run 1, 2 & 4 in parallel. Followed by 3. Another way could be run 1 and then run 2, 3 & 4 in parallel. Another could be run 1 and 3 in serial, 2 and 4 in

Is there a scheduling algorithm that optimizes for “maker's schedules”?

阅读更多关于 Is there a scheduling algorithm that optimizes for “maker's schedules”?

问题 You may be familiar with Paul Graham's essay, "Maker's Schedule, Manager's Schedule" . The crux of the essay is that for creative and technical professionals, meetings are anathema to productivity, because they tend to lead to "schedule fragmentation", breaking up free time into chunks that are too small to acquire the focus needed to solve difficult problems. In my firm we've seen significant benefits by minimizing the amount of disruption caused, but the brute-force algorithm we use to

Comparing DateTime structs to find free slots

阅读更多关于 Comparing DateTime structs to find free slots

问题 I would like to search through the events of all of the users in a list and retrieve all times where every user is free of 30mins or greater between 7AM-7PM. There is a catch however, if a method is marked as 'recurring', ie the bit recurring is set to 1, then that event recurs for a period of 52 weeks after its beginning (so the time is not available). Retrieval of these events are taken care of in a stored procedure. My code so far is below. Am I going about writing this procedure the right

OpenMP Dynamic vs Guided Scheduling

阅读更多关于 OpenMP Dynamic vs Guided Scheduling

问题 I'm studying OpenMP's scheduling and specifically the different types. I understand the general behavior of each type, but clarification would be helpful regarding when to choose between dynamic and guided scheduling. Intel's docs describe dynamic scheduling: Use the internal work queue to give a chunk-sized block of loop iterations to each thread. When a thread is finished, it retrieves the next block of loop iterations from the top of the work queue. By default, the chunk size is 1. Be

“Work stealing” vs. “Work shrugging”?

阅读更多关于 “Work stealing” vs. “Work shrugging”?

Why is it that I can find lots of information on "work stealing" and nothing on "work shrugging" as a dynamic load-balancing strategy? By "work-shrugging" I mean pushing surplus work away from busy processors onto less loaded neighbours, rather than have idle processors pulling work from busy neighbours ("work-stealing"). I think the general scalability should be the same for both strategies. However I believe that it is much more efficient, in terms of latency & power consumption, to wake an idle processor when there is definitely work for it to do, rather than having all idle processors

how to shield a cpu from the linux scheduler (prevent it scheduling threads onto that cpu)?

阅读更多关于 how to shield a cpu from the linux scheduler (prevent it scheduling threads onto that cpu)?

问题 It is possible to use sched_setaffinity to pin a thread to a cpu, increasing performance (in some situations) From the linux man page: Restricting a process to run on a single CPU also avoids the performance cost caused by the cache invalidation that occurs when a process ceases to execute on one CPU and then recommences execution on a different CPU Further, if I desire a more real-time response, I can change the scheduler policy for that thread to SCHED_FIFO , and up the priority to some

How have you implemented SCRUM for working alone? [closed]

阅读更多关于 How have you implemented SCRUM for working alone? [closed]

I am working alone at the beginning of a sizable open source project and would like to leverage some of the core ideas/methods from Scrum to help manage my time and remain focused on development and deploying early, demonstrable functionality. I would like to hear from others who have used Scrum alone and what you have found particularly useful to these ends. Thanks. You might take a look at Peter Bell's post on Solo Scrum including the comments. If you're after solo, focusing timeboxes, try the pomodoro technique - 25 mins doing stuff, 5 mins reflection. There's a great free app here: http:/

DAG(directed acyclic graph) dynamic job scheduler

阅读更多关于 DAG(directed acyclic graph) dynamic job scheduler

问题 I need to manage a large workflow of ETL tasks, which execution depends on time, data availability or an external event. Some jobs may fail during execution of the workflow and the system should have the ability to restart a failed workflow branch without waiting for whole workflow to finish execution. Are there any frameworks in python that can handle this? I see several core functions: DAG bulding Execution of nodes (run shell cmd with wait,logging etc.) Ability to rebuild sub-graph in

Worker Scheduling Algorithm

阅读更多关于 Worker Scheduling Algorithm

The Problem Here's the essence of the problem I want to solve. We have workers taking care of children in a nursery for set times during the weekend. There's 16 different slots to fill in one weekend. So for a 4-week month there's 64 slots to fill. We have at max 30 nursery workers (though we need much more. anybody like kids?). EDIT: Each time slot is discrete - they don't overlap. Currently there's a person who comes up with the nursery schedule each month. It's a complex and time consuming task to make this schedule every month with everybody's preferences. After considering the problem I