Locally distributed predicates: A programming facility for distributed state detection

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The rise of high-performance computing and internet-scale applications has spurred a renewed interest in distributed computing. Such distributed applications can range from multi-hop routing algorithms used in wireless mesh networks [1] to volunteer-driven parallel data analysis efforts [2][3]. The property of distributed systems that makes them both powerful and challenging is that they are composed of multiple autonomous, interconnected entities. Managing the interactions between these entities is the primary challenge of distributed application development. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

De Rosa, M. (2009). Locally distributed predicates: A programming facility for distributed state detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 557–558). https://doi.org/10.1007/978-3-642-02846-5_62

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