arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.05802cs.DC
收藏

机会互斥

Opportunistic Mutual Exclusion

Karthi Srinivasan, Yoram Moses, Rajit Manohar

AI总结:

针对共享资源互斥中利用率次优的问题,提出机会互斥协议,利用时序信息在无时钟条件下让服务器基于事件顺序授予早期访问,并给出电路实现与能耗延迟报告。

摘要:

互斥是共享资源使用中的一个重要问题,其中在任何给定时间只能有一个进程使用共享资源。不利用每个进程使用资源时长的信息的互斥协议可能导致次优的利用率。我们考虑一个简单的两进程互斥问题,其中有一个中央服务器提供对共享资源的访问。我们表明,即使在没有时钟的情况下,在特定条件下,服务器可以基于时序信息机会性地授予客户端早期访问权。我们将我们的新协议称为机会互斥。我们的方法需要在客户端和服务器之间的每个通道上增加一个额外的请求信号来传达额外信息,并且服务器可以仅基于事件的顺序而不是通过测量时间来授予早期访问权。我们推导了协议的手握规范和生产规则,并报告了在65nm工艺中电路的能耗和延迟。

英文摘要:

Mutual exclusion is an important problem in the context of shared resource usage, where only one process can be using the shared resource at any given time. A mutual exclusion protocol that does not use information on the duration for which each process uses the resource can lead to sub-optimal utilization times. We consider a simple two-process mutual exclusion problem with a central server that provides access to the shared resource. We show that even in the absence of a clock, under certain conditions, the server can opportunistically grant early access to a client based on timing information. We call our new protocol opportunistic mutual exclusion. Our approach requires an extra request signal on each channel between client and server to convey extra information, and the server can grant early access based only on the order of events rather than through measuring time. We derive the handshaking specification and production rules for our protocol, and report on the energy and delay of the circuits in a 65nm process.

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

↑