公开(公告)号：US6009275A

公开(公告)日：1999-12-28

申请号：US729193

申请日：1996-10-15

Applicant: Rodney A. DeKoning ,  Timothy E. Hoglund

Inventor： Rodney A. DeKoning ,  Timothy E. Hoglund

IPC: G06F15/16 ,  G06F9/50 ,  G06F9/52 ,  G06F13/18 ,  G06F13/36 ,  G06F15/177 ,  G06F13/00

CPC classification number: G06F9/5011 ,  G06F13/18 ,  G06F13/36 ,  G06F9/524 ,  G06F2209/503

Abstract: Resource allocation logic for a computer system including a plurality of processors which share access to, and control of, a plurality of resources, such as disk drive units or busses. The resource allocation logic coordinates the execution of requests received from the processors to avoid resource sharing inefficiencies and deadlock situations. The allocation logic maintains a "request" queue for each processor, seeking to satisfy all requests quickly and fairly. The queues contain an entry corresponding to each request received from its corresponding processor and an identification of resources that are required by the entry's corresponding request. The allocation logic also maintains a "resources available" status array of resources which are not currently in use by any processors, or are not reserved for future use by any processors. The logic repeatedly compares each entry in the request queues with the entries in the resources available status array to detect an entry in the request queue identifying resources all of which are contained in the resources available status array. Once the allocation logic can satisfy a particular request, it signals a grant to the requesting processor for the resources requested. The requested resources are removed from the resources available status array. Upon conclusion of execution of the granted request, the resources are again released to the resource allocation logic for utilization by other resource requests. Additionally, each request queue contains a list age indicating the relative age of each request queue with respect to the other request queues, and each entry in the request queues includes a request age indicating the relative age of each entry in a request queue with respect to other entries in the request queue. In examining the request queues to identify I/O requests for execution, priority is awarded to entries based on the relative ages of the request queues and request queue entries.

公开(公告)号：US5761424A

公开(公告)日：1998-06-02

申请号：US580955

申请日：1995-12-29

Applicant: John M. Adams ,  Timothy E. Hoglund ,  Stephen M. Johnson ,  Mark A. Reber ,  David M. Weber

Inventor： John M. Adams ,  Timothy E. Hoglund ,  Stephen M. Johnson ,  Mark A. Reber ,  David M. Weber

IPC: H04L12/56 ,  G06F15/17 ,  H04L29/06 ,  G06F15/16

CPC classification number: H04L29/06 ,  G06F15/17

Abstract: A method and associated apparatus for automating the filtration and generation of information in a packetized communication system. A filtration table includes entries used in recognizing a valid packet received at a node in a communication system. A mask field in each entry is applied to appropriate fields in the packet (e.g. the ordered set as applied to Fibre Channel communication systems) to determine the validity of the packet with regard to the receiving node. Rules in a field of each entry further qualify the recognition of a received packet (e.g. ordered set) by testing the reception of the packet against other logical rules. Action fields in each record permit definition of actions to be invoked automatically (e.g. automatic adjustment of fill transmissions in Fibre Channel applications) in response to receipt and recognition of a particular packet. The set of packets recognized by the receiving node may be modified by adding, deleting, or modifying the entries in the filtration table. The programmable filtration thereby permits simple modifications to the protocol supported by the receiving node. Programmable generation capabilities of the present invention permit rapid integration of additional packets (e.g. ordered sets) transmitted in response to perceived packets in the receiving node. Programmable parameters in the receiving node permit automatic generation and transmission of packets in accordance with the parameter settings at the time of packet transmission.

Abstract translation: 一种用于在分组化通信系统中自动化过滤和生成信息的方法和相关联的装置。 过滤表包括用于识别在通信系统中的节点处接收的有效分组的条目。 每个条目中的掩码字段被应用于分组中的适当字段（例如应用于光纤通道通信系统的有序集合），以确定分组关于接收节点的有效性。 通过根据其他逻辑规则测试分组的接收，每个条目的字段中的规则进一步限定了对接收到的分组（例如，有序集合）的识别。 每个记录中的动作字段允许响应于对特定分组的接收和识别而自动调用的动作的定义（例如，在光纤通道应用中自动调整填充传输）。 可以通过添加，删除或修改过滤表中的条目来修改由接收节点识别的分组集合。 可编程过滤因此允许对接收节点支持的协议的简单修改。 本发明的可编程生成能力允许快速集成响应于接收节点中的感知分组而发送的附加分组（例如有序集合）。 接收节点中的可编程参数允许根据分组传输时的参数设置自动生成和传输分组。

公开(公告)号：US5237660A

公开(公告)日：1993-08-17

申请号：US289859

申请日：1988-12-27

Applicant: Bret S. Weber ,  James R. Reif ,  Timothy E. Hoglund

Inventor： Bret S. Weber ,  James R. Reif ,  Timothy E. Hoglund

IPC: G06F5/10 ,  G06F5/14 ,  G06F13/42

CPC classification number: G06F5/14 ,  G06F13/423

Abstract: A circuit for use with a SCSI interface for controlling synchronous data transfers into an attached FIFO memory. The circuit uses a comparator to keep track of the number of FIFO locations available by starting with a threshold value, which represents the locations available initially, and comparing the net number of FIFO locations filled to the threshold value. The net number of FIFO locations filled is kept by a counter which counts the difference between the words transferred into the FIFO and the words transferred out of the FIFO. The threshold value is an adjusted offset value if the SCSI interface is operating in INITIATOR mode, and the FIFO size if the SCSI interface is operating in TARGET mode. When the comparator determines that the FIFO is filled, it pauses the current synchronous message by withholding an ACK in the INITIATOR mode or a REQ in the TARGET mode.

Abstract translation: 用于与SCSI接口一起使用的电路，用于将同步数据传输到连接的FIFO存储器中。 电路使用比较器来跟踪可用的FIFO位置的数量，从阈值开始，阈值表示最初可用的位置，并且将填充的FIFO位置的净数与阈值进行比较。 填充的FIFO位置的净数由计数器计数，该计数器计数传输到FIFO中的字与从FIFO传送的字之间的差。 如果SCSI接口工作在INITIATOR模式，则该阈值是调整后的偏移值，如果SCSI接口工作在TARGET模式，则该值为FIFO大小。 当比较器确定FIFO被填充时，它通过在INITIATOR模式中保留ACK或者在目标模式中的REQ来暂停当前的同步消息。