中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

5 records (took 0.012 seconds)

    Optimizing allocation of flash memory to file groups
    3.
    发明授权
    Optimizing allocation of flash memory to file groups 有权
    优化闪存到文件组的分配

    公开(公告)号：US09128825B1

    公开(公告)日：2015-09-08

    申请号：US13897159

    申请日：2013-05-17

    Applicant: GOOGLE INC.

    Inventor： Christoph Albrecht ,  Murray Stokely ,  Arif Merchant ,  Christian Eric Schrock ,  Xudong Shi

    IPC: G06F12/02

    CPC classification number: G06F12/0246 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0649 ,  G06F3/0665 ,  G06F3/0685 ,  G06F12/02 ,  G06F12/0253

    Abstract: Systems and methods are discussed relating to allocation of memory from a fixed pool of fast memory within a data center having a data storage area equipped with that memory. Techniques include: receiving a request to write data in the storage area; identifying a file group associated with the write request; analyzing previous data activity traces associated with the file group; determining an available fast memory amount based on the total amount of fast memory in the fixed pool and a currently allocated amount of fast memory; determining a fast memory allocation for the file group based on the previous data activity traces, the available fast memory, and a fast memory constraint, the memory allocation including an allocation amount and a write probability; and providing information about the memory allocation to a file system of the data center, which writes the data based on the allocation amount and write probability.

    Abstract translation: 讨论了关于在具有配备有该存储器的数据存储区域的数据中心内从快速存储器的固定池分配存储器的系统和方法。 技术包括：接收在存储区域中写入数据的请求; 识别与所述写请求相关联的文件组; 分析与文件组相关联的以前的数据活动跟踪; 基于固定池中的快速存储器的总量和当前分配的快速存储量来确定可用的快速存储器量; 基于先前的数据活动轨迹，可用的快速存储器和快速存储器约束确定文件组的快速存储器分配，存储器分配包括分配量和写入概率; 并且向数据中心的文件系统提供关于存储器分配的信息，其基于分配量和写入概率来写入数据。

    NETWORK STOCHASTIC CROSS-LAYER OPTIMIZATION FOR MEETING TRAFFIC FLOW AVAILABILITY TARGET AT MINIMUM COST
    4.
    发明申请
    NETWORK STOCHASTIC CROSS-LAYER OPTIMIZATION FOR MEETING TRAFFIC FLOW AVAILABILITY TARGET AT MINIMUM COST 有权
    网络交叉交叉层优化交易流量可用性目标在最低成本

    公开(公告)号：US20170012856A1

    公开(公告)日：2017-01-12

    申请号：US14922905

    申请日：2015-10-26

    Applicant: Google Inc.

    Inventor： Xiaoxue Zhao ,  Emilie Jeanne Anne Danna ,  Christoph Albrecht ,  Bikash Koley ,  Satyajeet Singh Ahuja ,  Vinayak Dangui

    IPC: H04L12/721

    CPC classification number: H04L45/12 ,  G06F17/509 ,  G06F2217/10 ,  G06F2217/72 ,  H04L41/14 ,  H04L41/145 ,  H04W16/18

    Abstract: The present disclosure describes system and methods for network planning. The systems and methods can incorporate network traffic demands, availability requirements, latency, physical infrastructure and networking device capability, and detailed cost structures to calculate a network design with minimum or reduced cost compared to conventional methods. In some implementations, the method include providing an initial, deterministic set of failures, and then successively performing a network optimization and a network availability simulation to determine which failures most impact the performance of the network model. The high impact failures can then be provided back into the system, which generates an improved network design while still maintaining minimum cost.

    Abstract translation: 本公开描述了用于网络规划的系统和方法。 与传统方法相比，系统和方法可以结合网络流量需求，可用性要求，延迟，物理基础设施和网络设备能力以及详细的成本结构来计算网络设计，成本最低或降低。 在一些实现中，该方法包括提供初始的确定性故障集合，然后连续执行网络优化和网络可用性模拟，以确定哪些故障最能影响网络模型的性能。 然后可以将高冲击故障返回到系统中，从而产生改进的网络设计，同时仍然保持最低成本。

Patent Agency Ranking