一种紧耦合多处理机系统及其共享存储器策略研究

本文提出了一种共享存储器的多处理机系统，讨论了它的存储器的逻辑结构及工作原理，给出了系统共享资源仲裁器方案及其数据优先级的实现算法和数学模型。     

i860多机系统中串行链循环优先权总线仲裁器

本文介绍了一种总线仲裁器的逻辑电路。它具有仲裁开销小，扩展性好，各模块公平占用总线等特点。很适合应用于共享总线的多处理器系统中。     

一个紧耦合的双8098单片机系统

本文介绍双８０９８单片紧耦合系统，两个８０９８紧密配合，完成实时处理、实时控制等任务。系统的控制电路采用互锁方法，解决访问共享ＲＡＭ的冲突。该系统有很高的性能价格比。     

利用酉几何进一步构造带仲裁的认证码

该文利用有限域上的酉几何构作了三类新的带仲裁的认证码,计算了码的参数;当编码规则按等概率分布选取时,计算出各种攻击成功的概率。研究结果表明可用酉几何进一步构作多类带仲裁的认证码。     

Highly reliable XoR Feed Arbiter Physical Unclonable Function (XFAPUF) in 180 nm process for IoT security

A Physical unclonable function (PUF) is a promising hardware that augments the security feature for Integrated Circuit (IC) identification and authentication. It is one of the reliable solutions to many security threats as it facilitates die unique identifier feature by increasing the uncertainty and prediction. In this article, a novel XoR Feed Arbiter PUF (XFAPUF) is proposed that minimizes vulnerabilities by introducing more complexity using relatively smaller number of challenges against conventional Arbiter PUF (APUF) techniques that can easily obfuscate intruders. It is implemented in a standard 180 nm CMOS process and validated through Monte-Carlo simulations. The proposed design has significant advantage in arbitration process and produces reliable key generation against manufacturing Process Variations (PVs). Moreover, it offers better uniqueness and reliability than prior works as it achieves promising results, such as uniqueness of 50.03%, diffuseness of 49.52%, and worst-case reliability of 99.81% that ranges from 10 °C to 80 °C, with 10% fluctuations in supply voltage.     

PCI总线分组循环仲裁算法的实现

文章介绍了一种分组循环先仲裁算法，该算法具有现实公平性特点，文章论述了分组循环优先仲裁算法在PCI总线仲裁中的应用，并给出了分组循环仲裁算法的实现，其实现体现了ASIC模块化设计思想，具有很好的可扩展性，由于采用二叉树并行筛选，该实现方法能很快的得到仲裁结果。     

Arbitration-free synchronization

Implementing traditional forms of multiprocess synchronization requires a hardware arbiter. Here, we consider what kind of synchronization is achievable without arbitration. Several kinds of simple arbiter-free registers are defined and shown to have equal power, and the class of synchronization problems solvable with such registers is characterized. More powerful forms of arbiter-free communication primitives are described. However, the problem of characterizing the most general form of arbiter-free synchronization remains unsolved.Received: November 2001, Accepted: July 2002,     

PCI总线加权优先循环仲裁算法

文章介绍了在PCI系统结构中新的总线仲裁机制,提出了加权优先循环算法。该算法是基于优先算法和公平循环算法的访问策略,它的特点是避免了优先算法中高优先级的PCI主设备在重新请求访问总线时独占总线,同时也解决了公平循环算法中各主设备对总线访问的平均性问题,使得仲裁器可以根据不同设备的性能要求,分配不同设备不同加权因子,使高性能和高速度设备能及时访问总线,降低访问延迟时间。     

一种具有容错功能的快速总线裁决机构

本文重点探讨了具有容错功能的总线裁决机制。在一种全模块化的快速裁决器的基础上，提高了对裁决器故障进行快速诊断的设计方案，以及对偶然性和固定性错误进行处理的。     

(h,k)-Arbiters for h-out-of-k mutual exclusion problem

h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h (1hk) units at the same time. Though k-arbiter has been shown to be a quorum-based solution to this problem, quorums in k-arbiter are much larger than those in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on k-arbiter needs many messages. This paper introduces the new notion that each request uses different quorums depending on the number of units of its request. Based on the notion, this paper defines two (h,k)-arbiters for h-out-of-k mutual exclusion: a uniform (h,k)-arbiter and a (k+1)-cube (h,k)-arbiter. The quorums in each (h,k)-arbiter are not larger than the ones in the corresponding k-arbiter; consequently, it is more efficient to use (h,k)-arbiters than the k-arbiters. A uniform (h,k)-arbiter is a generalization of the majority coterie for 1-mutual exclusion. A (k+1)-cube (h,k)-arbiter is a generalization of square grid coterie for 1-mutual exclusion.