中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

126 records (took 0.027 seconds)

    Parallel algorithm to set up benes switch; trading bandwidth for set up time
    41.
    发明授权
    Parallel algorithm to set up benes switch; trading bandwidth for set up time 失效
    并行算法设置benes切换; 交易带宽设置时间

    公开(公告)号：US5495476A

    公开(公告)日：1996-02-27

    申请号：US378755

    申请日：1995-01-26

    Applicant: Manoj Kumar

    Inventor： Manoj Kumar

    IPC: H04Q3/68 ,  H04Q3/18 ,  H04Q3/32

    CPC classification number: H04Q3/68

    Abstract: Benes networks are very effective in providing inter-processor communication in SIMD parallel machines, provided the communication patterns are compile-time determinable. These networks are ill suited when communication patterns are dynamically varying because of the long set up time requirements. The present invention is a method for handling dynamically varying communication patterns efficiently by operating the Benes network in a time division multiplexed manner, wherein during a given transmission period, the middle stage switches of the Benes network are configured as a portion of the middle stage switches of a Clos network configured to route all signals in a single period.

    Abstract translation: 如果通信模式是编译时可确定的，Benes网络在SIMD并行机中提供处理器间通信非常有效。 当通信模式由于设置时间长的要求而动态变化时，这些网络不合适。 本发明是一种通过以时分复用方式操作Benes网络来有效地处理动态变化的通信模式的方法，其中在给定的传输周期期间，Benes网络的中间级交换机被配置为中间级交换机的一部分 被配置为在单个周期内路由所有信号的Clos网络。

    Computer architecture for the concurrent execution of sequential programs
    42.
    发明授权
    Computer architecture for the concurrent execution of sequential programs 失效
    用于顺序执行程序的计算机体系结构

    公开(公告)号：US5197137A

    公开(公告)日：1993-03-23

    申请号：US387552

    申请日：1989-07-28

    Applicant: Manoj Kumar ,  Ambuj Goyal

    Inventor： Manoj Kumar ,  Ambuj Goyal

    IPC: G06F9/38 ,  G06F9/44

    CPC classification number: G06F8/45

    Abstract: A computer system processes mixed control, indexing and data manipulation instructions in groups of N instructions at a time. A group of instructions is applied to a set of N Dispatch units which execute the control and indexing instructions directly. The Dispatch Units convert data manipulation instructions into a more primitive data flow operations. The data flow operations are applied to a set of M Execution Units which process the operations concurrently by observing data dependency constraints. The data used by the control and indexing instructions is stored in a group of identical memory structures which are accessible by each of the Dispatch Units. Data for the data manipulation instructions is stored in a data structure which is divided among the Execution Units.

    Switching method for multistage interconnection networks with hot spot traffic
    43.
    发明授权
    Switching method for multistage interconnection networks with hot spot traffic 失效
    具有热点流量的多级互连网络的切换方法

    公开(公告)号：US4862454A

    公开(公告)日：1989-08-29

    申请号：US219960

    申请日：1988-07-15

    Applicant: Daniel M. Dias ,  Manoj Kumar

    Inventor： Daniel M. Dias ,  Manoj Kumar

    IPC: H04J3/26 ,  H04L12/56

    CPC classification number: H04L47/10 ,  H04L49/25 ,  H04L49/254 ,  H04L49/30 ,  H04L49/3018 ,  H04L49/40

    Abstract: A method of switching data packets through a multistage interconnection network (MIN), to prevent hot spot traffic from degrading uniform traffic performance. Each of the address bits in each packet determine the output link at each particular stage of the network to which the packet must be routed. A packet is accepted at an input buffer of the stage only if an acceptance test is met. This acceptance test depends not only on the availability of a buffer at the input buffer at a stage of the network, but also on how the address bits of the packet are related to address bits of other packets in the buffer, and on the stage of the network. If the acceptance test is not met, the packet is retained in the previous stage of the MIN, and is moved to the rear of a queue of packets in the buffer at that stage, or given a lower priority in the queue.

    Distributed voice-data switching on multi-stage interconnection networks
    44.
    发明授权
    Distributed voice-data switching on multi-stage interconnection networks 失效
    多级互连网络上的分布式语音数据交换

    公开(公告)号：US4679190A

    公开(公告)日：1987-07-07

    申请号：US856321

    申请日：1986-04-28

    Applicant: Daniel M. Dias ,  Manoj Kumar ,  Yeong-Chang L. Lien ,  Kiyoshi Maruyama

    Inventor： Daniel M. Dias ,  Manoj Kumar ,  Yeong-Chang L. Lien ,  Kiyoshi Maruyama

    IPC: H04L12/56 ,  H04Q11/04 ,  H01Q11/04

    CPC classification number: H04Q11/04 ,  H04L49/254 ,  H04L49/101 ,  H04L49/205 ,  H04L49/25 ,  H04L49/40

    Abstract: A method of switching synchronous and asynchronous data packets through a multi-stage interconnection network (MIN), so as to insure that packets with the highest assignable priority level will never be blocked at any stage of the network. More specifically, this invention relates to a method of switching voice and data packets over the MIN wherein each of the address bits in each packet determine the connection to be established at each particular stage in the network and wherein each packet has therein a priority level. In each time slot of a frame, the priority level of the packets stored in a particular originating adapter are compared and the packet with the highest priority level in each adapter is forwarded through the MIN and routed through the MIN as described above. Also, at each subswitch at each stage of the MIN, if two or more packets request the same subswitch output, only the packet with the higher priority is forwarded to the subswitch output. A packet will be assigned the highest priority only if a corresponding packet for a given circuit connection with second highest priority level was successfully transmitted through the MIN.

    Abstract translation: 一种通过多级互连网络（MIN）切换同步和异步数据分组的方法，以确保在可能的优先级别最高的分组不会在网络的任何阶段被阻塞。 更具体地，本发明涉及一种通过MIN切换语音和数据分组的方法，其中每个分组中的每个地址比特确定要在网络中的每个特定阶段建立的连接，并且其中每个分组具有优先级。 在帧的每个时隙中，比较存储在特定始发适配器中的分组的优先级，并且通过MIN转发每个适配器中具有最高优先级的分组，并如上所述通过MIN进行路由。 此外，在MIN的每个阶段的每个子切换中，如果两个或更多个分组请求相同的子交换机输出，则只有具有较高优先级的分组被转发到子交换机输出。 只有通过MIN成功传送了具有第2最高优先级的给定电路连接的相应数据包，才会将数据包分配给最高优先级。

    NATIVE GRAIN AMYLASES IN ENZYME COMBINATIONS FOR GRANULAR STARCH HYROLYSIS
    48.
    发明申请
    NATIVE GRAIN AMYLASES IN ENZYME COMBINATIONS FOR GRANULAR STARCH HYROLYSIS 审中-公开
    用于颗粒淀粉溶解的酶组合中的原料颗粒

    公开(公告)号：US20130011883A1

    公开(公告)日：2013-01-10

    申请号：US13553055

    申请日：2012-07-19

    Applicant: Manoj Kumar

    Inventor： Manoj Kumar

    IPC: C12P7/14 ,  C12P7/04 ,  C12P19/14

    CPC classification number: C12P7/06 ,  C12P19/14 ,  Y02E50/17

    Abstract: Described herein are starch hydrolysis processes for obtaining fermentable sugars from starch in milled plant material at temperatures below the starch gelatinization temperature and using exogenous plant alpha amylases further to the fermentation of the sugars to produce end products, such as ethanol.

    Abstract translation: 本文描述的是淀粉水解方法，用于在低于淀粉糊化温度的温度下在研磨的植物材料中从淀粉中获得可发酵糖，并且使用外源植物α-淀粉酶进一步进行糖的发酵以产生最终产物如乙醇。

    Method to automatically map business function level policies to it management policies
    49.
    发明授权
    Method to automatically map business function level policies to it management policies 失效
    自动将业务功能级别策略映射到管理策略的方法

    公开(公告)号：US08255972B2

    公开(公告)日：2012-08-28

    申请号：US12134933

    申请日：2008-06-06

    Applicant: Alain C. Azagury ,  Murthy V. Devarakonda ,  Nikolai Joukov ,  Manoj Kumar ,  Konstantinos Magoutis ,  Birgit M. Pfitzmann ,  Norbert G. Vogl

    Inventor： Alain C. Azagury ,  Murthy V. Devarakonda ,  Nikolai Joukov ,  Manoj Kumar ,  Konstantinos Magoutis ,  Birgit M. Pfitzmann ,  Norbert G. Vogl

    IPC: G06F17/00

    CPC classification number: G06F21/604 ,  G06F2221/2101

    Abstract: A method, system, computer program product, and computer program storage device for transforming a high-level policy associated with a high layer to a low-level policy associated with a low layer. Mapping between high-level objects in a high layer and low-level objects in a low layer is derived by an automated discovery tool. The high-level policy is mapped to the low-level policy according to the mapping (e.g., by substituting the high-level objects with the low-level objects and by performing a syntax transformation). In one embodiment, a low-level policy is transformed to a high-level policy according to the mapping. As exemplary embodiments, policy transformations in traffic shaping and data retention are disclosed.

    Abstract translation: 一种用于将与高层相关联的高级策略变换为与低层相关联的低级策略的方法，系统，计算机程序产品和计算机程序存储设备。 高层的高层对象与低层对象之间的映射是通过自动发现工具得出的。 高级策略根据映射映射到低级策略（例如，通过用低级对象替换高级对象，并通过执行语法转换）。 在一个实施例中，根据映射将低级策略转换为高级策略。 作为示例性实施例，公开了流量整形和数据保持中的策略转换。

Patent Agency Ranking