1095 search results - page 65 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
81
Voted
PDPTA
2004
14 years 11 months ago
2004
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
JSAC
2006
14 years 10 months ago
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we study how the cooperative relaying can improve both capacity and fairness in cellular network. The capacity and fairness have a trade-off relationship, so inc...
ADAEUROPE
2005
Springer
15 years 3 months ago
2005
Springer
: In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compa...