1257 search results - page 81 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
133
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 5 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
120
click to vote
CCGRID
2010
IEEE
14 years 11 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
125
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
108
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
131
click to vote
IWCMC
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a load-based transmission scheduling (LoBaTS) protocol for wireless ad hoc networks. Since terminals in these networks may be required to forward unequal amoun...