arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.6170cs.DC
收藏

多进程分布式资源分配算法

A distributed resource allocation algorithm for many processes

Wim H. Hesselink

摘要:

资源分配是指一个进程只有在其资源需求不与其它进程在其关键区的资源需求相冲突时才能进入其代码的关键区CS的问题。对于CS的每次执行,重新给出这些要求。在资源要求中,可以区分级别,例如读访问或写访问。我们允许无限多个进程通过可靠的异步消息进行通信,并且具有有限的内存。一个简单的饥饿免费的解决方案。进程只有在它们有冲突的资源需求时才相互等待。用不变量和时态逻辑论证了解的正确性。已通过证明助手PVS进行验证。

英文摘要:

Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, levels can be distinguished, such as e.g. read access or write access. We allow infinitely many processes that communicate by reliable asynchronous messages and have finite memory. A simple starvation-free solution is presented. Processes only wait for one another when they have conflicting resource requirements. The correctness of the solution is argued with invariants and temporal logic. It has been verified with the proof assistant PVS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑