24th International Conference on Distributed Computing Systems, 2004. Proceedings. (2004)
Hachioji, Tokyo, Japan
Mar. 24, 2004 to Mar. 26, 2004
Brian Ensink , University of Illinois at Urbana-Champaign
Vikram Adve , University of Illinois at Urbana-Champaign
Distributed applications may use sophisticated runtime adaptation strategies to meet their performance or quality-of-service goals. Coordinating an adaptation that involves multiple processes can require complex communication or synchronization, in addition to communication in the base application. We propose conceptually simple high-level directives and a sophisticated runtime algorithm for coordinating adaptation automatically and transparently in distributed applications. The coordination directives specify when to adapt, in terms of the relative computational progress of each relevant process. The coordination algorithm relies on simple compiler transformations to track the progress of the processes, and performs the adaptive changes locally and asynchronously at each process. Measurements of the runtime overhead of the automatic coordination algorithm for two adaptive applications (a parallel PDE solver and a distributed video tracking code) show that the overhead is less than 1% of execution time for both these codes, even with relatively frequent adaptations, and does not grow signi.cantly with the number of coordinating processes.
V. Adve and B. Ensink, "Coordinating Adaptations in Distributed Systems," 24th International Conference on Distributed Computing Systems, 2004. Proceedings.(ICDCS), Hachioji, Tokyo, Japan, 2004, pp. 446-455.