1257 search results - page 90 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
108
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...
101
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
TON
2002
15 years 1 months ago
2002
In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly, when packets inc...
111
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
127
click to vote
SPIN
2010
Springer
15 years 5 hour ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...