Simulator for parallel measurement algorithms for scheduling replication States Parallel Machine

• João Gabriel Trombeta UFSC
• Odorico Machado Mendizabal UFSC

DOI: https://doi.org/10.5753/eradrs.2020.10753

Abstract

When developing a new scheduling algorithm requests for replication States Parallel machine, it is difficult to measure the degree of parallelism under different workloads and configurations, or compare it with existing techniques. This paper proposes a simulator that abstracts costs of actual implementation, to be analyzed potential performance gains arising exclusively from scheduling strategies.

Keywords: Evaluation, Performance Measurement and Prediction, Scheduling and load balancing, Techniques Modeling and Simulation, Fault Tolerance

References

Alchieri, E., Dotti, F., Marandi, P., Mendizabal, O., and Pedone, F. (2018). Boosting state machine replication with concurrent execution. In 2018 Eighth Latin-American Symposium on Dependable Computing (LADC).

Hendrickson, B. and Kolda, T. G. (2000). Graph partitioning models for parallel computing. Parallel computing, 26(12):1519–1534.

Karypis, G. and Kumar, V. (1998). A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing, 20(1):359–392.

Kotla, R. and Dahlin, M. (2004). High throughput byzantine fault tolerance. In International Conference on Dependable Systems and Networks, 2004.

Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM.

Mendizabal, O. M., De Moura, R. S., Dotti, F. L., and Pedone, F. (2017). Efficient and deterministic scheduling for parallel state machine replication. In 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

Schneider, F. B. (1990). Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys (CSUR), 22(4):299–319.