会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Low latency and persistent data storage
    • 低延迟和持久数据存储
    • US08656130B2
    • 2014-02-18
    • US13336287
    • 2011-12-23
    • Blake G. FitchMichele M. FranceschiniAshish JagmohanTodd E. Takken
    • Blake G. FitchMichele M. FranceschiniAshish JagmohanTodd E. Takken
    • G06F12/00
    • G06F3/0611G06F3/0659G06F3/0688G06F11/1658G06F11/1666G06F12/02
    • 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.
    • 通过包括接收包括写入数据的低延迟存储命令的方法来提供持续数据存储。 写入数据被写入由以第一访问速度为特征的非易失性固态存储器技术实现的第一存储器件。 确认写入数据已成功写入第一个存储器件。 写入数据被写入由易失性存储器技术实现的第二存储器件。 当在第一存储装置中累积了预定量的数据时,第一存储装置中的数据的至少一部分被写入第三存储装置。 第三存储器件通过非易失性固态存储器技术来实现,其特征在于比第一存取速度慢的第二存取速度。
    • 4. 发明申请
    • Reduced message count for interaction decomposition of N-body simulations
    • 减少消息计数用于N体模拟的相互作用分解
    • US20070233440A1
    • 2007-10-04
    • US11392405
    • 2006-03-29
    • Blake G. FitchRobert S. GermainMichael C. PitmanAleksandr Rayshubskiy
    • Blake G. FitchRobert S. GermainMichael C. PitmanAleksandr Rayshubskiy
    • G06G7/48
    • G16C10/00
    • 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.
    • 公开了一种用于创建结构化的,扩散系统的粒子的负载平衡空间划分的方法和系统,其具有可扩展到非常大数量的节点的成对交互,并且具有有利的通信特性,包括关于跳数的明确界限, 必须发送粒子位置的节点数。 为了处理结构不平衡,我们可以分配与颗粒或局部聚集的粒子的特定对相互作用的计算成本对应于在簇的粒子或中心之间的距离的中点处的模拟空间的权重。 然后,我们使用k-d树或最优递归二分法(ORB)对模拟体积进行空间划分,以将体积分成具有近似等于总权重的部分。 为了解决由用于确定原始空间分解的粒子分布变化引起的负载平衡的局部退化,可以将两个粒子之间的对相互作用的实际计算分配给具有两个粒子的位置的任何节点。
    • 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
    • Blake G. FitchMark E. Giampapa
    • Blake G. FitchMark E. Giampapa
    • G06F9/46G06F9/44
    • G06F9/462G06F9/4881
    • 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.
    • 用于在数据处理环境中的多个控制上下文之间管理进程调度的方法和系统。 假设包括多个控制上下文之一的给定控制上下文在环境中的处理节点处执行。 该方法包括处理调度事件; 从所述执行控制上下文中评估进程调度以确定重新启动控制上下文,其还包括所述多个控制上下文之一; 以及响应于在给定控制上下文内发生的进程调度,重新启动重启控制上下文中的执行数据。 仅当进程调度确定重新启动控制上下文不是给定的控制上下文时才使用上下文切换。 该技术在非预防并行数据处理环境中特别有用。