Sciweavers

1502 search results - page 119 / 301
» Node weighted scheduling
Sort
View
FOCS
1999
IEEE
15 years 10 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
INFOCOM
2009
IEEE
16 years 28 days ago
Optimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks
Abstract—In wireless sensor networks, asynchronous sleepwake scheduling protocols can significantly reduce energy consumption without incurring the communication overhead for cl...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff
DMG
2005
Springer
15 years 11 months ago
An Adaptive Distributed Query Processing Grid Service
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid s...
Fabio Porto, Vinícius F. V. da Silva, M&aac...
JSSPP
1997
Springer
15 years 10 months ago
Memory Usage in the LANL CM-5 Workload
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
Dror G. Feitelson
HYBRID
2009
Springer
16 years 1 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...