专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08381212B2 Dynamic allocation and partitioning of compute nodes in hierarchical job scheduling 失效
标题翻译：分层作业调度中计算节点的动态分配和划分
公开(公告)号：US08381212B2
公开(公告)日：2013-02-19
申请号：US11869133
申请日：2007-10-09
申请人： David P. Brelsford , Waiman Chan , Stephen C. Hughes , Kailash N. Marthi , Ravindra R. Sure
发明人： David P. Brelsford , Waiman Chan , Stephen C. Hughes , Kailash N. Marthi , Ravindra R. Sure
IPC分类号： G06F9/50 , G06F15/16 , G06F15/173
CPC分类号： G06F9/4843
摘要： The present invention employs a master node for each job to be scheduled and in turn the master node distributes job start information and executable tasks to a plurality of nodes configured in a hierarchical node tree of a multinode job scheduling system. The status of the various tasks executing at the leaf nodes and other nodes of the tree report status back up the same hierarchical tree structure used to start the job, not to a scheduling agent but rather to the master node which has been established by the scheduling agent as the focal point, not only for job starting, but also for the reporting of status information from the leaf and other nodes in the tree.
摘要翻译：本发明对待调度的每个作业采用主节点，主节点又将作业开始信息和可执行任务分配到多节点作业调度系统的分层节点树中配置的多个节点。在叶节点和树节点的其他节点执行的各种任务的状态报告状态备份用于启动作业的相同分层树结构，而不是调度代理，而是备份已经由调度建立的主节点代理人作为焦点，不仅用于作业启动，而且用于从树中的叶和其他节点报告状态信息。

2. 发明申请

US20090094605A1 METHOD, SYSTEM AND PROGRAM PRODUCTS FOR A DYNAMIC, HIERARCHICAL REPORTING FRAMEWORK IN A NETWORK JOB SCHEDULER 失效
标题翻译：网络工作时间表中动态，分层报告框架的方法，系统和程序产品
公开(公告)号：US20090094605A1
公开(公告)日：2009-04-09
申请号：US11869133
申请日：2007-10-09
申请人： David P. Brelsford , Waiman Chan , Stephen C. Hughes , Kailash N. Marthi , Ravindra R. Sure
发明人： David P. Brelsford , Waiman Chan , Stephen C. Hughes , Kailash N. Marthi , Ravindra R. Sure
IPC分类号： G06F9/46
CPC分类号： G06F9/4843
摘要： The present invention employs a master node for each job to be scheduled and in turn the master node distributes job start information and executable tasks to a plurality of nodes configured in a hierarchical node tree of a multinode job scheduling system. The status of the various tasks executing at the leaf nodes and other nodes of the tree report status back up the same hierarchical tree structure used to start the job, not to a scheduling agent but rather to the master node which has been established by the scheduling agent as the focal point, not only for job starting, but also for the reporting of status information from the leaf and other nodes in the tree.
摘要翻译：本发明对待调度的每个作业采用主节点，主节点又将作业开始信息和可执行任务分配到多节点作业调度系统的分层节点树中配置的多个节点。在叶节点和树节点的其他节点执行的各种任务的状态报告状态备份用于启动作业的相同分层树结构，而不是调度代理，而是备份已经由调度建立的主节点代理人作为焦点，不仅用于作业启动，而且用于从树中的叶和其他节点报告状态信息。

3. 发明授权

US07987467B2 Scale across in a grid computing environment 有权
标题翻译：在网格计算环境中跨越
公开(公告)号：US07987467B2
公开(公告)日：2011-07-26
申请号：US11734955
申请日：2007-04-13
申请人： Waiman Chan , Rama K. Govindaraju , Joseph F. Skovira
发明人： Waiman Chan , Rama K. Govindaraju , Joseph F. Skovira
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： H04L67/1008 , H04L67/1002 , H04L67/1029
摘要： A method, grid computing environment, and computer readable medium for managing available resources in a grid computing environment are disclosed. The method includes determining, when a new job is submitted, if a first of the computing clusters has sufficient available resources to run the new job. If the first computing cluster does not have sufficient available resources to run the new job, the method further includes determining if a second of the computing clusters has sufficient available resources to run a first job that is currently running on the first computing cluster. If the second computing cluster has sufficient available resources to run the first job, the first job is migrated to the second computing cluster.
摘要翻译：公开了一种用于管理网格计算环境中的可用资源的方法，网格计算环境和计算机可读介质。该方法包括确定何时提交新作业，如果第一计算集群具有足够的可用资源来运行新作业。如果第一计算集群没有足够的可用资源来运行新作业，则该方法还包括确定计算集群中的第二计算集群是否具有足够的可用资源来运行当前在第一计算集群上运行的第一作业。如果第二计算集群具有足够的可用资源来运行第一作业，则将第一作业迁移到第二计算集群。

4. 发明授权

US09723070B2 System to improve cluster machine processing and associated methods 有权
公开(公告)号：US09723070B2
公开(公告)日：2017-08-01
申请号：US12023584
申请日：2008-01-31
申请人： David Paul Brelsford , Waiman Chan , Alexander Druyan , Joseph F. Skovira
发明人： David Paul Brelsford , Waiman Chan , Alexander Druyan , Joseph F. Skovira
IPC分类号： H04L29/08 , G06F9/50
CPC分类号： H04L67/1008 , G06F9/505 , G06F9/5066 , G06F9/5072 , H04L67/1002
摘要： A system to improve cluster machine processing that may include a plurality of interconnected computers that process data as one if necessary, and at least one other plurality of interconnected computers that process data as one if necessary. The system may also include a central manager to control what data processing is performed on a shared processing job performed by the plurality of interconnected computers and the at least one other plurality of interconnected computers. Each of the plurality of interconnected computers runs parallel jobs scheduled by a local backfill scheduler. In order to schedule a cluster spanning parallel job, the local schedulers cooperate on placement and timing of the cluster spanning job, using existing backfill rules in order not to disturb the local job streams.

5. 发明授权

US08458712B2 System and method for multi-level preemption scheduling in high performance processing 有权
标题翻译：高性能处理中多级抢占调度的系统和方法
公开(公告)号：US08458712B2
公开(公告)日：2013-06-04
申请号：US12112462
申请日：2008-04-30
申请人： Waiman Chan , Joseph F. Skovira
发明人： Waiman Chan , Joseph F. Skovira
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/483
摘要： A computing system configured to handle preemption events in an environment having jobs with high and low priorities. The system includes a job queue configured to receive job requests from users, the job queue storing the jobs in an order based on the priority of the jobs, and indicating whether a job is a high priority job or a low priority job. The system also includes a plurality of node clusters, each node cluster including a plurality of nodes and a scheduler coupled to the job queue and to the plurality of node clusters and configured to assign jobs from the job queue to the plurality of node clusters. The scheduler is configured to preempt a first low priority job running in a first node cluster with a high priority job that appears in the job queue after the low priority job has started and, in the event that a second low priority job from the job queue may run on a portion of the plurality of nodes in the first node cluster during a remaining processing time for the high priority job, backfill the second low priority job into the portion of the plurality of nodes and, in the event a second high priority job is received in the job queue and may run on the portion of the plurality of nodes, return the second low priority job to the job queue.
摘要翻译：一种计算系统，被配置为在具有高优先级和低优先级的作业的环境中处理抢占事件。该系统包括配置成从用户接收作业请求的作业队列，作业队列基于作业的优先级顺序存储作业，以及指示作业是高优先级作业还是低优先级作业。该系统还包括多个节点群集，每个节点群集包括多个节点，以及调度器，其耦合到作业队列和多个节点群集，并且被配置为将作业从作业队列分配给多个节点群集。所述调度器被配置为在所述低优先级作业已经开始之后抢占在所述作业队列中出现的高优先级作业的第一节点群集中运行的第一低优先级作业，并且如果来自所述作业队列的第二低优先级作业在高优先级作业的剩余处理时间期间，可以在第一节点簇中的多个节点的一部分上运行，将第二低优先级作业回填到多个节点的部分中，并且在第二高优先级作业被接收在作业队列中并且可以在多个节点的部分上运行，将第二低优先级作业返回到作业队列。

6. 发明授权

US07926057B2 Scheduling of computer jobs employing dynamically determined top job party 失效
标题翻译：使用动态确定的顶级工作组安排计算机作业
公开(公告)号：US07926057B2
公开(公告)日：2011-04-12
申请号：US11304876
申请日：2005-12-15
申请人： Waiman Chan , Joseph F. Skovira
发明人： Waiman Chan , Joseph F. Skovira
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/483
摘要： A facility is presented for scheduling computer jobs of a computing environment having a plurality of computing nodes. The facility includes scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧2, and the number of jobs in the top job party is dynamically determined by monitoring backfill window coverage of the computing nodes by the N scheduled jobs and automatically closing membership in the top job party once (i) all computing nodes are covered by at least one backfill window, or (ii) a backfill end time of at least one computing node is greater than or equal to a maximum wallclock limit of a set of job classes having the N scheduled jobs. Responsive to determining the top job party, the facility then backfill schedules jobs of the job queue around the top job party for execution.
摘要翻译：呈现用于调度具有多个计算节点的计算环境的计算机作业的设施。该设施包括调度作业队列的N个连续计算机作业，直到达到顶级作业方，其中N≥2，并且通过N调度来监视计算节点的补余窗口覆盖来动态地确定最高作业方中的作业数量（i）所有计算节点被至少一个补余窗口覆盖，或者（ii）至少一个计算节点的回填结束时间大于或等于最大壁钟限制的一组具有N个预定工作的工作类。响应于确定最佳工作方，设施将回填工作排队周围的工作排队作业，以执行。

7. 发明申请

US20080256223A1 SCALE ACROSS IN A GRID COMPUTING ENVIRONMENT 有权
标题翻译：全球计算环境中的规模
公开(公告)号：US20080256223A1
公开(公告)日：2008-10-16
申请号：US11734955
申请日：2007-04-13
申请人： Waiman Chan , Rama K. Govindaraju , Joseph F. Skovira
发明人： Waiman Chan , Rama K. Govindaraju , Joseph F. Skovira
IPC分类号： G06F15/173
CPC分类号： H04L67/1008 , H04L67/1002 , H04L67/1029
摘要： A method, grid computing environment, and computer readable medium for managing available resources in a grid computing environment are disclosed. The method includes determining, when a new job is submitted, if a first of the computing clusters has sufficient available resources to run the new job. If the first computing cluster does not have sufficient available resources to run the new job, the method further includes determining if a second of the computing clusters has sufficient available resources to run a first job that is currently running on the first computing cluster. If the second computing cluster has sufficient available resources to run the first job, the first job is migrated to the second computing cluster.
摘要翻译：公开了一种用于管理网格计算环境中的可用资源的方法，网格计算环境和计算机可读介质。该方法包括确定何时提交新作业，如果第一计算集群具有足够的可用资源来运行新作业。如果第一计算集群没有足够的可用资源来运行新作业，则该方法还包括确定计算集群中的第二计算集群是否具有足够的可用资源来运行当前在第一计算集群上运行的第一作业。如果第二计算集群具有足够的可用资源来运行第一作业，则将第一作业迁移到第二计算集群。

8. 发明申请

US20070143760A1 Scheduling of computer jobs employing dynamically determined top job party 失效
标题翻译：使用动态确定的顶级工作组安排计算机作业
公开(公告)号：US20070143760A1
公开(公告)日：2007-06-21
申请号：US11304876
申请日：2005-12-15
申请人： Waiman Chan , Joseph Skovira
发明人： Waiman Chan , Joseph Skovira
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/483
摘要： A facility is presented for scheduling computer jobs of a computing environment having a plurality of computing nodes. The facility includes scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧2, and the number of jobs in the top job party is dynamically determined by monitoring backfill window coverage of the computing nodes by the N scheduled jobs and automatically closing membership in the top job party once (i) all computing nodes are covered by at least one backfill window, or (ii) a backfill end time of at least one computing node is greater than or equal to a maximum wallclock limit of a set of job classes having the N scheduled jobs. Responsive to determining the top job party, the facility then backfill schedules jobs of the job queue around the top job party for execution.
摘要翻译：呈现用于调度具有多个计算节点的计算环境的计算机作业的设施。该设施包括调度作业队列的N个连续计算机作业，直到达到顶级作业方，其中N> = 2，并且通过监视N个计算节点的补余窗口覆盖来动态地确定顶层作业方中的作业数量（i）所有计算节点被至少一个补余窗口覆盖，或者（ii）至少一个计算节点的回填结束时间大于或等于最大挂钟时间限制具有N个计划作业的一组工作类。响应于确定最佳工作方，设施将回填工作排队周围的工作排队作业，以执行。

9. 发明授权

US06829765B1 Job scheduling based upon availability of real and/or virtual resources 失效
标题翻译：基于真实资源和/或虚拟资源的可用性进行作业调度
公开(公告)号：US06829765B1
公开(公告)日：2004-12-07
申请号：US09618920
申请日：2000-07-18
申请人： Waiman Chan , Margaret M. Curry
发明人： Waiman Chan , Margaret M. Curry
IPC分类号： G06F900
CPC分类号： G06F9/5016 , G06F9/5027
摘要： A model for computer resources based on type and amount is employed in a consistent manner across several layers in a data processing system as a mechanism for providing users with significantly more control over the allocation, utilization and scheduling of resources for user's software applications running on the target computer system.
摘要翻译：基于类型和数量的计算机资源的模型以数据处理系统中的多个层次的一致方式被采用为用于向用户提供对在用户的软件应用上运行的用户的软件应用的资源的分配，利用和调度的显着更多的控制的机制目标计算机系统。

10. 发明申请

US20100293549A1 System to Improve Cluster Machine Processing and Associated Methods 有权
标题翻译：改进集群机处理和相关方法的系统
公开(公告)号：US20100293549A1
公开(公告)日：2010-11-18
申请号：US12023584
申请日：2008-01-31
申请人： David Paul Brelsford , Waiman Chan , Alexander Druyan , Joseph F. Skovira
发明人： David Paul Brelsford , Waiman Chan , Alexander Druyan , Joseph F. Skovira
IPC分类号： G06F9/46 , G06F15/16
CPC分类号： H04L67/1008 , G06F9/505 , G06F9/5066 , G06F9/5072 , H04L67/1002
摘要： A system to improve cluster machine processing that may include a plurality of interconnected computers that process data as one if necessary, and at least one other plurality of interconnected computers that process data as one if necessary. The system may also include a central manager to control what data processing is performed on a shared processing job performed by the plurality of interconnected computers and the at least one other plurality of interconnected computers. Each of the plurality of interconnected computers runs parallel jobs scheduled by a local backfill scheduler. In order to schedule a cluster spanning parallel job, the local schedulers cooperate on placement and timing of the cluster spanning job, using existing backfill rules in order not to disturb the local job streams.
摘要翻译：一种改进集群机处理的系统，其可以包括如果需要的话处理数据的多个互连的计算机，以及如果需要的话，处理数据的至少一个其他多个互连的计算机。该系统还可以包括中央管理器，用于控制对由多个互连的计算机和至少一个其它多个互连计算机执行的共享处理作业执行什么数据处理。多个互连的计算机中的每一个运行由本地回填调度程序调度的并行作业。为了安排跨越并行作业的集群，本地调度程序使用现有的补余规则来合作进行集群跨越作业的放置和定时，以免干扰本地作业流。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式