利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

80 条记录 (耗时 0.031 秒)

    Data management system and method for concurrent engineering
    63.
    发明授权
    Data management system and method for concurrent engineering 失效
    并行工程数据管理系统及方法

    公开(公告)号：US5812130A

    公开(公告)日：1998-09-22

    申请号：US761580

    申请日：1996-12-06

    申请人： Gary Alan Van Huben ,  Joseph Lawrence Mueller ,  Michael Steven Siegel ,  Thomas Bernard Warnock

    发明人： Gary Alan Van Huben ,  Joseph Lawrence Mueller ,  Michael Steven Siegel ,  Thomas Bernard Warnock

    IPC分类号： G06F17/30 ,  G06Q10/10 ,  G06F3/00

    CPC分类号： G06Q10/10 ,  Y10S707/99933

    摘要： A design control system suitable for use in connection with the design of integrated circuits and other elements of manufacture having many parts which need to be developed in a concurrent engineering environment with inputs provided by users and or systems which may be located anywhere in the world providing a set of control information for coordinating movement of the design information through development and to release while providing dynamic tracking of the status of elements of the bills of materials in an integrated and coordinated activity control system utilizing a repository which can be implemented in the form of a database (relational, object oriented, etc.) or using a flat file system. Once a model is created and/or identified by control information design libraries hold the actual pieces of the design under control of the system without limit to the number of libraries, and providing for tracking and hierarchical designs which are allowed to traverse through multiple libraries. Data Managers become part of the design team, and libraries are programmable to meet the needs of the design group they service.

    摘要翻译： 适用于集成电路和其他制造要素设计的设计控制系统，其具有许多需要在并行工程环境中开发的部件，其中用户提供的输入和可能位于世界任何地方的系统提供 一组控制信息，用于通过开发和释放协调设计信息的移动，同时提供动态跟踪在综合和协调的活动控制系统中的物料清单的元素的状态，利用可以以 数据库（关系，面向对象等）或使用平面文件系统。 一旦通过控制信息设计库创建和/或识别了模型，就可以在系统的控制下保持设计的实际部分，而不限于库的数量，并提供允许遍历多个库的跟踪和分层设计。 数据管理器成为设计团队的一部分，库可编程，以满足他们服务的设计组的需求。

    Structure for Preventing Starvation in a Slotted Ring Data Communications Network
    64.
    发明申请
    Structure for Preventing Starvation in a Slotted Ring Data Communications Network 失效
    在一个开槽环数据通信网络中预防饥饿的结构

    公开(公告)号：US20080159176A1

    公开(公告)日：2008-07-03

    申请号：US12042612

    申请日：2008-03-05

    申请人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    发明人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    IPC分类号： H04L12/28

    CPC分类号： H04L12/4035 ,  H04L12/66

    摘要： A design structure is provided for a slotted ring network, in which a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.

    摘要翻译： 为时隙环网提供了一种设计结构，其中节点可以用任何未预留的时隙发送不可再生的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。

    Apparatus and method for setting A/C bits in token ring frames for switches
    65.
    发明授权
    Apparatus and method for setting A/C bits in token ring frames for switches 失效
    用于在交换机的令牌环形帧中设置A / C位的装置和方法

    公开(公告)号：US06266336B1

    公开(公告)日：2001-07-24

    申请号：US09025715

    申请日：1998-02-18

    申请人： Michael Steven Siegel ,  Max Robert Povse

    发明人： Michael Steven Siegel ,  Max Robert Povse

    IPC分类号： H04L1246

    CPC分类号： H04L49/351 ,  H04L12/433 ,  H04L12/4625 ,  H04L12/4637

    摘要： An apparatus for use in token ring switches for selectively setting the A/C bits in token ring frames. The apparatus includes a database with addresses of stations on the ring connected to the port. The apparatus compares the destination addresses of frames received from the ring with the addresses in the database and sets the A/C bits only if a match does not occur. By setting the A/C bits selectively, by the port, errors that would otherwise occur, either by setting the A/C bits on all frames or not setting the bits on all frames, are obviated.

    摘要翻译： 用于在令牌环形帧中有选择地设置A / C位的令牌环形交换机中使用的装置。 该设备包括一个数据库，该数据库具有连接到端口的环上的站的地址。 该设备将从环接收的帧的目的地地址与数据库中的地址进行比较，并且仅在不发生匹配时才设置A / C位。 通过端口选择性地设置A / C位，通过设置所有帧上的A / C位或不设置所有帧上的位，否则将会发生错误。

    Implementing pointer and stake model for frame alteration code in a network processor
    66.
    发明授权
    Implementing pointer and stake model for frame alteration code in a network processor 失效
    在网络处理器中实现帧更改代码的指针和投注模型

    公开(公告)号：US08170024B2

    公开(公告)日：2012-05-01

    申请号：US11934810

    申请日：2007-11-05

    申请人： Kerry Christopher Imming ,  John David Irish ,  Joseph Franklin Logan ,  Tolga Ozguner ,  Michael Steven Siegel

    发明人： Kerry Christopher Imming ,  John David Irish ,  Joseph Franklin Logan ,  Tolga Ozguner ,  Michael Steven Siegel

    IPC分类号： H04L12/56

    CPC分类号： H04L49/901 ,  H04L49/90

    摘要： A method, apparatus and computer program product are provided for implementing a pointer and stake model for frame alteration code in a network processor. A current pointer and a stake are provided for a packet selected for transmit. The current pointer is maintained for tracking a current position for frame alteration operations in the packet. The stake is maintained for tracking a start of a current header for frame alteration operations in the packet. The current pointer is used by frame alteration code instructions to specify a sequence of operations relative to the current pointer. The specified frame alteration sequence is compact in terms of code size to operate on data within a small window of bytes. Advance pointer instructions allow the current and stake pointers to be advanced an arbitrary number of bytes into the packet.

    摘要翻译： 提供了一种方法，装置和计算机程序产品，用于在网络处理器中实现用于帧改变码的指针和拍摄模型。 为选择用于发送的分组提供当前指针和分支。 保持当前指针用于跟踪分组中帧更改操作的当前位置。 保留该批次用于跟踪该分组中的帧更改操作的当前报头的开始。 当前指针由帧改变代码指令使用以指定相对于当前指针的操作序列。 指定的帧改变序列在代码大小方面是紧凑的，以便在小的字节窗口内对数据进行操作。 高级指针指令允许当前和指针指针以任意数量的字节进入数据包。

    Structure for preventing starvation in a slotted ring data communications network
    67.
    发明授权
    Structure for preventing starvation in a slotted ring data communications network 失效
    用于在时隙环数据通信网络中防止饥饿的结构

    公开(公告)号：US07826399B2

    公开(公告)日：2010-11-02

    申请号：US12042612

    申请日：2008-03-05

    申请人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    发明人： Timothy Hume Heil ,  Michael Steven Siegel ,  Jeffrey R. Summers ,  Steven Paul VanderWiel

    IPC分类号： H04L12/43

    CPC分类号： H04L12/4035 ,  H04L12/66

    摘要： A design structure is provided for a slotted ring network, in which a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.

    摘要翻译： 为时隙环网提供了一种设计结构，其中节点可以用任何未预留的时隙发送不可再生的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。

    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL-TIME TRAFFIC STREAMS
    69.
    发明申请
    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL-TIME TRAFFIC STREAMS 失效
    实时和非实时交通流中基于优先级的带宽分配

    公开(公告)号：US20080232386A1

    公开(公告)日：2008-09-25

    申请号：US12114767

    申请日：2008-05-03

    申请人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    发明人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    IPC分类号： H04L12/28

    CPC分类号： H04L47/6215 ,  H04L47/10 ,  H04L47/2416 ,  H04L47/2433 ,  H04L47/30 ,  H04L47/32 ,  H04L47/50 ,  H04L47/52 ,  H04L47/56

    摘要： A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译： 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级，该值优先级的最小和最大速率以及当前实时队列拥塞条件，将实时分组丢弃或传输到实时队列中。 可以基于其值优先级，该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。

    Priority based bandwidth allocation within real-time and non-real-time traffic streams
    70.
    发明授权
    Priority based bandwidth allocation within real-time and non-real-time traffic streams 失效
    实时和非实时业务流中基于优先级的带宽分配

    公开(公告)号：US07385997B2

    公开(公告)日：2008-06-10

    申请号：US10118493

    申请日：2002-04-08

    申请人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    发明人： Brahmanand Kumar Gorti ,  Marco Heddes ,  Clark Debs Jeffries ,  Andreas Kind ,  Michael Steven Siegel

    IPC分类号： H04L12/28 ,  H04L12/56

    CPC分类号： H04L47/6215 ,  H04L47/10 ,  H04L47/2416 ,  H04L47/2433 ,  H04L47/30 ,  H04L47/32 ,  H04L47/50 ,  H04L47/52 ,  H04L47/56

    摘要： A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译： 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级，该值优先级的最小和最大速率以及当前实时队列拥塞条件，将实时分组丢弃或传输到实时队列中。 可以基于其值优先级，该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。