scheduling

Quartz Thread Execution Parallel or Sequential?

这一生的挚爱 提交于 2019-11-30 18:18:51
问题 We have a quartz based scheduler application which runs about 1000 jobs per minute which are evenly distributed across seconds of each minute i.e. about 16-17 jobs per second. Ideally, these 16-17 jobs should fire at same time, however our first statement, which simply logs the time of execution, of execute method of the job is being called very late. e.g. let us assume we have 1000 jobs scheduled per minute from 05:00 to 05:04. So, ideally the job which is scheduled at 05:03:50 should have

How is a warp formed and handled by the hardware warp scheduler?

醉酒当歌 提交于 2019-11-30 17:02:21
My questions are about warps and scheduling. I'm using NVIDIA Fermi terminology here. My observations are below, are they correct? A. Threads in the same warp execute the same instruction. Each warp includes 32 threads. According to the Fermi Whitepaper: "Fermi’s dual warp scheduler selects two warps, and issues one instruction from each warp to a group of sixteen cores, sixteen load/store units, or four SFUs. " From here, I think a warp(32 threads) is scheduled twice since 16 cores out of 32 are grouped together. Each scheduler issues half of a warp to 16 cores in a cycle, and in all, two

Why one non-voluntary context switch per second?

﹥>﹥吖頭↗ 提交于 2019-11-30 14:51:08
The OS is RHEL 6 (2.6.32). I have isolated a core and am running a compute intensive thread on it. /proc/{thread-id}/status shows one non-voluntary context switch every second. The thread in question is a SCHED_NORMAL thread and I don't want to change this. How can I reduce this number of non-voluntary context switches? Does this depend on any scheduling parameters in /proc/sys/kernel? EDIT : Several responses suggest alternative approaches. Before going that route, I first want to understand why I am getting exactly one non-voluntary context switch per second even over hours of run. For

How to implement a practical fiber scheduler?

别来无恙 提交于 2019-11-30 14:08:20
问题 I know the very basics about using coroutines as a base and implementing a toy scheduler. But I assume it's oversimplified view about asynchronous schedulers in whole. There are whole set of holes missing in my thoughts. How to keep the cpu from running a scheduler that's running idle/waiting? Some fibers just sleep, others wait for input from operating system. 回答1: You'd need to multiplex io operations into an event based interface(select/poll), so you can leverage the OS to do the waiting,

Spring3 's @Transactional @Scheduled not committed to DB?

北慕城南 提交于 2019-11-30 13:41:24
This is my 1st time trying Spring3's @Scheduled , but found I cannot commit to DB. This is my code : @Service public class ServiceImpl implements Service , Serializable { @Inject private Dao dao; @Override @Scheduled(cron="0 0 * * * ?") @Transactional(rollbackFor=Exception.class) public void hourly() { // get xxx from dao , modify it dao.update(xxx); } } I think it should work , I can see it starts-up hourly and load xxx from DB , but data is not committed to DB. There's been tx:annotation-driven in spring's xml : <bean id="entityManagerFactoryApp" class="org.springframework.orm.jpa

Azure Task Scheduler

送分小仙女□ 提交于 2019-11-30 11:28:24
问题 While this question is particular to Azure, I'm sure that it is a common situation for cloud computing in general. I have a list of tasks that I need run at a certain time. With a window's server, I can use Task Scheduler and schedule my program to run at a certain time. I could go a step further and create a windows service that would run at a given interval and then execute the appropriate task. Does anyone have a suggestion on the best approach is for a cloud computing environment? I could

Niceness and priority processes on Linux system

霸气de小男生 提交于 2019-11-30 11:07:32
I am looking for a way to modify a process' priority through command line. I found the builtin (bash) nice and the command renice which allow to modify the niceness of the process, but not the actual priority which is calculated by the kernel. Is there a command which allows to set the priority? (Or am I confused between niceness and priority?) Turbo J The priority of a process in linux is dynamic: The longer it runs, the lower its priority will be. A process runs when its actually using the CPU - most processes on a typical Linux box just wait for I/O and thus do not count as running . The

What are the better (pseudo) random number generator than the LCG for lottery scheduler?

a 夏天 提交于 2019-11-30 10:22:00
I want to design a lottery scheduler and I need to have a very good (pseudo) random number generator similar to LCG but I was wondering if there are other better choice out there or not? I am specifically looking for random generators written in C. LCG code: unsigned long lcg_rand(unsigned long a) { return (a * 279470273UL) % 4294967291UL; } Also I would like to know if srand() can be used for this purpose or is not highly accurate? If you need simple but decent quality, I would use the upper 32 (or fewer) bits of a 64-bit LCG, possibly with a tempering function applied to the output. When

Relational Schema for Fowler's Temporal Expressions

可紊 提交于 2019-11-30 10:19:23
问题 Martin Fowler defines an elegant object model for the scheduling of recurring tasks here, which maps to OO code very nicely. Mapping this to a relational database schema for persistence, however, is tricky. Can anyone suggest a schema + SQL combination that encapsulates all the functionality he describes, particularly in the image on page 11. Intersects and Unions are fairly obvious - the complexity lies in representing the 'Temporal Expressions', which take variable parameters and must be

Hungarian Algorithm and multiple factors

蓝咒 提交于 2019-11-30 10:12:12
I have a situation where I need to allocate people to several events. If we just had a price as a factor, it would be fine, but there is a number of factors that come in. First, some background. This is for a non-profit organization that promotes story hours for children that are hospitalized for any reason, so they depend on voluntary work to do so. So, since they rely on people's good will, they give people as much work as people can / want to do, which varies like: Some people can only do mornings, and some other people can only do afternoons; Some people can only do Mondays, and Thursdays,