公开(公告)号：US08443373B2

公开(公告)日：2013-05-14

申请号：US12694084

申请日：2010-01-26

Applicant: Genevieve Fernandes ,  Marko Radmilac ,  Donald James McCrady ,  Krishnan Varadarajan

Inventor： Genevieve Fernandes ,  Marko Radmilac ,  Donald James McCrady ,  Krishnan Varadarajan

IPC: G06F9/46 ,  G06F15/173

CPC classification number: G06F9/5083

Abstract: Embodiments are directed to dynamically allocating processing resources among a plurality of resource schedulers. A resource manager dynamically allocates resources to a first resource scheduler. The resource manager is configured to dynamically allocate resources among a plurality of resource schedulers, and each scheduler is configured to manage various processing resources. The resource manager determines that at least one of the processing resources dynamically allocated to the first resource scheduler is idle. The resource manager determines that at least one other resource scheduler needs additional processing resources and, based on the determination, loans the determined idle processing resource of the first resource scheduler to a second resource scheduler.

Abstract translation: 实施例涉及在多个资源调度器之间动态分配处理资源。 资源管理器动态地将资源分配给第一资源调度器。 资源管理器被配置为在多个资源调度器之间动态地分配资源，并且每个调度器被配置为管理各种处理资源。 资源管理器确定动态分配给第一资源调度器的处理资源中的至少一个空闲。 资源管理器确定至少一个其他资源调度器需要额外的处理资源，并且基于该确定，将所确定的第一资源调度器的空闲处理资源向第二资源调度器发放。

公开(公告)号：US08843900B2

公开(公告)日：2014-09-23

申请号：US13494338

申请日：2012-06-12

Applicant: Michael Stall ,  Marko Radmilac ,  Krishan Varadarajan

Inventor： Michael Stall ,  Marko Radmilac ,  Krishan Varadarajan

IPC: G06F11/36

CPC classification number: G06F11/36 ,  G06F11/3636

Abstract: Systems, methods, and computer program products for facilitating a serial debugging experience for programs running in a distributed, non-deterministic, out-of-order (i.e., parallel) fashion are disclosed. Such systems, methods, and computer program products provide a modified combination of breakpoints, stepping, and call stacks that facilitate the ability to improve the debugging experience for out-of-order program execution. In an embodiment, a task scheduler provides a distributed task graph. Then, the user may hit breakpoints sequentially within the graph's execution and use deterministic stepping (i.e., step-in, step-out, and step-over functions) to create a logical call stack from a distributed task graph. Such embodiments allow the program to execute in a distributed and parallel manner, while presenting the user a sequential execution experience in the debugger.

Abstract translation: 公开了用于促进以分布式，非确定性，无序（即并行）方式运行的程序的串行调试体验的系统，方法和计算机程序产品。 这样的系统，方法和计算机程序产品提供了修改的断点，步进和调用堆栈的组合，这有助于提高无序程序执行的调试体验。 在一个实施例中，任务调度器提供分布式任务图。 然后，用户可以在图的执行中顺序地点击断点，并使用确定性步进（即，步进，逐出和分步功能）从分布式任务图形成逻辑调用堆栈。 这样的实施例允许程序以分布式和并行方式执行，同时在调试器中呈现用户的顺序执行体验。

公开(公告)号：US20110185364A1

公开(公告)日：2011-07-28

申请号：US12694084

申请日：2010-01-26

Applicant: Genevieve Fernandes ,  Marko Radmilac ,  Donald James McCrady ,  Krishnan Varadarajan

Inventor： Genevieve Fernandes ,  Marko Radmilac ,  Donald James McCrady ,  Krishnan Varadarajan

IPC: G06F9/50

CPC classification number: G06F9/5083

Abstract: Embodiments are directed to dynamically allocating processing resources among a plurality of resource schedulers. A resource manager dynamically allocates resources to a first resource scheduler. The resource manager is configured to dynamically allocate resources among a plurality of resource schedulers, and each scheduler is configured to manage various processing resources. The resource manager determines that at least one of the processing resources dynamically allocated to the first resource scheduler is idle. The resource manager determines that at least one other resource scheduler needs additional processing resources and, based on the determination, loans the determined idle processing resource of the first resource scheduler to a second resource scheduler.

Abstract translation: 实施例涉及在多个资源调度器之间动态分配处理资源。 资源管理器动态地将资源分配给第一资源调度器。 资源管理器被配置为在多个资源调度器之间动态地分配资源，并且每个调度器被配置为管理各种处理资源。 资源管理器确定动态分配给第一资源调度器的处理资源中的至少一个空闲。 资源管理器确定至少一个其他资源调度器需要额外的处理资源，并且基于该确定，将所确定的第一资源调度器的空闲处理资源向第二资源调度器发放。

公开(公告)号：US08719831B2

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

申请号：US12487091

申请日：2009-06-18

Applicant: Marko Radmilac ,  Genevieve Fernandes ,  Paul Ringseth

Inventor： Marko Radmilac ,  Genevieve Fernandes ,  Paul Ringseth

IPC: G06F9/46

CPC classification number: G06F9/5083

Abstract: A resource manager manages processing and other resources of schedulers of one or more processes executing on one or more computer systems. For each scheduler, the resource manager determines an initial allocation of resources based on the policy of the scheduler, the availability of resources, and the policies of other schedulers. The resource manager receives feedback from the schedulers and dynamically changes the allocation of resources of schedulers based on the feedback. The resource manager determines if changes improved the performance of schedulers and commits or rolls back the changes based on the determination.

Abstract translation: 资源管理器管理在一个或多个计算机系统上执行的一个或多个进程的调度器的处理和其他资源。 对于每个调度器，资源管理器基于调度器的策略，资源的可用性以及其他调度器的策略来确定资源的初始分配。 资源管理器从调度器接收反馈，并基于反馈动态地改变调度器的资源分配。 资源管理器确定是否改进了调度程序的性能，并根据确定提交或回滚更改。

公开(公告)号：US20130332908A1

公开(公告)日：2013-12-12

申请号：US13494338

申请日：2012-06-12

Applicant: Michael Stall ,  Marko Radmilac ,  Krishan Varadarajan

Inventor： Michael Stall ,  Marko Radmilac ,  Krishan Varadarajan

IPC: G06F9/44

CPC classification number: G06F11/36 ,  G06F11/3636

Abstract: Systems, methods, and computer program products for facilitating a serial debugging experience for programs running in a distributed, non-deterministic, out-of-order (i.e., parallel) fashion are disclosed. Such systems, methods, and computer program products provide a modified combination of breakpoints, stepping, and call stacks that facilitate the ability to improve the debugging experience for out-of-order program execution. In an embodiment, a task scheduler provides a distributed task graph. Then, the user may hit breakpoints sequentially within the graph's execution and use deterministic stepping (i.e., step-in, step-out, and step-over functions) to create a logical call stack from a distributed task graph. Such embodiments allow the program to execute in a distributed and parallel manner, while presenting the user a sequential execution experience in the debugger.

Abstract translation: 公开了用于促进以分布式，非确定性，无序（即并行）方式运行的程序的串行调试体验的系统，方法和计算机程序产品。 这样的系统，方法和计算机程序产品提供了修改的断点，步进和调用堆栈的组合，这有助于提高无序程序执行的调试体验。 在一个实施例中，任务调度器提供分布式任务图。 然后，用户可以在图的执行中顺序地点击断点，并使用确定性步进（即，步进，逐出和分步功能）从分布式任务图形成逻辑调用堆栈。 这样的实施例允许程序以分布式和并行方式执行，同时在调试器中呈现用户的顺序执行体验。

公开(公告)号：US20100325637A1

公开(公告)日：2010-12-23

申请号：US12487091

申请日：2009-06-18

Applicant: Marko Radmilac ,  Genevieve Fernandes ,  Paul Ringseth

Inventor： Marko Radmilac ,  Genevieve Fernandes ,  Paul Ringseth

IPC: G06F9/50

CPC classification number: G06F9/5083

Abstract: A resource manager manages processing and other resources of schedulers of one or more processes executing on one or more computer systems. For each scheduler, the resource manager determines an initial allocation of resources based on the policy of the scheduler, the availability of resources, and the policies of other schedulers. The resource manager receives feedback from the schedulers and dynamically changes the allocation of resources of schedulers based on the feedback. The resource manager determines if changes improved the performance of schedulers and commits or rolls back the changes based on the determination.

Abstract translation: 资源管理器管理在一个或多个计算机系统上执行的一个或多个进程的调度器的处理和其他资源。 对于每个调度器，资源管理器基于调度器的策略，资源的可用性以及其他调度器的策略来确定资源的初始分配。 资源管理器从调度器接收反馈，并基于反馈动态地改变调度器的资源分配。 资源管理器确定是否改进了调度程序的性能，并根据确定提交或回滚更改。

公开(公告)号：US09384063B2

公开(公告)日：2016-07-05

申请号：US12486945

申请日：2009-06-18

Applicant: Paul Ringseth ,  Michael L. Chu ,  William R. Messmer ,  Marko Radmilac ,  Genevieve Fernandes

Inventor： Paul Ringseth ,  Michael L. Chu ,  William R. Messmer ,  Marko Radmilac ,  Genevieve Fernandes

IPC: G06F17/30 ,  G06F9/52

CPC classification number: G06F9/52 ,  G06F17/30356

Abstract: A concurrent data structure allows synchronization to be elided for read accesses. Processing resources that remove one or more elements of the concurrent data structure are allowed to delete the elements only after all other processing resources have reached a safe point. Each processing resource maintains an indicator that indicates whether the processing resource has reached as safe point (i.e., will not access the concurrent data structure). When the indicators indicate that all processing resources have reached a safe point, elements of the data structure may be deleted.

Abstract translation: 并发的数据结构允许同步被读取访问。 删除一个或多个并发数据结构元素的处理资源仅在所有其他处理资源达到安全点之后才能删除元素。 每个处理资源维护指示处理资源是否达到安全点（即不会访问并发数据结构）的指示符。 当指示符表示所有处理资源达到安全点时，可能会删除数据结构的元素。

公开(公告)号：US09378062B2

公开(公告)日：2016-06-28

申请号：US12487084

申请日：2009-06-18

Applicant: Paul F. Ringseth ,  William R. Messmer ,  Niklas Gustafsson ,  Genevieve Fernandes ,  Marko Radmilac

Inventor： Paul F. Ringseth ,  William R. Messmer ,  Niklas Gustafsson ,  Genevieve Fernandes ,  Marko Radmilac

IPC: G06F9/46 ,  G06F9/50

CPC classification number: G06F9/505 ,  G06F9/5061 ,  G06F9/5077 ,  G06F9/5088 ,  G06F2209/5022

Abstract: An interface between a resource manager and schedulers in a process executing on a computer system allows the resource manager to manage the resources of the schedulers. The resource manager communicates with the schedulers using the interface to access statistical information from the schedulers. The statistical information describes the amount of use of the resources by the schedulers. The resource manager also communicates with the schedulers to dynamically allocate and reallocate resources among the schedulers in the same or different processes or computer systems in accordance with the statistical information.

Abstract translation: 在计算机系统上执行的进程中的资源管理器和调度器之间的接口允许资源管理器管理调度器的资源。 资源管理器使用接口与调度器通信以从调度器访问统计信息。 统计信息描述了调度器对资源的使用量。 资源管理器还与调度器进行通信，以根据统计信息在相同或不同的进程或计算机系统中的调度器之间动态分配和重新分配资源。

公开(公告)号：US08843927B2

公开(公告)日：2014-09-23

申请号：US12428918

申请日：2009-04-23

Applicant: Marko Radmilac ,  Paul Ringseth ,  Genevieve Fernandes ,  William R. Messmer ,  Niklas Gustafsson

Inventor： Marko Radmilac ,  Paul Ringseth ,  Genevieve Fernandes ,  William R. Messmer ,  Niklas Gustafsson

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/455 ,  G06F11/34

CPC classification number: G06F11/3466 ,  G06F11/3452 ,  G06F2201/865 ,  G06F2201/88

Abstract: Each processing resource in a scheduler of a process executing on a computer system maintains counts of the number of tasks that arrive at the processing resource and the number of tasks that complete on the processing resource. The counts are maintained in storage that is only writeable by the corresponding processing resource. The scheduler collects and sums the counts from each processing resource and provides statistics based on the summed counts and previous summed counts to a resource manager in response to a request from the resource manager. The scheduler does not reset the counts when the counts are collected and stores copies of the summed counts for use with the next request from the resource manager. The counts may be maintained without synchronization and with thread safety to minimize the impact of gathering statistics on the application.

Abstract translation: 在计算机系统上执行的进程的调度器中的每个处理资源保持到达处理资源的任务的数量以及在处理资源上完成的任务的数量。 计数保存在只能由相应的处理资源写入的存储中。 调度器从每个处理资源收集和总和计数，并且响应于来自资源管理器的请求，将资源管理器的总和计数和先前求和的计数提供统计。 当收集计数时，调度程序不会重置计数，并存储与资源管理器的下一个请求一起使用的总计数的副本。 可以维护计数，无需同步和线程安全性，以最大限度地减少对应用程序采集统计信息的影响。

公开(公告)号：US20130173682A1

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

申请号：US13339184

申请日：2011-12-28

Applicant: Marko Radmilac

Inventor： Marko Radmilac

IPC: G06F7/483

CPC classification number: G06F7/483 ,  G06F7/49905

Abstract: A process for propagating an error in a floating-point calculation is disclosed. A floating-point error occurring from the floating-point arithmetic calculation is trapped, and a special value is generated. Information regarding the error is stored as a payload of the special value. Program operations are resumed with the special value applied to further calculations dependent on the floating-point arithmetic calculation.

Abstract translation: 公开了一种在浮点计算中传播错误的过程。 从浮点运算计算出现的浮点错误被捕获，并产生一个特殊的值。 关于错误的信息被存储为特殊值的有效载荷。 程序操作恢复，特殊值应用于依赖于浮点运算的进一步计算。