Systems and methods for multiresolution parsing

    公开(公告)号:US10313361B2

    公开(公告)日:2019-06-04

    申请号:US14883294

    申请日:2015-10-14

    IPC分类号: G06F17/30 H04L29/06

    摘要: A multiresolution parser (MRP) can selectively extract one or more information units from a dataset based on the available processing capacity and/or the arrival rate of the dataset. Should any of these parameters change, the MRP can adaptively change the information units to be extracted such that the benefit or value of the extracted information is maximized while minimizing the cost of extraction. This tradeoff is facilitated, at least in part, by an analysis of the spectral energy of the datasets expected to be processed by the MRP. The MRP can also determine its state after a processing iteration and use that state information in subsequent iterations to minimize the required computations in such subsequent iterations, so as to improve processing efficiency.

    Methods and apparatus for automatic communication optimizations in a compiler based on a polyhedral representation

    公开(公告)号:US09830133B1

    公开(公告)日:2017-11-28

    申请号:US13712659

    申请日:2012-12-12

    IPC分类号: G06F9/45

    CPC分类号: G06F8/41 G06F8/453 G06F8/457

    摘要: Methods, apparatus and computer software product for source code optimization are provided. In an exemplary embodiment, a first custom computing apparatus is used to optimize the execution of source code on a second computing apparatus. In this embodiment, the first custom computing apparatus contains a memory, a storage medium and at least one processor with at least one multi-stage execution unit. The second computing apparatus contains at least one local memory unit that allows for data reuse opportunities. The first custom computing apparatus optimizes the code for reduced communication execution on the second computing apparatus. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

    SYSTEMS AND METHODS FOR COMMUNICATION USING SPARSITY BASED PRE-COMPENSATION

    公开(公告)号:US20170099113A1

    公开(公告)日:2017-04-06

    申请号:US15283781

    申请日:2016-10-03

    IPC分类号: H04B10/69 H04B10/2507

    摘要: A signal pre-compensation system analyzes one or more properties of a communication medium and, taking advantage of the locality of propagation, generates using sparse fast Fourier transform (sFFT) a sparse kernel based on the medium properties. The system models propagation of data signals through the medium as a fixed-point iteration based on the sparse kernel, and determines initial amplitudes for the data symbol(s) to be transmitted using different communication medium modes. Fixed-point iterations are performed using the sparse kernel to iteratively update the initial amplitudes. If the iterations converge, a subset of the finally updated amplitudes is used as launch amplitudes for the data symbol(s). The data symbol(s) can be modulated using these launch amplitudes such that upon propagation of the pre-compensated data symbol(s) through the communication medium, they would resemble the original data symbols at a receiver, despite any distortion and/or cross-mode interference in the communication medium.

    SYSTEMS AND METHODS FOR FOOTPRINT BASED SCHEDULING
    18.
    发明申请
    SYSTEMS AND METHODS FOR FOOTPRINT BASED SCHEDULING 审中-公开
    基于FOOTPRINT的调度的系统和方法

    公开(公告)号:US20160098257A1

    公开(公告)日:2016-04-07

    申请号:US14839539

    申请日:2015-08-28

    IPC分类号: G06F9/45

    CPC分类号: G06F8/4441 G06F8/4434

    摘要: A system can generate and impose constraints on a compiler/scheduler so as to specifically minimize the footprints of one or more program variables. The constraints can be based on scopes of the variables and/or on dependence distances between statements specifying operations that use the one or more program variables.

    摘要翻译: 系统可以生成并对编译器/调度器施加约束,以便特别地最小化一个或多个程序变量的占位面积。 约束可以基于变量的范围和/或指定使用一个或多个程序变量的操作的语句之间的依赖距离。

    SYSTEMS AND METHODS FOR SOLVING UNRESTRICTED INCREMENTAL CONSTRAINT PROBLEMS
    20.
    发明申请
    SYSTEMS AND METHODS FOR SOLVING UNRESTRICTED INCREMENTAL CONSTRAINT PROBLEMS 审中-公开
    用于解决未解决的增量约束问题的系统和方法

    公开(公告)号:US20150379404A1

    公开(公告)日:2015-12-31

    申请号:US14729731

    申请日:2015-06-03

    IPC分类号: G06N5/02 G06N7/00

    摘要: We present the architecture of a high-performance constraint solver R-Solve that extends the gains made in SAT performance over the past fifteen years on static decision problems to problems that require on-the-fly adaptation, solution space exploration and optimization. R-Solve facilitates collaborative parallel solving and provides an efficient system for unrestricted incremental solving via Smart Repair. R-Solve can address problems in dynamic planning and constrained optimization involving complex logical and arithmetic constraints.

    摘要翻译: 我们介绍一个高性能约束求解器R-Solve的架构,将SAT性能在过去十五年中的增长放在静态决策问题上,需要实时适应,解决方案空间探索和优化的问题。 R-Solve促进协同并行解决,并通过智能修复提供了无限制增量解决方案的高效系统。 R-Solve可解决涉及复杂逻辑和算术约束的动态规划和约束优化中的问题。