1502 search results - page 87 / 301 » Node weighted scheduling |
SSS
2010
Springer
13 years 8 months ago
2010
Springer
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
DISOPT
2008
13 years 10 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
IJON
2000
13 years 9 months ago
2000
In this paper we propose an approach to variable selection that uses a neural-network model as the tool to determine which variables are to be discarded. The method performs a bac...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in co...
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—The back-pressure algorithm is a well-known throughput-optimal algorithm. However, its delay performance may be quite poor even when the traffic load is not close to network ca...