Topic 8: Distributed systems and algorithms

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The increasing significance of Distributed Computing becomes more and more crucial with the prevail of technological advances that make Global Computing a reality in modern world. Indeed, it is hard to imagine some application or computational activity and process that falls outside Distributed Computing. With the large advent of distributed systems, we are faced with the real challenges of distributed computation: How do we cope with asynchrony and failures? How (and how well) do we achieve load balancing? How do we model and analyze malicious and selfish behavior? How do we address mobility, heterogeneity and the dynamic nature of participating processes? What can we achieve in the presence of disconnecting operations that cause network partitioning? © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Goscinski, A., Mavronicolas, M., Shi, W., & Meng, T. Y. (2012). Topic 8: Distributed systems and algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7484 LNCS, pp. 401–402). https://doi.org/10.1007/978-3-642-32820-6_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free