ISSN:
1432-0541
Schlagwort(e):
Euclid's algorithm
;
Fairness
;
Network flow
;
Periodic scheduling
;
Resource allocation
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract Given a set ofn tasks andm resources, where each taskx has a rational weightx.w=x.e/x.p,0〈x.w〈1, aperiodic schedule is one that allocates a resource to a taskx for exactlyx.e time units in each interval [x.p·k, x.p·(k+1)) for allk∈N. We define a notion of proportionate progress, called P-fairness, and use it to design an efficient algorithm which solves the periodic scheduling problem.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01940883
Permalink