3934 search results - page 39 / 787 » Approximate Schedulability Analysis |
176
click to vote
IWQOS
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we study the performance of opportunistic scheduling for downlink data transmissions with type-II packet-combining hybrid ARQ in a multirate cellular network for a f...
195
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
176
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
150
click to vote
ISCA
2008
IEEE
15 years 6 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
147
click to vote
ANSS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...