-
公开(公告)号：US08447772B2
公开(公告)日：2013-05-21
申请号：US12821453
申请日：2010-06-23
申请人： Lynnette E. Carston , Samuel J. Miller , Gary E. Rohret , Jeffrey W. Tenner , Alwood P. Williams, III
发明人： Lynnette E. Carston , Samuel J. Miller , Gary E. Rohret , Jeffrey W. Tenner , Alwood P. Williams, III
IPC分类号： G06F7/00
CPC分类号： G06F17/30463
摘要： Embodiments of the invention provide a method of optimizing a query, including determining an execution plan for use in executing the query, based on a monetary cost of the energy needed to execute the query. A query optimization component may determine a plurality of execution plans for the query. The query optimization component may then select one of the plans to use in executing the query based on the monetary cost calculated for the plan.
摘要翻译： 本发明的实施例提供一种优化查询的方法，包括基于执行查询所需的能量的货币成本确定用于执行查询的执行计划。 查询优化组件可以确定查询的多个执行计划。 然后，查询优化组件可以基于为该计划计算的货币成本，选择用于执行查询的计划之一。
-
公开(公告)号：US20130263138A1
公开(公告)日：2013-10-03
申请号：US13431248
申请日：2012-03-27
IPC分类号： G06F9/46
CPC分类号： G06F9/5072 , G06F2209/549
摘要： Collectively loading an application in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: identifying, by a parallel computer control system, a subset of compute nodes in the parallel computer to execute a job; selecting, by the parallel computer control system, one of the subset of compute nodes in the parallel computer as a job leader compute node; retrieving, by the job leader compute node from computer memory, an application for executing the job; and broadcasting, by the job leader to the subset of compute nodes in the parallel computer, the application for executing the job.
摘要翻译： 在并行计算机中集体加载应用程序，并行计算机包括多个计算节点，包括：通过并行计算机控制系统识别并行计算机中的计算节点的子集以执行作业; 由并行计算机控制系统选择并行计算机中的计算节点子集之一作为工作领导计算节点; 由作业领导计算节点从计算机存储器检索用于执行作业的应用程序; 并且由作业领导者将并行计算机中的计算节点的子集广播为执行作业的应用程序。
-
3.发明授权Resource management on a computer system utilizing hardware and environmental factors 失效利用硬件和环境因素对计算机系统进行资源管理公开(公告)号：US08225324B2
公开(公告)日：2012-07-17
申请号：US12121096
申请日：2008-05-15
IPC分类号： G06F9/46
CPC分类号： G06F9/5027 , G06F9/5094 , Y02D10/22
摘要： A method for resource management on a computer system utilizing hardware and environmental information. A caller interacts with an application program interface to handle information requests with a persistent data storage device to combine information involving hardware resource information, environmental data and other system information, all both historical, present and predicted values. Application execution decisions may then made regarding hardware for the calling entity. The method may be implemented as a computer process.
摘要翻译： 一种利用硬件和环境信息的计算机系统上的资源管理方法。 呼叫者与应用程序接口交互以利用持久性数据存储设备处理信息请求，以组合涉及硬件资源信息，环境数据和其他系统信息的信息，所有这些信息都包括历史，现在和预测值。 然后可以对呼叫实体的硬件进行应用执行决定。 该方法可以被实现为计算机进程。
-
4.发明授权Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job 有权将连接的节点动态地重新分配到一个计算节点块，以重新启动失败的作业公开(公告)号：US08140889B2
公开(公告)日：2012-03-20
申请号：US12861426
申请日：2010-08-23
申请人： Thomas A. Budnik , Brant L. Knudson , Mark G. Megerian , Samuel J. Miller , William M. Stockdell
发明人： Thomas A. Budnik , Brant L. Knudson , Mark G. Megerian , Samuel J. Miller , William M. Stockdell
IPC分类号： G06F11/00
CPC分类号： G06F11/2035 , G06F11/203
摘要： Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of compute nodes running the re-launched job.
摘要翻译： 方法，系统和产品用于动态重新分配连接的节点到计算节点块以重新启动失败的作业，包括：识别作业在计算节点块上执行失败，因为在分配为 至少一个用于计算节点块的连接节点及其支持的I / O节点; 并且重新启动该作业，包括选择主动耦合以与活动I / O节点进行数据通信的备选连接节点; 并且将替代连接的节点分配为用于运行重新启动的作业的计算节点的块的连接节点。
-
5.发明申请Resource Management on a Computer System Utilizing Hardware and Environmental Factors 失效计算机系统资源管理利用硬件和环境因素公开(公告)号：US20090288094A1
公开(公告)日：2009-11-19
申请号：US12121096
申请日：2008-05-15
IPC分类号： G06F9/46
CPC分类号： G06F9/5027 , G06F9/5094 , Y02D10/22
摘要： A method for resource management on a computer system utilizing hardware and environmental information. A caller interacts with an application program interface to handle information requests with a persistent data storage device to combine information involving hardware resource information, environmental data and other system information, all both historical, present and predicted values. Application execution decisions may then made regarding hardware for the calling entity. The method may be implemented as a computer process.
摘要翻译： 一种利用硬件和环境信息的计算机系统上的资源管理方法。 呼叫者与应用程序接口交互以利用持久性数据存储设备处理信息请求，以组合涉及硬件资源信息，环境数据和其他系统信息的信息，所有这些信息都包括历史，现在和预测值。 然后可以对呼叫实体的硬件进行应用执行决定。 该方法可以被实现为计算机进程。
-
公开(公告)号：US20090288085A1
公开(公告)日：2009-11-19
申请号：US12121262
申请日：2008-05-15
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/3887 , G06F2209/483
摘要： A method, computer program product and computer system for scaling and managing requests on a massively parallel machine, such as one running in MIMD mode on a SIMD machine. A submit mux (multiplexer) is used to federate work requests and to forward the requests to the management node. A resource arbiter receives and manges these work requests. A MIMD job controller works with the resource arbiter to manage the work requests on the SIMD partition. The SIMD partition may utilize a mux of its own to federate the work requests and the computer nodes. Instructions are also provided to control and monitor the work requests.
摘要翻译： 一种用于在大型并行机器上缩放和管理请求的方法，计算机程序产品和计算机系统，例如在SIMD机器上以MIMD模式运行的请求。 提交多路复用器（Multiplexux）用于联合工作请求并将请求转发到管理节点。 资源仲裁者接收并管理这些工作请求。 MIMD作业控制器与资源仲裁器配合使用以管理SIMD分区上的工作请求。 SIMD分区可以利用其自己的多路复用器来联合工作请求和计算机节点。 还提供说明以控制和监视工作请求。
-
公开(公告)号：US09081501B2
公开(公告)日：2015-07-14
申请号：US13004007
申请日：2011-01-10
申请人： Sameh Asaad , Ralph E. Bellofatto , Michael A. Blocksome , Matthias A. Blumrich , Peter Boyle , Jose R. Brunheroto , Dong Chen , Chen-Yong Cher , George L. Chiu , Norman Christ , Paul W. Coteus , Kristan D. Davis , Gabor J. Dozsa , Alexandre E. Eichenberger , Noel A. Eisley , Matthew R. Ellavsky , Kahn C. Evans , Bruce M. Fleischer , Thomas W. Fox , Alan Gara , Mark E. Giampapa , Thomas M. Gooding , Michael K. Gschwind , John A. Gunnels , Shawn A. Hall , Rudolf A. Haring , Philip Heidelberger , Todd A. Inglett , Brant L. Knudson , Gerard V. Kopcsay , Sameer Kumar , Amith R. Mamidala , James A. Marcella , Mark G. Megerian , Douglas R. Miller , Samuel J. Miller , Adam J. Muff , Michael B. Mundy , John K. O'Brien , Kathryn M. O'Brien , Martin Ohmacht , Jeffrey J. Parker , Ruth J. Poole , Joseph D. Ratterman , Valentina Salapura , David L. Satterfield , Robert M. Senger , Brian Smith , Burkhard Steinmacher-Burow , William M. Stockdell , Craig B. Stunkel , Krishnan Sugavanam , Yutaka Sugawara , Todd E. Takken , Barry M. Trager , James L. Van Oosten , Charles D. Wait , Robert E. Walkup , Alfred T. Watson , Robert W. Wisniewski , Peng Wu
发明人： Sameh Asaad , Ralph E. Bellofatto , Michael A. Blocksome , Matthias A. Blumrich , Peter Boyle , Jose R. Brunheroto , Dong Chen , Chen-Yong Cher , George L. Chiu , Norman Christ , Paul W. Coteus , Kristan D. Davis , Gabor J. Dozsa , Alexandre E. Eichenberger , Noel A. Eisley , Matthew R. Ellavsky , Kahn C. Evans , Bruce M. Fleischer , Thomas W. Fox , Alan Gara , Mark E. Giampapa , Thomas M. Gooding , Michael K. Gschwind , John A. Gunnels , Shawn A. Hall , Rudolf A. Haring , Philip Heidelberger , Todd A. Inglett , Brant L. Knudson , Gerard V. Kopcsay , Sameer Kumar , Amith R. Mamidala , James A. Marcella , Mark G. Megerian , Douglas R. Miller , Samuel J. Miller , Adam J. Muff , Michael B. Mundy , John K. O'Brien , Kathryn M. O'Brien , Martin Ohmacht , Jeffrey J. Parker , Ruth J. Poole , Joseph D. Ratterman , Valentina Salapura , David L. Satterfield , Robert M. Senger , Brian Smith , Burkhard Steinmacher-Burow , William M. Stockdell , Craig B. Stunkel , Krishnan Sugavanam , Yutaka Sugawara , Todd E. Takken , Barry M. Trager , James L. Van Oosten , Charles D. Wait , Robert E. Walkup , Alfred T. Watson , Robert W. Wisniewski , Peng Wu
IPC分类号： G06F15/173 , G06F9/06 , G06F15/76
CPC分类号： G06F13/287 , G06F9/06 , G06F9/3004 , G06F9/30047 , G06F9/3885 , G06F12/0811 , G06F12/0831 , G06F12/0862 , G06F12/0864 , G06F12/1027 , G06F15/17381 , G06F15/17387 , G06F15/76 , G06F15/8069 , G06F2212/1016 , G06F2212/602 , G06F2212/6022 , G06F2212/6024 , G06F2212/6032 , Y02D10/13 , Y02D10/14
摘要： A Multi-Petascale Highly Efficient Parallel Supercomputer of 100 petaOPS-scale computing, at decreased cost, power and footprint, and that allows for a maximum packaging density of processing nodes from an interconnect point of view. The Supercomputer exploits technological advances in VLSI that enables a computing model where many processors can be integrated into a single Application Specific Integrated Circuit (ASIC). Each ASIC computing node comprises a system-on-chip ASIC utilizing four or more processors integrated into one die, with each having full access to all system resources and enabling adaptive partitioning of the processors to functions such as compute or messaging I/O on an application by application basis, and preferably, enable adaptive partitioning of functions in accordance with various algorithmic phases within an application, or if I/O or other processors are underutilized, then can participate in computation or communication nodes are interconnected by a five dimensional torus network with DMA that optimally maximize the throughput of packet communications between nodes and minimize latency.
摘要翻译： 具有100 petaOPS规模计算的多Petascale高效并行超级计算机，其成本，功耗和占地面积都在降低，并且允许从互连角度来看处理节点的最大封装密度。 超级计算机利用了VLSI的技术进步，实现了许多处理器可以集成到单个专用集成电路（ASIC）中的计算模型。 每个ASIC计算节点包括利用集成到一个管芯中的四个或更多个处理器的片上系统ASIC，每个处理器具有对所有系统资源的完全访问，并且使得处理器能够对诸如计算或消息传递I / O 并且优选地，根据应用内的各种算法阶段实现功能的自适应分割，或者如果I / O或其他处理器未被充分利用，则可以参与计算或通信节点通过五维环面网络互连 使用DMA来最大限度地最大化节点之间的分组通信的吞吐量并最小化等待时间。
-
公开(公告)号：US08918624B2
公开(公告)日：2014-12-23
申请号：US12121262
申请日：2008-05-15
CPC分类号： G06F9/4881 , G06F9/3887 , G06F2209/483
摘要： A method, computer program product and computer system for scaling and managing requests on a massively parallel machine, such as one running in MIMD mode on a SIMD machine. A submit mux (multiplexer) is used to federate work requests and to forward the requests to the management node. A resource arbiter receives and manges these work requests. A MIMD job controller works with the resource arbiter to manage the work requests on the SIMD partition. The SIMD partition may utilize a mux of its own to federate the work requests and the computer nodes. Instructions are also provided to control and monitor the work requests.
摘要翻译： 一种用于在大型并行机器上缩放和管理请求的方法，计算机程序产品和计算机系统，例如在SIMD机器上以MIMD模式运行的请求。 提交多路复用器（Multiplexux）用于联合工作请求并将请求转发到管理节点。 资源仲裁器接收并管理这些工作请求。 MIMD作业控制器与资源仲裁器配合使用以管理SIMD分区上的工作请求。 SIMD分区可以利用其自己的多路复用器来联合工作请求和计算机节点。 还提供说明以控制和监视工作请求。
-
9.发明申请DYNAMICALLY REASSIGNING A CONNECTED NODE TO A BLOCK OF COMPUTE NODES FOR RE-LAUNCHING A FAILED JOB 有权将连接的节点动态地重新连接到重新启动失败作业的电脑节目块公开(公告)号：US20120047393A1
公开(公告)日：2012-02-23
申请号：US12861426
申请日：2010-08-23
申请人： Thomas A. Budnik , Brant L. Knudson , Mark G. Megerian , Samuel J. Miller , William M. Stockdell
发明人： Thomas A. Budnik , Brant L. Knudson , Mark G. Megerian , Samuel J. Miller , William M. Stockdell
IPC分类号： G06F11/20
CPC分类号： G06F11/2035 , G06F11/203
摘要： Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of compute nodes running the re-launched job.
摘要翻译： 方法，系统和产品用于动态重新分配连接的节点到计算节点块以重新启动失败的作业，包括：识别作业在计算节点块上执行失败，因为在分配为 至少一个用于计算节点块的连接节点及其支持的I / O节点; 并且重新启动该作业，包括选择主动耦合以与活动I / O节点进行数据通信的备选连接节点; 并且将替代连接的节点分配为用于运行重新启动的作业的计算节点的块的连接节点。
-
公开(公告)号：US09229782B2
公开(公告)日：2016-01-05
申请号：US13431248
申请日：2012-03-27
CPC分类号： G06F9/5072 , G06F2209/549
摘要： Collectively loading an application in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: identifying, by a parallel computer control system, a subset of compute nodes in the parallel computer to execute a job; selecting, by the parallel computer control system, one of the subset of compute nodes in the parallel computer as a job leader compute node; retrieving, by the job leader compute node from computer memory, an application for executing the job; and broadcasting, by the job leader to the subset of compute nodes in the parallel computer, the application for executing the job.
摘要翻译： 在并行计算机中集体加载应用程序，并行计算机包括多个计算节点，包括：通过并行计算机控制系统识别并行计算机中的计算节点的子集以执行作业; 由并行计算机控制系统选择并行计算机中的计算节点子集之一作为工作领导计算节点; 由作业领导计算节点从计算机存储器检索用于执行作业的应用程序; 并且由作业领导者将并行计算机中的计算节点的子集广播为执行作业的应用程序。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.043 秒)
