Abstract
This paper summarizes a talk at the NATO ARW on distributed computing. It deals with some algorithmic aspects when programming with this paradigm, related to the lack of methodologies and tools useful to design distributed programs efficient, independent of the environment and able to automatically adapt to the evolutions of the program execution and of the platform characteristics.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toursel, B. (2002). About Design and Efficiency of Distributed Programming: Some Algorithmic Aspects. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-47840-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43672-0
Online ISBN: 978-3-540-47840-9
eBook Packages: Springer Book Archive