Abstract
The abstract behaviour of a grid application management system can be modelled as an Orc expression in which sites are called to perform sub-computations. An Orc expression specifies how a set of site calls are to be orchestrated so as to realise some overall desired computation. In this paper evaluations of Orc expressions in untrusted environments are analysed by means of game theory. The set of sites participating in an orchestration is partitioned into two distinct groups. Sites belonging to the first group are called angels: these may fail but when they do they try to minimize damage to the application. Sites belonging to the other group are called daemons: when a daemon fails it tries to maximise damage to the application. Neither angels nor daemons can fail excessively because the number of failures, in both cases, is bounded. When angels and daemons act simultaneously a competitive situation arises that can be represented by a so-called angel—daemon game. This game is used to model realistic situations lying between over-optimism and over-pessimism.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldinucci, M., Danelutto, M.: Algorithmic skeletons meeting grids. Parallel Computing 32(7): 449-462, 2006.
Bouge, L.: Le modele de programmation a parallelisme de dones: une perspective semantique. Techniques et science informatiques, Vol 12, 5, 541-562, 1993.
Eliaz, K: Fault Tolerant Implementation. Review of Economic Studies, 2002, vol. 69, issue 3, pages 589-610.
Misra J., Cook, W.: Computation Orchestration: A basis for wide-area computing. Software & Systems Modeling, 2006. DOI 10.1007/s10270-006-0012-1.
Moscibroda, T., Schmid, S., Wattenhofer, R: When selfish meets evil: byzantine players in a virus inoculation game. PODC’06, 35 - 44, 2006.
Osborne, M., Rubinstein, A.: A Course on Game Theory, MIT Press, 1994.
Peltz, C: Web Services Orchestration and Choreography. IEEE Computer 36(10): 46-52 (2003).
Silaghi, G.C., Arenas, A., Silva, L.: Reputation-based trust management systems and their applicability to grids. Technical Report TR-0064, Institute on Programming Models, CoreGRID-Network of Excellence, March 2007. http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0064.pdf 21 May 2007.
Stewart, A., Gabarró, J., Clint, M., Harmer, T., Kilpatrick, P., Perrott, R.: Estimating the reliability of web and grid orchestrations. In Gorlatch, S., Bubak, M., Priol, T., eds.: Integrated Research in Grid Computing, Krakov. Poland, CoreGRID.
Stewart, A., Gabarró, J., Clint, M., Harmer, T., Kilpatrick, P., Perrott, R.: Managing Grid Computations: An ORC-Based Approach. In ISPA 2006, LNCS Vol. 4330, pp. 278-291, 2006.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gabarro, J., Garcia, A., Clint, M., Kilpatrick, P., Stewart, A. (2008). Bounded Site Failures: An Approach to Unreliable Grid Environments. In: Making Grids Work. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-78448-9_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-78448-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-78447-2
Online ISBN: 978-0-387-78448-9
eBook Packages: Computer ScienceComputer Science (R0)