Analyzing concurrency in computational networks

First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings. Pub Date : 2003-06-24 DOI:10.1109/MEMCOD.2003.1210086

S. Stuijk, T. Basten

引用次数: 5

Abstract

We present a concurrency model that allows reasoning about concurrency in executable specifications. The model mainly focuses on data-flow and streaming applications and at task-level concurrency. The aim of the model is to provide insight in concurrency bottlenecks in an application and to provide support for performing implementation independent concurrency optimization.

查看原文本刊更多论文

计算网络中的并发性分析

我们提出了一个并发模型，允许在可执行规范中对并发性进行推理。该模型主要关注数据流和流应用程序以及任务级并发性。该模型的目的是洞察应用程序中的并发瓶颈，并为执行独立于实现的并发优化提供支持。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

First ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2003. MEMOCODE '03. Proceedings.

自引率

0.00%

发文量