Reactor pattern - Introduction by wiki

最新推荐文章于 2024-02-22 11:17:48 发布

blizmax6

最新推荐文章于 2024-02-22 11:17:48 发布

阅读量768

点赞数

分类专栏： Software Model 文章标签： concurrency application performance scalability service components

Software Model 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

The reactor design pattern is an event handling pattern for handling service requests deliveredconcurrently to a service handler by one or more inputs. The service handler thendemultiplexes the incoming requests and dispatches them synchronously to the associated request handlers.

[hide]

[edit]Structure

Resources: Any resource that can provide input from or output to the system.
Synchronous Event Demultiplexer: Uses an event loop to block on all resources. When it is possible to start a synchronous operation on a resource without blocking, the demultiplexer sends the resource to the dispatcher.
Dispatcher: Handles registering and unregistering of request handlers. Dispatches resources from the demultiplexer to the associated request handler.
Request Handler: An application defined request handler and its associated resource.

[edit]Properties

All reactor systems are single threaded by definition, but can exist in a multithreaded environment.

[edit]Benefits

The reactor pattern completely separates application specific code from the reactor implementation, which means that application components can be divided into modular, reusable parts. Also, due to the synchronous calling of request handlers, the reactor pattern allows for simple coarse-grain concurrency while not adding the complexity of multiple threads to the system.

[edit]Limitations

The reactor pattern can be more difficult to debug^{[citation needed]} than a procedural pattern due to the inverted flow of control. Also, by only calling request handlers synchronously, the reactor pattern limits maximum concurrency, especially onSMP hardware. The scalability of the reactor pattern is limited not only by calling request handlers synchronously, but also by the demultiplexer. The original Unixselect and poll calls, for instance, have a maximum number of descriptors that may be polled and have performance issues with a high number of descriptors.^[1] (More recently, more scalable^{[citation needed]} variants of these interfaces have been made available: /dev/poll in Solaris,epoll in Linux andkqueue / kevent in BSD-based systems, allowing the implementation of very high performance systems with large numbers of open descriptors.)