公平连接模式匹配的优化与扩展
Optimizations and extensions for fair join pattern matching
AI总结：
本研究优化并扩展了公平连接模式匹配算法，提升了性能并增强了基准测试的可扩展性，展示了连接模式在微服务架构中的应用。
摘要：
连接模式是并发和分布式系统编程中被忽视的一种方法。当应用于Actor模型时，连接模式提供了新颖的能力，即匹配Actor邮箱中的消息组合。Philipp Haller等人在论文《公平连接模式匹配用于Actor》（ECOOP 2024）中探讨了在Actor基础上带有条件守卫的连接模式，规定了公平和确定性匹配语义。然而，公平连接模式匹配的时间效率问题仍未得到充分探索。Haller等人的状态化树状匹配算法在某些基准上表现较差，相较于适应Rete算法到常规连接模式匹配基准的实现，而优于带有重条件守卫的变体，这些守卫评估时间更长。然而，将Rete适应到连接模式匹配问题上需要大量手动调整。在本论文中，我们增强了和优化了Haller等人的状态化树状匹配算法，在某些基准上实现了高达十倍的性能提升，接近Rete在常规基准上的性能，同时保持了在重条件守卫下的优势和性能。我们还增强了基准套件，增加了新功能并提高了其可扩展性和用户友好性。我们扩展了连接模式实现，使其具有更明确的语法以及动态模式切换。最后，我们提出了一个新的复杂模型用例，展示了连接模式在微服务Web架构中的适用性。
英文摘要：
Join patterns are an underexplored approach for the programming of concurrent and distributed systems. When applied to the actor model, join patterns offer the novel capability of matching combinations of messages in the mailbox of an actor. Previous work by Philipp Haller et al. in the paper "Fair Join Pattern Matching for Actors" (ECOOP 2024) explored join patterns with conditional guards in an actor-based setting with a specification of fair and deterministic matching semantics. Nevertheless, the question of time efficiency in fair join pattern matching has remained underexplored. The stateful tree-based matching algorithm of Haller et al. performs worse than an implementation that adapts the Rete algorithm to the regular version of a join pattern matching benchmark, while outperforming on a variant with heavy conditional guards, which take longer to evaluate. Nevertheless, conforming Rete to the problem of join pattern matching requires heavy manual adaptation. In this thesis, we enhance and optimize the stateful tree-based matching algorithm of Haller et al. to achieve up to tenfold performance improvements on certain benchmarks, approaching the performance of Rete on regular benchmarks while maintaining the advantages of versatility and performance with heavy guards. We also enhance the benchmark suite, adding new features and enhancing its extensibility and user-friendliness. We extend the join pattern implementation with a less ambiguous syntax as well as dynamic pattern switching. Finally, we present a new complex model use case for join patterns, showing their applicability in a microservice web architecture.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
