Aggregation for implicit invocations

S Frischbier, Alessandro Margara, T. Freudenreich, P. Eugster, D. Eyers, P. Pietzuch
{"title":"Aggregation for implicit invocations","authors":"S Frischbier, Alessandro Margara, T. Freudenreich, P. Eugster, D. Eyers, P. Pietzuch","doi":"10.1145/2451436.2451450","DOIUrl":null,"url":null,"abstract":"Implicit invocations are a popular mechanism for exchanging information between software components without binding these strongly. This decoupling is particularly important in distributed systems when interacting components are not known until runtime. In most realistic distributed systems though, components require some information about each other, be it only about their presence or their number. Runtime systems for implicit invocations--so-called publish/subscribe systems--are thus often combined with other systems providing such information. Given the variety of requirements for information about interacting components across applications, this paper proposes a generic augmentation of implicit invocations: rather than extending a given publish/subscribe API and system in order to convey a particular type of information across interacting components, we describe domain-specific joinpoints that can be used to advise application-level invocation routers-so-called brokers--used by publish/subscribe systems. This enables aggregation of application-specific information to and from components in a scalable manner.\n After presenting our domain-specific joinpoint model, we describe its implementation inside the REDS publish/subscribe middleware. The empirical evaluation of our approach shows that: (a) it outperforms external aggregation systems, by collecting and distributing information with a limited overhead; (b) the deployment of new functionalities has virtually no overhead, even if it occurs while the publish/subscribe system is running.","PeriodicalId":353153,"journal":{"name":"Aspect-Oriented Software Development","volume":"429 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aspect-Oriented Software Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2451436.2451450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Implicit invocations are a popular mechanism for exchanging information between software components without binding these strongly. This decoupling is particularly important in distributed systems when interacting components are not known until runtime. In most realistic distributed systems though, components require some information about each other, be it only about their presence or their number. Runtime systems for implicit invocations--so-called publish/subscribe systems--are thus often combined with other systems providing such information. Given the variety of requirements for information about interacting components across applications, this paper proposes a generic augmentation of implicit invocations: rather than extending a given publish/subscribe API and system in order to convey a particular type of information across interacting components, we describe domain-specific joinpoints that can be used to advise application-level invocation routers-so-called brokers--used by publish/subscribe systems. This enables aggregation of application-specific information to and from components in a scalable manner. After presenting our domain-specific joinpoint model, we describe its implementation inside the REDS publish/subscribe middleware. The empirical evaluation of our approach shows that: (a) it outperforms external aggregation systems, by collecting and distributing information with a limited overhead; (b) the deployment of new functionalities has virtually no overhead, even if it occurs while the publish/subscribe system is running.
隐式调用的聚合
隐式调用是一种在软件组件之间交换信息的流行机制,无需对这些组件进行强绑定。这种解耦在分布式系统中尤其重要,因为直到运行时才知道相互作用的组件。然而,在大多数现实的分布式系统中,组件需要彼此的一些信息,可能只是关于它们的存在或它们的数量。因此,用于隐式调用的运行时系统——所谓的发布/订阅系统——经常与提供此类信息的其他系统结合在一起。考虑到对跨应用程序交互组件的信息的各种需求,本文提出了隐式调用的通用扩展:我们没有扩展给定的发布/订阅API和系统,以便在交互组件之间传递特定类型的信息,而是描述了可用于通知发布/订阅系统使用的应用程序级调用路由器(所谓的代理)的特定领域连接点。这支持以可伸缩的方式聚合来自组件的特定于应用程序的信息。在展示了特定于领域的连接点模型之后,我们将描述其在REDS发布/订阅中间件中的实现。对我们的方法的实证评估表明:(a)它优于外部聚合系统,通过有限的开销收集和分发信息;(b)新功能的部署几乎没有开销,即使在发布/订阅系统运行时也是如此。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信