Re: trees
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Sat, 26 Jul 2008 20:55:07 -0400
sngtnair84@xxxxxxxxx wrote:
I want to implement the following but Im not sure what data
structure to use.
I have a list of jobs that need to be allocated to schedulers.
The number of schedulers in the system depend upon the number of
jobs. Each scheduler can handle between n & m jobs. Each
scheduler handles at the max m jobs. The resulting tree structure
should be "balanced" - in the sense there shouldn't be any
scheduler with too few jobs and none with too many. I should be
able to freely move around the jobs to different schedulers
without breaking the "balance" in the system.
Make yourself a struct (or equivalent, depending on language)
describing a scheduler. Do the same for a job. Then build
software to do what you want. You will be free to revise the
structs as needed, and eventually you will probably come up with a
workable system. Obviously if you are free to move jobs to
schedulers the results can easily become unbalanced.
--
[mail]: Chuck F (cbfalconer at maineline dot net)
[page]: <http://cbfalconer.home.att.net>
Try the download section.
.
- References:
- trees
- From: sngtnair84
- trees
- Prev by Date: Re: trees
- Next by Date: Re: trees
- Previous by thread: Re: trees
- Next by thread: Re: trees
- Index(es):
Relevant Pages
|
