307 search results - page 14 / 62 » The communication complexity of distributed task allocation |
136
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
138
click to vote
PDP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
135
click to vote
CASCON
1997
15 years 5 months ago
1997
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
124
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O s...
134
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...