Abstract
Futures are language constructs that improve concurrency in a natural and transparent way. A future is a place holder for a result of a concurrent computation [5]. Once the computation is complete and a result (called future value) is available, the placeholder is replaced by the result. Access to an unresolved future results in the caller being blocked, until the result becomes available. Results are only awaited when they are really needed which helps in improving the parallelization. Futures may be created transparently or explicitly. For explicit creation, specific language constructs are necessary to create the futures and to fetch the result. Transparent futures, on the other hand, are managed by the underlying middleware and the program syntax remains unchanged; futures have the same type as the actual result. Some frameworks allow futures to be passed to other processes. Such futures are called First class futures [2]. Replacing a future reference by the corresponding calculated value is called “future update”. In this case additional mechanisms to update futures are required not only at the creator, but also on all processes that receive a future. First class futures offer greater flexibility in application design and can significantly improve concurrency both in object-oriented and procedural paradigms like workflows [12].
Chapter PDF
Similar content being viewed by others
References
Caromel, D., Delbé, C., di Costanzo, A., Leyton, M.: ProActive: an integrated platform for programming and running applications on grids and P2P systems. Computational Methods in Science and Technology 12(1), 69–77 (2006)
Caromel, D., Henrio, L.: A Theory of Distributed Object. Springer, Heidelberg (2005)
de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316–330. Springer, Heidelberg (2007)
Dedecker, J., Van Cutsem, T., Mostinckx, S., D’Hondt, T., De Meuter, W.: Ambient-oriented programming in ambientTalk. In: Hu, Q. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 230–254. Springer, Heidelberg (2006)
Halstead Jr., R.H.: Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems 7(4) (1985)
Henrio, L., Kammüller, F., Uzair Khan, M.: A framework for reasoning on component composition. In: de Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol. 6286, pp. 1–20. Springer, Heidelberg (2010)
Johnsen, E.B., Owe, O.: An asynchronous communication model for distributed concurrent objects. In: SEFM 2004 (2004)
Johnsen, E.B., Owe, O., Chieh Yu, I.: Creol: a type-safe object-oriented model for distributed concurrent systems. Theor. Comput. Sci. 365 (2006)
Niehren, J., Schwinghammer, J., Smolka, G.: A concurrent lambda calculus with futures. Theoretical Computer Science 364 (November 2006)
Ranaldo, N., Zimeo, E.: Analysis of Different Future Objects Update Strategies in ProActive. In: IEEE International on IPDPS 2007, pp. 23–66 (2007)
Taura, K., Matsuoka, S., Yonezawa, A.: ABCL/f: A Future-Based Polymorphic Typed Concurrent Object-Oriented Language - Its Design and Implementation. In: DIMACS 1994, vol. 18 (1994)
Tretola, G., Zimeo, E.: Activity pre-scheduling for run-time optimisation of grid workflows. Journal of Systems Architecture 54(9) (2008)
Welc, A., Jagannathan, S., Hosking, A.: Safe futures for java. SIGPLAN Not. 40(10), 439–453 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henrio, L., Khan, M.U., Ranaldo, N., Zimeo, E. (2011). First Class Futures: Specification and Implementation of Update Strategies. In: Guarracino, M.R., et al. Euro-Par 2010 Parallel Processing Workshops. Euro-Par 2010. Lecture Notes in Computer Science, vol 6586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21878-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-21878-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21877-4
Online ISBN: 978-3-642-21878-1
eBook Packages: Computer ScienceComputer Science (R0)