hi, I am new to this group, I am looking for an algorithm for allocating time-slots in a scheduling table. Scheduling table has a depth of n ( max value 2048 ) time slots and it can be used to schedule m ( max value 512 ) queues. A queue can have at most 12 time slots in the calendar table. Main requirement is that time slots allocated to a queue in the calendar table should be approximately equidistant from each other. For example: let us say a queue requires 2 times slots in the calendar table and calendar depth is 252 then algorithm should allocate slots approximately 126 time slots apart ( e.g time slot 0 and time slot 126 ).
Can anybody point me to an algorithm with similar requirements. thanks and regards. __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
