1257 search results - page 10 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
119
click to vote
VLSID
2002
IEEE
15 years 2 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
RTCSA
2003
IEEE
15 years 3 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We develop energy-efficient, adaptive distributed transforms for data gathering in wireless sensor networks. In particular, we consider a class of unidirectional transforms that ...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...