![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Demostrations . For ex ample, inaccurate cost estimates may overload a node caus ing it to thrash. These imbalances are di#cult to anticipate and may reduce or even negate the benefits of parallelism. To address these issues, we built a parallel query processor in Telegraph that handles local failures and gracefully adapts to runtime perturbations in a cluster. In addition, it adapts to volatility from widearea sources. ![]() DiSC'02 © 2003 Association for Computing Machinery |