Space-efficient scheduling of stochastically generated tasks

Details Space-efficient scheduling of stochastically generated tasks Space-efficient scheduling of stochastically generated tasks

2010-04-24

arxiv.org/abs/1004.4286v2

Computer Science

Performance

technical report accompanying an ICALP'10 paper

Scientific paper

We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fixed, known probability of generating other tasks. We present results on the random variable S^sigma modeling the maximal space needed by the processor to store the currently active tasks when acting under the scheduler sigma. We obtain tail bounds for the distribution of S^sigma for both offline and online schedulers, and investigate the expected value of S^sigma.

Affiliated with

Also associated with

No associations

Rating

Space-efficient scheduling of stochastically generated tasks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Space-efficient scheduling of stochastically generated tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Space-efficient scheduling of stochastically generated tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-387302