856 search results - page 66 / 172 » Relative Performance of Scheduling Algorithms in Grid Enviro... |
JSSPP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
BTW
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...
FTDCS
1995
IEEE
13 years 11 months ago
1995
IEEE
A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR)...
ICNSC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
JCSS
2007
13 years 7 months ago
2007
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...