16128 search results - page 567 / 3226 » Distributed network scheduling |
222
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
233
click to vote
ICPPW
2009
IEEE
16 years 2 months ago
2009
IEEE
Business workflows implemented as BPEL processes play an important role for many business applications. BPEL is used to orchestrate a series of Web service calls. Which provider ...
217
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
193
click to vote
HPCC
2007
Springer
16 years 1 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
217
Voted
PPOPP
2006
ACM
16 years 1 months ago
2006
ACM
Recently, the high-performance computing community has realized that power is a performance-limiting factor. One reason for this is that supercomputing centers have limited power ...