Access the full text.
Sign up today, get DeepDyve free for 14 days.
ACM Transactions on Autonomous and Adaptive Systems
Ranjita Bhagwan, K. Tati, Yuchung Cheng, S. Savage, G. Voelker (2004)
Total Recall: System Support for Automated Availability Management
Özalp Babaoglu, H. Meling, A. Montresor (2002)
Anthill: a framework for the development of agent-based peer-to-peer systemsProceedings 22nd International Conference on Distributed Computing Systems
V. Maniezzo, Marco Boschetti, Márk Jelasity (2004)
An Ant Approach to Membership Overlay Design
M. Herbster, Manfred Warmuth (1995)
Tracking the Best ExpertMachine Learning, 32
Indranil Gupta, Mahvesh Nagda, Christo Devaraj (2007)
The design of novel distributed protocols from differential equationsDistributed Computing, 20
Özalp Babaoglu, G. Canright, A. Deutsch, G. Caro, F. Ducatelle, L. Gambardella, Niloy Ganguly, Márk Jelasity, R. Montemanni, A. Montresor, Tore Urnes (2006)
Design patterns from biology for distributed computingACM Trans. Auton. Adapt. Syst., 1
E. Dijkstra, C. Scholten (1980)
Termination Detection for Diffusing ComputationsInf. Process. Lett., 11
Arvind (2003)
Bluespec: A language for hardware design, simulation, synthesis and verification Invited Talk
T. Cormen, C. Leiserson, R. Rivest, C. Stein (2001)
Introduction to Algorithms, 2nd edition.
R. Dromey (1986)
An algorithm for the selection problemSoftware: Practice and Experience, 16
B. Loo, Tyson Condie, J. Hellerstein, Petros Maniatis, Timothy Roscoe, I. Stoica (2005)
Implementing declarative overlays
B. Webb (2002)
Swarm Intelligence: From Natural to Artificial SystemsConnection Science, 14
T. Kurtz (1987)
Approximation of Population Processes
D. Angluin, J. Aspnes, Zoë Diamadi, M. Fischer, R. Peralta (2004)
Computation in networks of passively mobile finite-state sensorsDistributed Computing, 18
J. Misra, K. Chandy (1982)
Termination Detection of Diffusing Computations in Communicating Sequential ProcessesACM Trans. Program. Lang. Syst., 4
T. Seeley (1995)
The Wisdom of the Hive
D. Kempe, A. Dobra, J. Gehrke (2003)
Gossip-based computation of aggregate information44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
S. Strogatz (1995)
Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry and EngineeringPhysics Today, 48
Aydin Üresin, M. Dubois (1990)
Parallel asynchronous algorithms for discrete dataJ. ACM, 37
L. Lamport, M. Chandy (1985)
Distributed snapshots: determining global states of distributed systemsACM Trans. Comput. Syst., 3
(2005)
Sorting benchmark
Steven Ko, Indranil Gupta, Y. Jo (2007)
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer ComputingFirst International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)
J. Rice (1976)
The Algorithm Selection ProblemAdv. Comput., 15
Michael Merritt, G. Taubenfeld (2000)
Computing with infinitely many processesInf. Comput., 233
(2008)
Article 11, Publication date
E. Bonabeau, M. Dorigo, G. Theraulaz (1999)
Swarm Intelligence - From Natural to Artificial Systems
(1998)
Collective decision making in honeybees
Spyros Voulgaris, D. Gavidia, M. Steen (2005)
CYCLON: Inexpensive Membership Management for Unstructured P2P OverlaysJournal of Network and Systems Management, 13
M. Mitzenmacher (2001)
The Power of Two Choices in Randomized Load BalancingIEEE Trans. Parallel Distributed Syst., 12
G. Caro, M. Dorigo (1998)
AntNet: Distributed Stigmergetic Control for Communications NetworksArXiv, abs/1105.5449
Márk Jelasity, Spyros Voulgaris, R. Guerraoui, Anne-Marie Kermarrec, M. Steen (2007)
Gossip-based peer samplingACM Trans. Comput. Syst., 25
Haipeng Guo, W. Hsu (2003)
Algorithm selection for sorting and probabilistic inference: a machine learning-based approach
F. Schneider (1990)
The State Machine Approach: A Tutorial
R. Agarwal (1992)
Difference equations and inequalities
T. Cormen (2001)
Introduction to algorithms [2nd ed.]
A. Arpaci-Dusseau, Remzi Arpaci-Dusseau, D. Culler, J. Hellerstein, D. Patterson (1998)
Searching for the sorting record: experiences in tuning NOW-Sort
(2004)
Distributed Computing Systems (ICDCS)
M. Rabin (1983)
Randomized byzantine generals24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
(2003)
Computing aggregate information using gossip
(2007)
Mute: Simple anonymous file sharing. http://mute-net.sourceforge.net
T. Cormen, C. Leiserson, R. Rivest (1990)
Introduction to Algorithms
A. Medina, Anukool Lakhina, I. Matta, J. Byers (2001)
BRITE: an approach to universal topology generationMASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
We present, and evaluate benefits of, a design methodology for translating natural phenomena represented as mathematical models, into novel, self-adaptive, peer-to-peer (p2p) distributed computing algorithms ( protocols ). Concretely, our first contribution is a set of techniques to translate discrete sequence equations (also known as difference equations) into new p2p protocols called sequence protocols . Sequence protocols are self-adaptive, scalable, and fault-tolerant, with applicability in p2p settings like Grids. A sequence protocol is a set of probabilistic local and message-passing actions for each process. These actions are translated from terms in a set of source sequence equations. Individual processes do not simulate the source sequence equations completely. Instead, each process executes probabilistic local and message passing actions, so that the emergent round-to-round behavior of the sequence protocol in a p2p system can be probabilistically predicted by the source sequence equations. The article's second contribution is the design and evaluation of a set of sequence protocols for detection of two global triggers in a distributed system: threshold detection and interval detection. This article's third contribution is a new self-adaptive Grid computing protocol called HoneyAdapt. HoneyAdapt is derived from sequence equations modeling adaptive bee foraging behavior in nature. HoneyAdapt is intended for Grid applications that allow Grid clients, at run-time, a choice of algorithms for executing chunks of the application's dataset. HoneyAdapt tells each Grid client how to adaptively select at run-time, for each chunk it receives, a good algorithm for computing the chunk—this selection is based on continuous feedback from other clients. Finally, we design a variant of HoneyAdapt, called HoneySort, for application to Grid parallelized sorting settings using the master-worker paradigm. Our evaluation of these contributions consists of mathematical analysis, large-scale trace-based simulation results, and experimental results from a HoneySort deployment.
ACM Transactions on Autonomous and Adaptive Systems (TAAS) – Association for Computing Machinery
Published: Aug 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.