首页> 外文会议>International Workshop on Scientific Engineering of Distributed Java Applications >An MDA-Based Approach for Inferring Concurrency in Distributed Systems
【24h】

An MDA-Based Approach for Inferring Concurrency in Distributed Systems

机译:基于MDA的推断方法,用于推断分布式系统

获取原文

摘要

When dealing with distributed systems, one of the most important problems that has to be addressed is concurrency. Distributed systems are inherently concurrent, distributed objects being implicitly "shared" between all participating clients, and explicit concurrency control must be enforced if consistency is to be preserved. From an MDA perspective to software development, we show in this paper how concurrency resulting from distribution can be inferred in an automatic way, provided that a small set of design conventions are strictly adhered to. A simple PIM-level concurrency profile is considered in order to illustrate how the inference algorithm evolves on a concrete example and how an initial distributed design is automatically refined according to the proposed concurrency profile.
机译:在处理分布式系统时,必须解决的最重要问题之一是并发。 分布式系统本质上并发,如果要保留一致性,则必须强制强制将分布式对象隐式“共享”。 从MDA的角度来看,我们在本文中展示了如何以自动化方式推断出来的发行产生的并发性,只要严格遵守一小一组设计约定。 考虑一个简单的PIM级并发配置文件,以说明推理算法如何在具体示例中演变,以及如何根据所提出的并发配置文件自动改进初始分布式设计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号