3934 search results - page 81 / 787 » Approximate Schedulability Analysis |
235
click to vote
LCN
2005
IEEE
16 years 1 months ago
2005
IEEE
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...
231
Voted
ANOR
2007
15 years 7 months ago
2007
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
207
click to vote
RTCSA
2000
IEEE
15 years 12 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
178
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
190
click to vote
RTS
2002
15 years 7 months ago
2002
A scheduling architecture for real-time control tasks is proposed. The scheduler uses feedback from execution-time measurements and feedforward from workload changes to adjust the...