2745 search results - page 165 / 549 » A fast algorithm for computing large Fibonacci numbers |
124
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
165
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
136
Voted
ACMICEC
2007
ACM
15 years 8 months ago
2007
ACM
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...
140
click to vote
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
137
click to vote
HIPC
2009
Springer
15 years 1 months ago
2009
Springer
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...