公开(公告)号：US07155724B2

公开(公告)日：2006-12-26

申请号：US10847514

申请日：2004-05-17

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/00 ,  G06F15/173

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

公开(公告)号：US07107593B2

公开(公告)日：2006-09-12

申请号：US10845404

申请日：2004-05-13

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/00 ,  G06F15/173

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

公开(公告)号：US20060053423A1

公开(公告)日：2006-03-09

申请号：US11262643

申请日：2005-10-31

申请人： Michael Jones ,  John Regehr

发明人： Michael Jones ,  John Regehr

IPC分类号： G06F9/46

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

摘要翻译： 本发明提供了使用在离散调度和/或多处理器操作系统上重复预先计算的调度的程序的可预测调度。 在一个实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 每个处理器可能有一个调度图，或调度图可以遍历多个处理器。 调整预约和约束的开始和结束时间以补偿系统时钟的粒度。 此外，调度器可以使用现有的基于优先级的调度器，以便使其作出的调度决定。

公开(公告)号：US07171669B2

公开(公告)日：2007-01-30

申请号：US10841092

申请日：2004-05-07

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/00 ,  G06F15/173

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

公开(公告)号：US07162720B2

公开(公告)日：2007-01-09

申请号：US10842213

申请日：2004-05-10

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/00 ,  G06F15/173

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

摘要翻译： 本发明提供了使用在离散调度和/或多处理器操作系统上重复预先计算的调度的程序的可预测调度。 在一个实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 每个处理器可能有一个调度图，或调度图可以遍历多个处理器。 调整预约和约束的开始和结束时间以补偿系统时钟的粒度。 此外，调度器可以使用现有的基于优先级的调度器，以便使其作出的调度决定。

公开(公告)号：US07000232B2

公开(公告)日：2006-02-14

申请号：US10847686

申请日：2004-05-17

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/46

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

公开(公告)号：US20050005273A1

公开(公告)日：2005-01-06

申请号：US10847686

申请日：2004-05-17

申请人： Michael Jones ,  John Regehr

发明人： Michael Jones ,  John Regehr

IPC分类号： G06F9/48 ,  G06F9/50 ,  G06F9/44

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

摘要翻译： 本发明提供了使用在离散调度和/或多处理器操作系统上重复预先计算的调度的程序的可预测调度。 在一个实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 每个处理器可能有一个调度图，或调度图可以遍历多个处理器。 调整预约和约束的开始和结束时间以补偿系统时钟的粒度。 此外，调度器可以使用现有的基于优先级的调度器，以便使其作出的调度决定。

公开(公告)号：US07409689B2

公开(公告)日：2008-08-05

申请号：US11262643

申请日：2005-10-31

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F9/00 ,  G06F15/173

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.

摘要翻译： 本发明提供了使用在离散调度和/或多处理器操作系统上重复预先计算的调度的程序的可预测调度。 在一个实施例中，调度器访问活动调度图。 活动调度图由每个表示循环执行间隔的节点组成，并且具有一个根，一个或多个叶以及从根到每个叶的至少一个路径。 每个节点在从根到叶的至少一个路径上，并且在图的遍历期间发生由每个节点表示的执行间隔的次数等于从根到叶的路径的数量，该节点 是在。 每个节点与其相关联的执行间隔长度，并且适于专用于执行单个活动的线程。 每个处理器可能有一个调度图，或调度图可以遍历多个处理器。 调整预约和约束的开始和结束时间以补偿系统时钟的粒度。 此外，调度器可以使用现有的基于优先级的调度器，以便使其作出的调度决定。

公开(公告)号：US06745222B1

公开(公告)日：2004-06-01

申请号：US09350083

申请日：1999-07-08

申请人： Michael B. Jones ,  John Regehr

发明人： Michael B. Jones ,  John Regehr

IPC分类号： G06F900

CPC分类号： G06F9/4887

摘要： The present invention provides providing predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems. In one embodiment, a scheduler accesses an activity scheduling graph. The activity scheduling graph is comprised of nodes each representing a recurring execution interval, and has one root, one or more leaves, and at least one path from the root to each leaf. Each node is on at least one path from the root to a leaf, and the number of times the execution interval represented by each node occurs during the traversal of the graph is equal to the number of paths from the root to a leaf that the node is on. Each node has associated with it an execution interval length, and is adapted to being dedicated to executing the threads of a single activity. There may be one scheduling graph for each processor, or a scheduling graph may traverse multiple processors. Start and end times for reservations and constraints are adjusted to compensate for the granularity of the clock of the system. Furthermore, the scheduler may use an existing priority-based scheduler in order to cause scheduling decisions it has made to be acted upon.