| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429224 | Information Processing Letters | 2007 | 6 Pages |
Abstract
This paper studies the performance of network-based incremental computing under various message sequences. We show the bounds on the time needed to compute the tasks requested by multiple clients. Our simulation result shows that the expected performance of random message sequences is close to the optimal performance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
