Low latency and persistent data storage
    1.
    发明授权
    Low latency and persistent data storage 有权
    低延迟和持久数据存储

    公开(公告)号:US08656130B2

    公开(公告)日:2014-02-18

    申请号:US13336287

    申请日:2011-12-23

    Abstract: Persistent data storage is provided by a method that includes receiving a low latency store command that includes write data. The write data is written to a first memory device that is implemented by a nonvolatile solid-state memory technology characterized by a first access speed. It is acknowledged that the write data has been successfully written to the first memory device. The write data is written to a second memory device that is implemented by a volatile memory technology. At least a portion of the data in the first memory device is written to a third memory device when a predetermined amount of data has been accumulated in the first memory device. The third memory device is implemented by a nonvolatile solid-state memory technology characterized by a second access speed that is slower than the first access speed.

    Abstract translation: 通过包括接收包括写入数据的低延迟存储命令的方法来提供持续数据存储。 写入数据被写入由以第一访问速度为特征的非易失性固态存储器技术实现的第一存储器件。 确认写入数据已成功写入第一个存储器件。 写入数据被写入由易失性存储器技术实现的第二存储器件。 当在第一存储装置中累积了预定量的数据时,第一存储装置中的数据的至少一部分被写入第三存储装置。 第三存储器件通过非易失性固态存储器技术来实现,其特征在于比第一存取速度慢的第二存取速度。

    PAIRWISE FRAGMENT INTERACTION COMPUTATION
    3.
    发明申请
    PAIRWISE FRAGMENT INTERACTION COMPUTATION 失效
    配对片段交互计算

    公开(公告)号:US20080189093A1

    公开(公告)日:2008-08-07

    申请号:US11926413

    申请日:2007-10-29

    CPC classification number: G06F19/16

    Abstract: A method for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions includes steps of: assigning a weight corresponding to a computational cost for a pair interaction of particles to a simulation space distance between the particles; performing a spatial partitioning of the simulation space; and assigning computation of pair interaction to any node that has the positions of both particles.

    Abstract translation: 用于产生具有成对相互作用的结构化的,扩散系统的负载平衡空间划分的方法包括以下步骤:将与粒子的相互作用的计算成本对应的权重分配给所述粒子之间的模拟空间距离; 执行模拟空间的空间划分; 并且将对交互的计算分配给具有两个粒子的位置的任何节点。

    Reduced message count for interaction decomposition of N-body simulations
    4.
    发明申请
    Reduced message count for interaction decomposition of N-body simulations 审中-公开
    减少消息计数用于N体模拟的相互作用分解

    公开(公告)号:US20070233440A1

    公开(公告)日:2007-10-04

    申请号:US11392405

    申请日:2006-03-29

    CPC classification number: G16C10/00

    Abstract: Disclosed are a method of and system for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions that is scalable to a very large number of nodes and has favorable communications characteristics including well defined bounds on the number of hops and the number of nodes to which a particle's position must be sent. To deal with structural imbalance, we can assign a weight corresponding to the computational cost for a particular pair interaction of particles or locally clustered groups of particles to simulation space at the midpoint of the distance between the particles or centers of the clusters. We then carry out a spatial partitioning of the simulation volume using a k-d tree or optimal recursive bisection (ORB) to divide the volume into sections that have approximately equal total weights. To deal with local degradation of the load balance caused by changes in the distribution of particles from that used to determine the original spatial decomposition one can assign the actual computation of the pair interaction between two particles to any node that has the positions of both particles.

    Abstract translation: 公开了一种用于创建结构化的,扩散系统的粒子的负载平衡空间划分的方法和系统,其具有可扩展到非常大数量的节点的成对交互,并且具有有利的通信特性,包括关于跳数的明确界限, 必须发送粒子位置的节点数。 为了处理结构不平衡,我们可以分配与颗粒或局部聚集的粒子的特定对相互作用的计算成本对应于在簇的粒子或中心之间的距离的中点处的模拟空间的权重。 然后,我们使用k-d树或最优递归二分法(ORB)对模拟体积进行空间划分,以将体积分成具有近似等于总权重的部分。 为了解决由用于确定原始空间分解的粒子分布变化引起的负载平衡的局部退化,可以将两个粒子之间的对相互作用的实际计算分配给具有两个粒子的位置的任何节点。

    System for selling a product utilizing audio content identification
    5.
    发明授权
    System for selling a product utilizing audio content identification 失效
    使用音频内容识别销售产品的系统

    公开(公告)号:US06748360B2

    公开(公告)日:2004-06-08

    申请号:US10080097

    申请日:2002-02-21

    Abstract: It is determined whether audio identifying information generated for an audio content image matches audio identifying information in an audio content database. If the audio identifying information generated for the audio content image matches audio identifying information in the audio content database, at least one product containing or relating to audio content that corresponds to the matching audio identifying information is identified. In one embodiment, the audio content image is received, and the audio identifying information is generated for the audio content image. In another embodiment, the audio identifying information for the audio content image is received. Also provided is a system for selling products.

    Abstract translation: 确定为音频内容图像生成的音频识别信息是否匹配音频内容数据库中的音频识别信息。 如果为音频内容图像生成的音频识别信息与音频内容数据库中的音频识别信息相匹配,则识别包含或与音频内容相关的至少一个产品对应于匹配的音频识别信息。 在一个实施例中,接收音频内容图像,并为音频内容图像生成音频识别信息。 在另一个实施例中,接收音频内容图像的音频识别信息。 还提供了一种销售产品的系统。

    Method and system for process scheduling from within a current context
and switching contexts only when the next scheduled context is different
    6.
    发明授权
    Method and system for process scheduling from within a current context and switching contexts only when the next scheduled context is different 失效
    仅当下一个预定上下文不同时,才能从当前上下文中进行进程调度的方法和系统,并切换上下文

    公开(公告)号:US5526521A

    公开(公告)日:1996-06-11

    申请号:US378067

    申请日:1995-01-25

    CPC classification number: G06F9/462 G06F9/4881

    Abstract: Method and system for managing process scheduling among multiple control contexts within a data processing environment. A given control context, comprising one of multiple control contexts, is assumed to be executing at a processing node within the environment. The approach includes processing a scheduling event; evaluating process scheduling from within the executing control context to determine a restart control context, which also comprises one of the multiple control contexts; and restarting executing data within the restart control context in response to the process scheduling occurring within the given control context. Context switching is employed only if process scheduling determines that the restart control context is other than the given control context. The technique is particularly useful in nonpreemptive parallel data processing environments.

    Abstract translation: 用于在数据处理环境中的多个控制上下文之间管理进程调度的方法和系统。 假设包括多个控制上下文之一的给定控制上下文在环境中的处理节点处执行。 该方法包括处理调度事件; 从所述执行控制上下文中评估进程调度以确定重新启动控制上下文,其还包括所述多个控制上下文之一; 以及响应于在给定控制上下文内发生的进程调度,重新启动重启控制上下文中的执行数据。 仅当进程调度确定重新启动控制上下文不是给定的控制上下文时才使用上下文切换。 该技术在非预防并行数据处理环境中特别有用。

    Field-based similarity search system and method
    7.
    发明授权
    Field-based similarity search system and method 有权
    基于场的相似搜索系统和方法

    公开(公告)号:US08805622B2

    公开(公告)日:2014-08-12

    申请号:US13597385

    申请日:2012-08-29

    CPC classification number: G06F19/22 G06F19/12 G06F19/24 G06F19/705

    Abstract: A field-based similarity search system includes an input device which inputs a query molecule, and a processor which partitions a conformational space of the query molecule into a fragment graph including an acyclic graph including plural fragment nodes connected by rotatable bond edges, computes a property field on fragment pairs of fragments of the query molecule from the fragment graph, the property field including a local approximation of a property field of the query molecule, constructs a set of features of the fragment pairs based on the property field, the features including a set of local, rotationally invariant, and moment-based descriptors generated from all conformations of the fragment graph of the query molecule, and weights the descriptors according to importance as perceived from a training set of descriptors to generate a context-adapted descriptor-to-key mapping which maps the set of descriptors to a set of feature keys.

    Abstract translation: 基于场的相似性搜索系统包括输入查询分子的输入装置和将查询分子的构象空间分割成片段图的处理器,该片段图包括包括通过可旋转键合边缘连接的多个片段节点的非循环图,计算属性 包括查询分子的属性字段的局部近似的属性字段基于属性字段构建片段对的一组特征,其特征包括: 由查询分子的片段图的所有构象产生的局部,旋转不变和基于时刻的描述符集合,并且根据从描述符的训练集所感知的重要性对描述符进行加权,以生成上下文适应的描述符 - 键映射,其将描述符集合映射到一组特征密钥。

    Establishing A Data Communications Connection Between A Lightweight Kernel In A Compute Node Of A Parallel Computer And An Input-Output ('I/O') Node Of The Parallel Computer
    8.
    发明申请
    Establishing A Data Communications Connection Between A Lightweight Kernel In A Compute Node Of A Parallel Computer And An Input-Output ('I/O') Node Of The Parallel Computer 审中-公开
    在并行计算机的计算节点和并行计算机的输入输出('I / O')节点之间建立轻量级内核之间的数据通信连接

    公开(公告)号:US20120331153A1

    公开(公告)日:2012-12-27

    申请号:US13166536

    申请日:2011-06-22

    CPC classification number: G06F15/80 G06F15/17356

    Abstract: Establishing a data communications connection between a lightweight kernel in a compute node of a parallel computer and an input-output (‘I/O’) node of the parallel computer, including: configuring the compute node with the network address and port value for data communications with the I/O node; establishing a queue pair on the compute node, the queue pair identified by a queue pair number (‘QPN’); receiving, in the I/O node on the parallel computer from the lightweight kernel, a connection request message; establishing by the I/O node on the I/O node a queue pair identified by a QPN for communications with the compute node; and establishing by the I/O node the requested connection by sending to the lightweight kernel a connection reply message.

    Abstract translation: 在并行计算机的计算节点中的轻量级内核与并行计算机的输入输出(I / O)节点之间建立数据通信连接,其中包括:使用网络地址和端口值配置计算节点以进行数据通信 I / O节点; 在计算节点上建立队列对,由队列对(QPN)标识的队列对; 在轻巧内核的并行计算机上的I / O节点中接收连接请求消息; 由所述I / O节点上的所述I / O节点建立由QPN标识的用于与所述计算节点进行通信的队列对; 以及通过向轻量级内核发送连接回复消息,由I / O节点建立所请求的连接。

    Field-based similarity search system and method
    9.
    发明授权
    Field-based similarity search system and method 有权
    基于场的相似搜索系统和方法

    公开(公告)号:US08306755B2

    公开(公告)日:2012-11-06

    申请号:US13113256

    申请日:2011-05-23

    CPC classification number: G06F19/22 G06F19/12 G06F19/24 G06F19/705

    Abstract: A similarity search method includes generating a feature database which stores data pertaining to a candidate molecule, as executed by a processor of a computer, the database including a hash table having entries which are generated based on, a set of descriptors generated from conformations of fragment graphs of the candidate molecule, the fragment graphs including plural fragment nodes connected by rotatable bond edges, a specific conformation of the fragment node including a fragment of the candidate molecule, and two neighboring fragments connected by a rotatable bond at a specific dihedral angle including a fragment pair, and a context-adapted descriptor-to-key mapping which maps the set of descriptors to a set of feature keys including indices that label grid cells in discriminant space.

    Abstract translation: 相似搜索方法包括:生成特征数据库,其存储由计算机的处理器执行的关于候选分子的数据,所述数据库包括具有条目的散列表,所述条目是基于从片段的构象产生的描述符集合而生成的 候选分子的图,包括通过可旋转接合边缘连接的多个片段节点的片段图,包括候选分子的片段的片段节点的特定构象和通过可旋转键以特定二面角连接的两个相邻片段,包括 片段对以及上下文适应的描述符到对象映射,其将描述符集合映射到包括在判别空间中标记网格单元的索引的特征密钥集合。

Patent Agency Ranking