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

1. 发明授权

US07844968B1 System for predicting earliest completion time and using static priority having initial priority and static urgency for job scheduling 有权
标题翻译：用于预测最早完成时间的系统，并使用具有初始优先级和静态紧急度的静态优先级用于作业调度
公开(公告)号：US07844968B1
公开(公告)日：2010-11-30
申请号：US11128802
申请日：2005-05-13
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： G06F9/4881
摘要： A method for scheduling jobs in a computing system accounts provides for current and future scheduling according to job priority, and system resources expected to be available during a given time period. Resources may be freed by preempting jobs scheduled to execute according to preemption rules specified for the system. Advance reservation and backfilling are accomplished, maximizing system efficiency.
摘要翻译：用于在计算系统帐户中调度作业的方法根据作业优先级以及期望在给定时间段期间可用的系统资源来提供当前和将来的调度。可以通过根据为系统指定的抢占规则抢占执行的作业来释放资源。提前预订和回填完成，最大限度地提高系统效率。

2. 发明授权

US08214836B1 Method and apparatus for job assignment and scheduling using advance reservation, backfilling, and preemption 有权
标题翻译：使用提前预约，回填和抢占的作业分配和调度的方法和装置
公开(公告)号：US08214836B1
公开(公告)日：2012-07-03
申请号：US11128725
申请日：2005-05-13
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/483 , G06F2209/485
摘要： A method for scheduling computing jobs in a scheduling event. A computing node is identified that is able to satisfy the required resource during a first time period. A second computing job is determined to have previously been scheduled to execute during a second time period, where the second time period overlaps a first time period. Execution of the second computing job is preempted if the first computing job's priority is greater than the second computing job's priority by at least a threshold amount, and if preempting the second job frees the required resource for use by the first computing job. Execution of the first computing job is scheduled to take place on a first computing node during the first time period, where a start time associated with the first time period is a time selected from the group consisting of a current time and a future time.
摘要翻译：一种用于在调度事件中调度计算作业的方法。识别能够在第一时间段期间满足所需资源的计算节点。第二计算作业被确定为先前被调度为在第二时间段内执行，其中第二时间段与第一时间段重叠。如果第一计算作业的优先级大于第二计算作业的优先级至少阈值量，则第二计算作业的执行被抢占，并且如果抢占第二作业释放所需资源供第一计算作业使用。第一计算作业的执行被调度在第一时间段内在第一计算节点上进行，其中与第一时间段相关联的开始时间是从当前时间和未来时间组成的组中选择的时间。

3. 发明授权

US08020161B2 Method and system for the dynamic scheduling of a stream of computing jobs based on priority and trigger threshold 有权
标题翻译：基于优先级和触发阈值的计算任务流的动态调度的方法和系统
公开(公告)号：US08020161B2
公开(公告)日：2011-09-13
申请号：US11520477
申请日：2006-09-12
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/4818 , G06F2209/484
摘要： A method of executing jobs includes obtaining a first plurality of scheduled jobs, setting a first trigger threshold based on at least one of the first plurality of scheduled jobs, executing the first plurality of scheduled jobs, receiving a submitted job during the execution of the first plurality of scheduled jobs, associating the submitted job with a submitted job priority, if the submitted job priority satisfies the first trigger threshold, obtaining a second plurality of scheduled jobs, setting a second trigger threshold based on at least one of the second plurality of scheduled jobs, executing the second plurality of scheduled jobs, and if the submitted job priority does not satisfy the first trigger threshold, continuing execution of the first plurality of jobs.
摘要翻译：执行作业的方法包括获得第一多个调度作业，基于所述第一多个调度作业中的至少一个来设置第一触发阈值，执行所述第一多个调度作业，在所述第一多个调度作业的执行期间接收所提交的作业多个预定作业，将提交的作业与提交的作业优先级相关联，如果所提交的作业优先级满足第一触发阈值，获得第二多个调度作业，则基于第二多个调度的至少一个调度作业，执行第二多个调度作业，并且如果所提交的作业优先级不满足第一触发阈值，则继续执行第一多个作业。

4. 发明授权

US07743378B1 Method and apparatus for multi-dimensional priority determination for job scheduling 有权
标题翻译：用于作业调度的多维优先级确定的方法和装置
公开(公告)号：US07743378B1
公开(公告)日：2010-06-22
申请号：US11128629
申请日：2005-05-13
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46
CPC分类号： G06F9/5055 , G06F9/5044 , G06F2209/5019
摘要： A method for scheduling computing jobs in a scheduling event includes calculating a static priority of each computing job ready for scheduling, and then selecting a first computing job having the highest static priority as compared to at least one other computing jobs ready for scheduling, the first computing job being associated with at least one required resource. Further, a subset of computing nodes able to satisfy the at least one required resource are identified, and predictions are made for each node of an earliest predicted completion time that the first computing job can be completed on each of those nodes, taking into account already scheduled jobs. Finally, execution of the first computing job is scheduled on the node having the earliest predicted completion time.
摘要翻译：一种用于在调度事件中调度计算作业的方法包括计算准备好进行调度的每个计算作业的静态优先级，然后选择具有最高静态优先级的第一计算作业与至少一个准备好进行调度的其他计算作业相比较，第一计算作业与至少一个所需资源相关联。此外，识别能够满足至少一个所需资源的计算节点的子集，并且对于最早预测完成时间的每个节点进行预测，以便可以在每个节点上的每个节点上完成第一计算任务，同时考虑已经计划工作。最后，在具有最早预测完成时间的节点上调度第一计算作业的执行。

5. 发明申请

US20080066070A1 Method and system for the dynamic scheduling of jobs in a computing system 有权
标题翻译：计算系统中作业动态调度的方法和系统
公开(公告)号：US20080066070A1
公开(公告)日：2008-03-13
申请号：US11520477
申请日：2006-09-12
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/4818 , G06F2209/484
摘要： A method of executing jobs includes obtaining a first plurality of scheduled jobs, setting a first trigger threshold based on at least one of the first plurality of scheduled jobs, executing the first plurality of scheduled jobs, receiving a submitted job during the execution of the first plurality of scheduled jobs, associating the submitted job with a submitted job priority, if the submitted job priority satisfies the first trigger threshold: obtaining a second plurality of scheduled jobs, setting a second trigger threshold based on at least one of the second plurality of scheduled jobs, executing the second plurality of scheduled jobs, and if the submitted job priority does not satisfy the first trigger threshold: continuing execution of the first plurality of jobs.
摘要翻译：执行作业的方法包括获得第一多个调度作业，基于所述第一多个调度作业中的至少一个来设置第一触发阈值，执行所述第一多个调度作业，在所述第一多个调度作业的执行期间接收所提交的作业多个预定作业，将所提交的作业与所提交的作业优先级相关联，如果所提交的作业优先级满足第一触发阈值：获得第二多个调度作业;基于第二多个调度的至少一个，设置第二触发阈值作业，执行第二多个调度作业，以及所提交的作业优先级是否不满足第一触发阈值：继续执行第一多个作业。

6. 发明授权

US07984447B1 Method and apparatus for balancing project shares within job assignment and scheduling 有权
标题翻译：在作业分配和调度中平衡项目份额的方法和装置
公开(公告)号：US07984447B1
公开(公告)日：2011-07-19
申请号：US11211790
申请日：2005-08-25
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46 , G06F15/16 , G06F15/173
CPC分类号： G06F9/4881 , G06F9/505
摘要： A method includes associating each computing job with a group of a plurality of groups, and associating each group with a minimum promised utilization. Further, the method includes determining a present utilization for each group having at least one job ready for scheduling, each job being associated with at least one required resource, the present utilization for a given group comprising a total amount of a promised resource consumed by presently executing jobs associated with the given group divided by the minimum promised utilization associated with the given group. A first computing job selected for scheduling is one that is ready for scheduling and is the computing job having a highest static priority within a group having a lowest present utilization. A subset of computing nodes able to satisfy the at least one required resource associated with the first computing job is identified.
摘要翻译：一种方法包括将每个计算作业与多个组的组相关联，并且将每个组与最小应答利用率相关联。此外，该方法包括确定具有至少一个准备好进行调度的作业的每个组的当前利用率，每个作业与至少一个所需资源相关联，给定组的当前利用包括目前消耗的所承诺资源的总量执行与给定组相关联的作业除以与给定组相关联的最小承诺利用率。选择用于调度的第一计算任务是准备进行调度的计算任务，并且具有最低当前利用率的组内具有最高静态优先级的计算任务。识别能够满足与第一计算作业相关联的至少一个所需资源的计算节点的子集。

7. 发明授权

US07752622B1 Method and apparatus for flexible job pre-emption 有权
标题翻译：弹性工作优先的方法和装置
公开(公告)号：US07752622B1
公开(公告)日：2010-07-06
申请号：US11128655
申请日：2005-05-13
申请人： Lev Markov
发明人： Lev Markov
IPC分类号： G06F9/46
CPC分类号： G06F9/4881
摘要： A method for scheduling computing jobs in a scheduling event includes selecting a computing job that is ready for scheduling the first computing job being associated with at least one required resource. A computing node is identified that is able to satisfy the at least one required resource during a first time period having a start time and an end time. A second computing job is determined to have previously been scheduled to execute during a second time period; wherein the second time period overlaps the first time period. At a time prior to scheduling the first computing job, a determination is made as to whether the second computing job is preemptible by the first computing job. If so, execution of the second computing job is preempted by the first computing job if the second computing job has been determined to be preemptible by the first computing job if the priority of the first computing job is greater than the priority of the second computing job by at least a threshold amount, and if preempting the second job frees at least one of the at least one required resource for use by the first computing job. Execution of the first computing job is scheduled to take place on a first computing node during the first time period, where a start time associated with the first time period is a time selected from the group consisting of a current time and a future time.
摘要翻译：用于在调度事件中调度计算作业的方法包括选择准备好调度与至少一个所需资源相关联的第一计算作业的计算作业。识别能够在具有开始时间和结束时间的第一时间段期间满足至少一个所需资源的计算节点。第二计算作业被确定为先前被安排在第二时间段期间执行; 其中所述第二时间段与所述第一时间段重叠。在调度第一计算作业之前的时间，确定第二计算作业是否可被第一计算作业抢占。如果是，如果第一计算作业的优先级大于第二计算作业的优先级，则如果第二计算作业已经被第一计算作业确定为可抢占的话，则第二计算作业的执行被抢占至少阈值量，并且如果抢占所述第二作业释放所述至少一个所述资源以供所述第一计算作业使用的至少一个。第一计算作业的执行被调度在第一时间段内在第一计算节点上进行，其中与第一时间段相关联的开始时间是从当前时间和未来时间组成的组中选择的时间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式