1257 search results - page 183 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
CN
2010
14 years 10 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
104
click to vote
HIPC
2007
Springer
15 years 1 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
SIGMETRICS
2006
ACM
15 years 4 months ago
2006
ACM
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
102
click to vote
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...