Parallel asynchronous algorithms for discrete data
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Searching for the sorting record: experiences in tuning NOW-Sort
SPDT '98 Proceedings of the SIGMETRICS symposium on Parallel and distributed tools
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Introduction to Algorithms
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Bluespec: A language for hardware design, simulation, synthesis and verification Invited Talk
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The State Machine Approach: A Tutorial
The State Machine Approach: A Tutorial
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Algorithm selection for sorting and probabilistic inference: a machine learning-based approach
Algorithm selection for sorting and probabilistic inference: a machine learning-based approach
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
SASO '07 Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems
ACM Transactions on Computer Systems (TOCS)
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Efficient on-demand operations in dynamic distributed infrastructures
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
On model design for simulation of collective intelligence
Information Sciences: an International Journal
A survey: algorithms simulating bee swarm intelligence
Artificial Intelligence Review
Editorial: Special section: Bio-inspired algorithms for distributed systems
Future Generation Computer Systems
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-chord: a bio-inspired P2P framework for self-organizing distributed systems
IEEE/ACM Transactions on Networking (TON)
Fuzzy-based load self-configuration in mobile P2P services
Computer Networks: The International Journal of Computer and Telecommunications Networking
A self-organizing P2P system with multi-dimensional structure
Proceedings of the 8th ACM international conference on Autonomic computing
A modified Artificial Bee Colony algorithm for real-parameter optimization
Information Sciences: an International Journal
Self-adaptive and reconfigurable distributed computing systems
Applied Soft Computing
A survey of formal methods in self-adaptive systems
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Bio-Inspired P2P Systems: The Case of Multidimensional Overlay
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
On self-adaptation in systems-of-systems
Proceedings of the First International Workshop on Software Engineering for Systems-of-Systems
| Hi-index | 0.00 |
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.