同步调度接口代数
An Algebra of Synchronous Scheduling Interfaces
摘要:
在本文中,我们提出了一个代数的同步调度接口,它结合了布尔代数的逻辑和功能行为的最小最大加算术量化的非功能方面的同步接口的表现力。接口理论起源于直觉模态逻辑的可实现性解释(也称为Curry-Howard-Isomorphism或Propositions-as-types principle)。由此产生的代数接口类型的目的是提供一个通用的设置指定类型导向和成分分析的最坏情况下的调度界限。它涵盖了并发、多处理或多线程执行下的同步控制流,并允许对支持各种抽象的分析的准确性和覆盖范围进行精确的陈述。本文通过网络流问题、最短路径问题、任务调度问题和同步程序设计中的最坏情况反应时间问题的实例说明了该代数的表达能力。
英文摘要:
In this paper we propose an algebra of synchronous scheduling interfaces which combines the expressiveness of Boolean algebra for logical and functional behaviour with the min-max-plus arithmetic for quantifying the non-functional aspects of synchronous interfaces. The interface theory arises from a realisability interpretation of intuitionistic modal logic (also known as Curry-Howard-Isomorphism or propositions-as-types principle). The resulting algebra of interface types aims to provide a general setting for specifying type-directed and compositional analyses of worst-case scheduling bounds. It covers synchronous control flow under concurrent, multi-processing or multi-threading execution and permits precise statements about exactness and coverage of the analyses supporting a variety of abstractions. The paper illustrates the expressiveness of the algebra by way of some examples taken from network flow problems, shortest-path, task scheduling and worst-case reaction times in synchronous programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。