Neko: a single environment to simulate and prototype distributed algorithms

Urbán, Péter; Défago, Xavier; Schiper, André

doi:10.1109/icoin.2001.905471

Cited by 66 publications

(59 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…JiST does not however virtualize Java APIs and thus cannot be used to run most existing Java code, neither does it accurately reflect the actual overhead of Java code in simulation time. Neko [14] provides the ability to use simulation models as actual code, provided its event-driven API is used instead of the standard Java classes. It also does not accurately reflect the actual cost of executing code, as it uses a simple model that allows the relative cost of the communication and computation to be adjusted.…”

Section: Related Workmentioning

confidence: 99%

“…As a matter of fact, not only a coherently global observation is physically impossible, but also the system's behavior remains largely unpredictable and unreproducible. Other tools allow to run real code but are limited to a particular framework and language [8], or are limited in scope [2,14,5], thus precluding the integration with required off-the-shelf middleware components and providing only rough estimates of system behavior and performance.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Practical Evaluation of Large Scale Applications

Jorge

Maia

Matos

et al. 2015

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

Abstract. Designing and implementing distributed systems is a hard endeavor, both at an abstract level when designing the system, and at a concrete level when implementing, debugging and evaluating it. This stems not only from the inherent complexity of writing and reasoning about distributed software, but also from the lack of tools for testing and evaluating it under realistic conditions. Moreover, the gap between the protocols' specifications found on research papers and their implementations on real code is huge, leading to inconsistencies that often result in the implementation no longer following the specification. As an example, the specification of the popular Chord DHT comprises a few dozens of lines, while its Java implementation, OpenChord, is close to twenty thousand lines, excluding libraries. This makes it hard and error prone to change the implementation to reflect changes in the specification, regardless of programmers' skill. Besides, critical behavior due to the unpredictable interleaving of operations and network uncertainty, can only be observed on a realistic setting, limiting the usefulness of simulation tools. We believe that being able to write an algorithm implementation very close to its specification, and evaluating it in a real environment is a big step in the direction of building better distributed systems. Our approach leverages the MINHA platform to offer a set of built in primitives that allows one to program very close to pseudo-code. This high level implementation can interact with off-the-shelf existing middleware and can be gradually replaced by a production-ready Java implementation. In this paper, we present the system design and showcase it using a well-known algorithm from the literature.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Practical Evaluation of Large Scale Applications

Jorge

Maia

Matos

et al. 2015

Distributed Applications and Interoperable Systems

View full text Add to dashboard Cite

show abstract

“…The three algorithms that are compared are noted TokenFD (the token based algorithm presented in Section V), CT (Chandra-Toueg's atomic broadcast with Chandra-Toueg's 3S consensus) and MR (Chandra-Toueg's atomic broadcast with Mostéfaoui-Raynal's 3S consensus). The algorithms are implemented in Java, using the Neko [33] framework.…”

Section: B Elements Of Our Performance Studymentioning

confidence: 99%

A Fault-Tolerant Token-Based Atomic Broadcast Algorithm

Ekwall

Schiper

2011

IEEE Trans. Dependable and Secure Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of them uses unreliable failure detectors directly. This paper presents the first token based atomic broadcast algorithm that uses an unreliable failure detector instead of a group membership service. It requires a system size that is quadratic in the number of supported failures. The special case of a single supported failure (f = 1) requires n = 3 processes.We experimentally evaluate the performance of this algorithm in local and wide area networks, in order to emphasize that atomic broadcast is efficiently implemented by combining a failure detector and a token based mechanism. The evaluation shows that the new token based algorithm surpasses the performance of the other algorithms in most small system settings.

show abstract

“…This evaluation was conducted with the support of the NEKO framework [22]. The use of the NEKO framework allows sharing the same Java source code for both simulation and executions in a real environment.…”

Section: Performance Evaluationmentioning

confidence: 99%