Method and a scheduler for controlling when a server...

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 9/46 (2006.01) G06F 9/48 (2006.01) G06F 9/50 (2006.01) H04L 29/06 (2006.01)

Patent

CA 2150967

The present invention pertains to a method for scheduling when a server provides service to entities. The method comprises the steps of identifying when a first entity requests service from the server. Next there is the step of providing service to an entity, such as a first entity or a second entity, as a function of virtual time. The present invention pertains to a scheduler for controlling when a server provides service to entities. The scheduler comprises a memory having times which are a function of when entities request service from the server. The scheduler is also comprised of a virtual clock that keeps track of time. The scheduler is also comprised of a controller which causes an entity to receive service from the server as a function of virtual time. The present invention pertains to a scheduler for scheduling when N entities each of which has a weight w, where N is an integer > 1 and w is a real number, are served by a server. The scheduler is comprised of a starting time memory having starting times s i when the N entities request service, where 1 ~ i ~ N and is an integer, and s i is the time at which the i'th entity may next get service from the server. The scheduler is also comprised of a finishing time memory having f i finishing times f i when the N entities should be serviced, where f i is the time by which the i'th entity should be serviced by the server. The scheduler is also comprised of a virtual clock that keeps track of time V k where k ~ 0 and is an integer and -50- V k=MAX((V k-1+P) + (1*X) + ((1/AW)*T), (s smin*Y) + ((f Fmin - S smin)*Z)) where(~P~+~T~+~X~)*(~Y~+~Z~)> 0 where S Smin is the earliest start time s i of when an entity requests service from the server; f Fmin is the earliest finish time of an entity waiting for service from the server; V k-1 is the virtual time when the server last served an entity; A W = sum over all entities currently asking for service of w i, where w i is the i'th entity's weight; and X, T, Y and Z are real numbers. If rate control is utilized, then Y=Z=0 and the last line of the equation is not applicable, or in other words, V k = V k-l +1.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Method and a scheduler for controlling when a server... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and a scheduler for controlling when a server..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and a scheduler for controlling when a server... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1562940

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.