Wyniki wyszukiwania - BazTech

1

Analiza porównawcza protokołów przesyłania wiadomościasynchronicznych w systemach kolejkowych

Derlatka Grzegorz, Kopniak Piotr

Journal of Computer Sciences Institute

|

2023

|

Vol. 26

29--32

PL

W tym artykule została przedstawiona analiza wydajności dwóch protokołów obsługiwanych przez systemy kolejkowe, tj. protokołu MQTT (ang. MQ Telemetry Transport) oraz AMQP (ang. Advanced Message Queuing Protocol). Analiza ta została przeprowadzona z użyciem dwóch brokerów wiadomości - ActiveMQ oraz RabbitMQ. Analizie został poddany czas przesłania wiadomości wyznaczony na podstawie czasu wysłania i odebrania komunikatu dla obu protokołów w obu przytoczonych systemach kolejkowych. Testy zostały przeprowadzone przy pomocy własnych aplikacji napisanych w języku Java oraz szkielecie aplikacji Spring.

EN

This article presents an analysis of the performance of two protocols supported by queuing systems, i.e. MQTT and AMQP. This analysis was performed using two message brokers - ActiveMQ and RabbitMQ. The time of sending the message was analyzed, determined on the basis of the time of sending and receiving the message for both protocols in both of the above-mentioned queuing systems. The tests were carried out using proprietary applications written in Java and the Spring application framework.

2

Analiza funkcjonalna i wydajnościowa wybranych brokerów komunikatów w aplikacji rozproszonej

Kaciuczyk Tobiasz, Korga Tomasz, Smołka Jakub

Journal of Computer Sciences Institute

|

2020

|

Vol. 14

19--25

PL

W artykule przedstawiono wyniki badań wydajności wybranych brokerów komunikatów: Apache ActiveMQ, RabbitMQ oraz Apache Kafka. Analizie został poddany czas przesłania wiadomości wyznaczony na podstawie czasu wysłania i odebrania komunikatu. Testy zostały przeprowadzone za pomocą autorskich aplikacji klienckich napisanych w języku Java. Badania uzupełniono opisem teoretycznym architektury każdego z narzędzi, w tym specyfikacji JMS i AMQP, oraz podstawowym opisem funkcjonalności brokerów.

EN

Article presents results of performance analysis of selected message brokers: Apache ActiveMQ, RabbitMQ and Apache Kafka. To analyze has been subjected time of messaging determined based by time of sending and receiving message. Tests were carried out by authorial client application, written in Java language. The research was supplemented with a theoretical description of each tools architecture, including JMS and AMQP specifications and a basic description of brokers functionality.

3

Continuation Semantics for Asynchronous Concurrency

Ciobanu G., Todoran E. N.

Fundamenta Informaticae

|

2014

|

Vol. 131, nr 3-4

373--388

EN

The paper presents a method of reasoning about the behaviour of asynchronous programs in denotational models designed with metric spaces and continuation semantics for concurrency.

4

Located Actions in Process Algebra with Timing

Bergstra J.A., Middelburg C.A.

Fundamenta Informaticae

|

2004

|

Vol. 61, nr 3,4

183--211

EN

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile intermediate station. It is a reformulation of the real space process algebra from Baeten and Bergstra [Formal Aspects of Computing, 5, 1993, 481-529] in a setting with urgent actions. This leads to many simplifications.

5

Asynchronous Box Calculus

Devillers R., Klaudel H., Koutny M., Pommereau F.

Fundamenta Informaticae

|

2003

|

Vol. 54, nr 4

295-344

EN

The starting point of this paper is an algebraic Petri net framework allowing one to express net compositions, such as iteration and parallel composition, as well as transition synchronisation and restriction. We enrich the original model by introducing new constructs supporting asynchronous interprocess communication. Such a communication is made possible thanks to special `buffer' places where different transitions (processes) may deposit and remove tokens. We also provide an abstraction mechanism, which hides buffer places, effectively making them private to the processes communicating through them. We then provide an algebra of process expressions, whose constants and operators directly correspond to those used in the Petri net framework. Such a correspondence is used to associate nets to process expressions in a compositional way. That the resulting algebra of expressions is consistent with the net algebra is demonstrated by showing that an expression and the corresponding net generate isomorphic transition systems. This results in the Asynchronous Box Calculus (or ABC), which is a coherent dual model, based on Petri nets and process expressions, suitable for modelling and analysing distributed systems whose components can interact using both synchronous and asynchronous communication.