公开(公告)号：US09215184B2

公开(公告)日：2015-12-15

申请号：US13275030

申请日：2011-10-17

Applicant: Yoshio Turner ,  Jose Renato G Santos ,  Niraj Tolia

Inventor： Yoshio Turner ,  Jose Renato G Santos ,  Niraj Tolia

IPC: H04L12/28 ,  H04L12/56 ,  H04L12/801 ,  H04L12/46

CPC classification number: H04L47/35 ,  H04L12/4633 ,  H04L47/12 ,  H04L47/19

Abstract: Managing non-congestion-controlled message traffic in a datacenter. Any non-congestion-controlled packets originating in a sending server and intended for a receiving server are encapsulated in the sending server and transmitted through a virtual circuit having a message transport protocol with rate control. The packets are decapsulated in the receiving server.

Abstract translation: 在数据中心管理非拥塞控制消息流量。 源于发送服务器并且用于接收服务器的任何非拥塞控制的分组封装在发送服务器中，并通过具有速率控制的消息传输协议的虚拟电路传输。 数据包在接收服务器中解封装。

公开(公告)号：US20130054869A1

公开(公告)日：2013-02-28

申请号：US13222919

申请日：2011-08-31

Applicant: Niraj Tolia ,  Nathan Lorenzo Binkert ,  Jichuan Chang

Inventor： Niraj Tolia ,  Nathan Lorenzo Binkert ,  Jichuan Chang

IPC: G06F12/02 ,  G06F12/08

CPC classification number: G06F12/0871 ,  G06F11/14 ,  G06F17/30 ,  G06F17/30321 ,  G06F2212/264

Abstract: Example methods, apparatus, and articles of manufacture to access data are disclosed. A disclosed example method involves generating a key-value association table in a non-volatile memory to store physical addresses of a data cache storing data previously retrieved from a data structure. The example method also involves storing recovery metadata in the non-volatile memory. The recovery metadata includes a first address of the key-value association table in the non-volatile memory. In addition, following a re-boot process, the locations of the key-value association table and the data cache are retrieved using the recovery metadata without needing to access the data structure to re-generate the key-value association table and the data cache.

Abstract translation: 公开了用于访问数据的示例性方法，装置和制品。 所公开的示例性方法涉及在非易失性存储器中生成密钥值关联表，以存储先前从数据结构检索的数据的数据高速缓存的物理地址。 该示例方法还涉及将恢复元数据存储在非易失性存储器中。 恢复元数据包括非易失性存储器中的键值关联表的第一地址。 另外，在重新启动过程之后，使用恢复元数据检索密钥值关联表和数据高速缓存的位置，而不需要访问数据结构以重新生成密钥值关联表和数据缓存 。

公开(公告)号：US20120096052A1

公开(公告)日：2012-04-19

申请号：US12906334

申请日：2010-10-18

Applicant: Niraj TOLIA ,  Nathan BINKERT ,  Yoshio TURNER ,  Jichuan CHANG

Inventor： Niraj TOLIA ,  Nathan BINKERT ,  Yoshio TURNER ,  Jichuan CHANG

IPC: G06F17/30

CPC classification number: G06F17/30303 ,  G06F11/1435 ,  G06F17/30

Abstract: In a method for managing a data structure in a memory, an accessor to access a version of the data structure is determined, in which the accessor includes a version number and a fat pointer, in which the version number corresponds to the most recent version of the data structure, and wherein the fat pointer is configured to enable for multiple versions of a linked-data structure to be maintained.

Abstract translation: 在用于管理存储器中的数据结构的方法中，确定访问数据结构版本的访问器，其中访问者包括版本号和胖指针，其中版本号对应于最新版本的 所述数据结构，并且其中所述胖指针被配置为能够维持链接数据结构的多个版本。

公开(公告)号：US20110302286A1

公开(公告)日：2011-12-08

申请号：US12792400

申请日：2010-06-02

Applicant: Luca Parolini ,  Niraj Tolia ,  Bruno Sinopoli ,  Bruce Krogh

Inventor： Luca Parolini ,  Niraj Tolia ,  Bruno Sinopoli ,  Bruce Krogh

IPC: G06F15/173

CPC classification number: G06F9/5094 ,  Y02D10/22

Abstract: A system for managing computing nodes and cooling devices cooling the computing nodes in an infrastructure includes one or more managers. The one or more managers receive a service request for a workload to be run on one or more of the computing nodes. Candidate workload placements for placing the workload on the one or more computing nodes are determined. A first cost associated with each candidate workload placements using a computational network model. A second cost associated with the cooling devices for each candidate workload placement is determined using a thermal network model. A cost function is minimized. The cost function determines an economic cost of operating the infrastructure while running the requested workload and is based upon the first cost, the second cost. A candidate workload placement is selected from the candidate workload placements based on the minimized cost function.

Abstract translation: 用于管理计算节点和冷却设备的系统用于冷却基础设施中的计算节点包括一个或多个管理器。 一个或多个管理器接收在一个或多个计算节点上运行的工作负载的服务请求。 确定将工作负载放置在一个或多个计算节点上的候选工作负载布局。 使用计算网络模型与每个候选工作量布局相关联的第一个成本。 使用热网络模型确定与用于每个候选工作负载布局的冷却装置相关联的第二成本。 成本函数最小化。 成本函数确定在运行所请求的工作量时运行基础设施的经济成本，并基于第一个成本，第二个成本。 基于最小化成本函数，从候选工作负载布局中选择候选工作负载布局。

公开(公告)号：US08812166B2

公开(公告)日：2014-08-19

申请号：US12581990

申请日：2009-10-20

Applicant: Zhikui Wang ,  Cullen E. Bash ,  Niraj Tolia ,  Manish Marwah ,  Parthasarathy Ranganathan ,  Shailesh N Joshi ,  Andrew James Phelan

Inventor： Zhikui Wang ,  Cullen E. Bash ,  Niraj Tolia ,  Manish Marwah ,  Parthasarathy Ranganathan ,  Shailesh N Joshi ,  Andrew James Phelan

IPC: G05B13/04 ,  G06F1/28 ,  G06F17/11 ,  G06F9/50

CPC classification number: G06F9/5011 ,  G05B13/04 ,  G06F9/5094 ,  Y02D10/22

Abstract: In a method for supplying a resource to an entity from a resource actuator, a plurality of physics-based models pertaining to the resource actuator and the entity are developed, a condition detected at the entity is received, feedback control on a resource demand of the entity employed based upon the detected condition, feed forward control on the resource demand of the entity is employed based upon the detected condition and the plurality of physics-based models, a constraint optimization problem having an objective function and at least one constraint using the plurality of physics-based models is formulated, a solution to the constraint optimization problem is determined, in which the solution provides the actuator setting, and the resource actuator is set to the actuator setting to supply the entity with the resource from the resource actuator.

Abstract translation: 在从资源执行器向实体提供资源的方法中，开发了与资源执行器和实体有关的多个基于物理的模型，接收到在实体处检测到的条件，对资源请求的反馈控制 基于检测到的条件采用的实体，基于检测到的条件和多个基于物理的模型，采用具有目标函数的约束优化问题和使用多个的基于物理的模型的至少一个约束，对实体的资源需求进行前馈控制 制定基于物理的模型，确定约束优化问题的解决方案，其中解决方案提供致动器设置，并且资源致动器被设置为致动器设置，以向资源提供来自资源执行器的资源。

公开(公告)号：US08539059B2

公开(公告)日：2013-09-17

申请号：US12792400

申请日：2010-06-02

Applicant: Luca Parolini ,  Niraj Tolia ,  Bruno Sinopoli ,  Bruce Krogh

Inventor： Luca Parolini ,  Niraj Tolia ,  Bruno Sinopoli ,  Bruce Krogh

IPC: G06F15/173

CPC classification number: G06F9/5094 ,  Y02D10/22

Abstract: A system for managing computing nodes and cooling devices cooling the computing nodes in an infrastructure includes one or more managers. The one or more managers receive a service request for a workload to be run on one or more of the computing nodes. Candidate workload placements for placing the workload on the one or more computing nodes are determined. A first cost associated with each candidate workload placements using a computational network model. A second cost associated with the cooling devices for each candidate workload placement is determined using a thermal network model. A cost function is minimized. The cost function determines an economic cost of operating the infrastructure while running the requested workload and is based upon the first cost, the second cost. A candidate workload placement is selected from the candidate workload placements based on the minimized cost function.

Abstract translation: 用于管理计算节点和冷却设备的系统用于冷却基础设施中的计算节点包括一个或多个管理器。 一个或多个管理器接收在一个或多个计算节点上运行的工作负载的服务请求。 确定将工作负载放置在一个或多个计算节点上的候选工作负载布局。 使用计算网络模型与每个候选工作量布局相关联的第一个成本。 使用热网络模型确定与用于每个候选工作负载布局的冷却装置相关联的第二成本。 成本函数最小化。 成本函数确定在运行所请求的工作量时运行基础设施的经济成本，并基于第一个成本，第二个成本。 基于最小化成本函数，从候选工作负载布局中选择候选工作负载布局。

公开(公告)号：US20130091331A1

公开(公告)日：2013-04-11

申请号：US13270785

申请日：2011-10-11

Applicant: Iulian Moraru ,  Niraj Tolia ,  Nathan Lorenzo Binkert

Inventor： Iulian Moraru ,  Niraj Tolia ,  Nathan Lorenzo Binkert

IPC: G06F12/08

CPC classification number: G06F12/126

Abstract: Methods, apparatus, and articles of manufacture to manage memory are disclosed. An example method includes mapping a cache memory to a random access memory, incrementing a counter in response to a data write to a cache line of the cache memory, decrementing the counter in response to a write-back of the data from the cache line, and committing the data to the RAM when the counter is equal to a threshold.

Abstract translation: 公开了用于管理存储器的方法，装置和制品。 示例性方法包括将高速缓冲存储器映射到随机存取存储器，响应于对高速缓冲存储器的高速缓存行的数据写入而递增计数器，响应于来自高速缓存行的数据的写回来递减计数器， 并且当计数器等于阈值时将数据提交给RAM。

公开(公告)号：US20110010721A1

公开(公告)日：2011-01-13

申请号：US12502074

申请日：2009-07-13

Applicant: Vishakha Gupta ,  Niraj Tolia ,  Vanish Talwar ,  Partha Ranganathan

Inventor： Vishakha Gupta ,  Niraj Tolia ,  Vanish Talwar ,  Partha Ranganathan

IPC: G06F9/46 ,  G06F9/455

CPC classification number: G06F9/5077 ,  G06F9/455

Abstract: A system and method is shown that includes an admission control module that resides in a management/driver domain, the admission control module to admit a domain that is part of a plurality of domains, into the computer system based upon one of a plurality of accelerators satisfying a resource request of the domain. The system and method also includes a load balancer module, which resides in the management/driver domain, the load balancer to balance at least one load from the plurality of domains across the plurality of accelerators. Further, the system and method also includes a scheduler module that resides in the management/driver domain, the scheduler to multiplex multiple requests from the plurality of domains to one of the plurality of accelerators.

Abstract translation: 示出了一种系统和方法，其包括驻留在管理/驱动器域中的准入控制模块，所述准入控制模块基于多个加速器中的一个加速器，所述准入控制模块将许可为多个域的一部分的域接纳到所述计算机系统中 满足域的资源请求。 系统和方法还包括位于管理/驱动器域中的负载平衡器模块，负载平衡器以平衡来自多个加速器中的多个域的至少一个负载。 此外，系统和方法还包括驻留在管理/驱动器域中的调度器模块，调度器将来自多个域的多个请求复用到多个加速器中的一个。

公开(公告)号：US20170369864A1

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

申请号：US15633254

申请日：2017-06-26

Applicant: Niraj Tolia ,  Gautam Dantas ,  Timothy Wencewicz ,  Jooyoung Park ,  Andrew Gasparrini ,  Kevin Forsberg ,  Joseph Vogel ,  Margaret Ruth Reck ,  Chanez Tiffany Symister ,  Jana L. Markley

Inventor： Niraj Tolia ,  Gautam Dantas ,  Timothy Wencewicz ,  Jooyoung Park ,  Andrew Gasparrini ,  Kevin Forsberg ,  Joseph Vogel ,  Margaret Ruth Reck ,  Chanez Tiffany Symister ,  Jana L. Markley

IPC: C12N9/99 ,  C12Q1/04 ,  A61K39/40 ,  A61K38/00 ,  A61K31/65 ,  A61K47/00 ,  C12N9/00

CPC classification number: C12N9/99 ,  A61K31/65 ,  A61K38/005 ,  A61K39/40 ,  A61K47/00 ,  A61K47/6809 ,  C12N9/00 ,  C12Q1/04 ,  Y02A50/478

Abstract: The present disclosure provides compositions and methods for treating bacterial infections in a subject. The methods comprise administering a compound that binds a FAD-dependent flavoenzyme and a tetracycline, analog, derivative, or pharmaceutically acceptable salt thereof.

公开(公告)号：US08762425B2

公开(公告)日：2014-06-24

申请号：US12906334

申请日：2010-10-18

Applicant: Niraj Tolia ,  Nathan Binkert ,  Yoshio Turner ,  Jichuan Chang

Inventor： Niraj Tolia ,  Nathan Binkert ,  Yoshio Turner ,  Jichuan Chang

IPC: G06F7/00 ,  G06F17/30 ,  G06F13/00 ,  G06F13/28

CPC classification number: G06F17/30303 ,  G06F11/1435 ,  G06F17/30

Abstract: In a method for managing a data structure in a memory, an accessor to access a version of the data structure is determined, in which the accessor includes a version number and a fat pointer, in which the version number corresponds to the most recent version of the data structure, and wherein the fat pointer is configured to enable for multiple versions of a linked-data structure to be maintained.

Abstract translation: 在用于管理存储器中的数据结构的方法中，确定访问数据结构版本的访问器，其中存取器包括版本号和胖指针，其中版本号对应于最新版本的 所述数据结构，并且其中所述胖指针被配置为能够维持链接数据结构的多个版本。