1095 search results - page 59 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
RTSS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
85
Voted
CIC
2004
14 years 11 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
79
Voted
SIROCCO
2004
14 years 11 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
98
Voted
RTSS
1997
IEEE
15 years 2 months ago
1997
IEEE
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
ICMCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we propose to use a simple packet servicing algorithm suitable for servicing bursty real-time multimedia traffic streams in packet-switched networks. These real-tim...