会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Simulation environment for distributed programs
    • 分布式程序的仿真环境
    • US08707275B2
    • 2014-04-22
    • US12882163
    • 2010-09-14
    • Massimo MascaroIgor OstrovskyEmad A. Omara
    • Massimo MascaroIgor OstrovskyEmad A. Omara
    • G06F9/44
    • G06F11/3664G06F8/20G06F8/443G06F9/4881G06F9/5066G06Q10/06315
    • A scheduler receives a job graph which includes a graph of computational vertices that are designed to be executed on multiple distributed computer systems. The scheduler queries a graph manager to determine which computational vertices of the job graph are ready for execution in a local execution environment. The scheduler queries a cluster manager to determine the organizational topology of the distributed computer systems to simulate the determined topology in the local execution environment. The scheduler queries a data manager to determine data storage locations for each of the computational vertices indicated as being ready for execution in the local execution environment. The scheduler also indicates to a vertex spawner that an instance of each computational vertex is to be spawned in the local execution environment based on the organizational topology and indicated data storage locations, and indicates to the local execution environment that the spawned vertices are to be executed.
    • 调度器接收作业图,该作业图包括被设计为在多个分布式计算机系统上执行的计算顶点的图形。 调度程序查询图表管理器以确定作业图的哪些计算顶点准备好在本地执行环境中执行。 调度程序查询集群管理器以确定分布式计算机系统的组织拓扑,以模拟本地执行环境中确定的拓扑。 调度器查询数据管理器以确定指示为准备在本地执行环境中执行的每个计算顶点的数据存储位置。 调度器还向顶点指示器根据组织拓扑和指示的数据存储位置,在本地执行环境中产生每个计算顶点的实例,并向本地执行环境指示要执行所产生的顶点 。
    • 2. 发明申请
    • SIMULATION ENVIRONMENT FOR DISTRIBUTED PROGRAMS
    • 分布式方案的模拟环境
    • US20120066667A1
    • 2012-03-15
    • US12882163
    • 2010-09-14
    • Massimo MascaroIgor OstrovskyEmad A. Omara
    • Massimo MascaroIgor OstrovskyEmad A. Omara
    • G06F9/44G06F9/46
    • G06F11/3664G06F8/20G06F8/443G06F9/4881G06F9/5066G06Q10/06315
    • A scheduler receives a job graph which includes a graph of computational vertices that are designed to be executed on multiple distributed computer systems. The scheduler queries a graph manager to determine which computational vertices of the job graph are ready for execution in a local execution environment. The scheduler queries a cluster manager to determine the organizational topology of the distributed computer systems to simulate the determined topology in the local execution environment. The scheduler queries a data manager to determine data storage locations for each of the computational vertices indicated as being ready for execution in the local execution environment. The scheduler also indicates to a vertex spawner that an instance of each computational vertex is to be spawned in the local execution environment based on the organizational topology and indicated data storage locations, and indicates to the local execution environment that the spawned vertices are to be executed.
    • 调度器接收作业图,该作业图包括被设计为在多个分布式计算机系统上执行的计算顶点的图形。 调度程序查询图表管理器以确定作业图的哪些计算顶点准备好在本地执行环境中执行。 调度程序查询集群管理器以确定分布式计算机系统的组织拓扑,以模拟本地执行环境中确定的拓扑。 调度器查询数据管理器以确定指示为准备在本地执行环境中执行的每个计算顶点的数据存储位置。 调度器还向顶点指示器根据组织拓扑和指示的数据存储位置,在本地执行环境中产生每个计算顶点的实例,并向本地执行环境指示要执行所产生的顶点 。
    • 3. 发明申请
    • SCALABLE THREAD LOCKING WITH CUSTOMIZABLE SPINNING
    • 可定制螺纹锁定与自定义旋转
    • US20110126204A1
    • 2011-05-26
    • US12625344
    • 2009-11-24
    • Emad A. OmaraJohn J. Duffy
    • Emad A. OmaraJohn J. Duffy
    • G06F9/46
    • G06F9/4843G06F9/526
    • Embodiments described herein are directed to dynamically controlling the number of spins for a selected processing thread among a plurality of processing threads. A computer system tracks both the number of waiting processing threads and each thread's turn, wherein a selected thread's turn comprises the total number of waiting processing threads after the selected thread's arrival at the processor. Next, the computer system determines, based the selected thread's turn, the number of spins that are to occur before the selected thread checks for an available thread lock. The computer system also, based on the selected thread's turn, changes the number of spins, such that the number of spins for the selected thread is a function of the number of waiting processing threads and processors in the computer system.
    • 本文描述的实施例涉及动态地控制多个处理线程中所选择的处理线程的自旋数量。 计算机系统跟踪等待处理线程和每个线程的轮次数,其中所选线程的回合包括所选线程到达处理器之后的等待处理线程的总数。 接下来,计算机系统基于所选线程的轮次确定在所选线程检查可用线程锁之前将发生的自旋数。 计算机系统还基于选择的线程轮到改变自旋数,使得所选线程的旋转数量是计算机系统中等待处理线程和处理器的数量的函数。
    • 4. 发明申请
    • ARRAY-BASED THREAD COUNTDOWN
    • 基于阵列的螺纹计数
    • US20110191775A1
    • 2011-08-04
    • US12697035
    • 2010-01-29
    • Emad A. OmaraJohn J. Duffy
    • Emad A. OmaraJohn J. Duffy
    • G06F9/46
    • G06F9/46
    • The forking of thread operations. At runtime, a task is identified as being divided into multiple subtasks to be accomplished by multiple threads (i.e., forked threads). In order to be able to verify when the forked threads have completed their task, multiple counter memory locations are set up and updated as forked threads complete. The multiple counter memory locations are evaluated in the aggregate to determine whether all of the forked threads are completed. Once the forked threads are determined to be completed, a join operation may be performed. Rather than a single memory location, multiple memory locations are used to account for thread completion. This reduces risk of thread contention.
    • 划线操作。 在运行时,将任务识别为被多个线程(即分叉线程)完成的多个子任务。 为了能够验证分叉线程何时完成任务,多个计数器内存位置被设置和更新为分叉线程完成。 聚合计算多个计数器存储器位置以确定是否完成所有分叉的线程。 一旦分叉线程被确定为完成,则可以执行连接操作。 而不是单个内存位置,使用多个内存位置来解释线程完成。 这样可以减少线程争用的风险。
    • 5. 发明授权
    • Scalable thread locking with customizable spinning
    • 可定制旋转的可伸缩螺纹锁定
    • US08683470B2
    • 2014-03-25
    • US12625344
    • 2009-11-24
    • Emad A. OmaraJohn J. Duffy
    • Emad A. OmaraJohn J. Duffy
    • G06F9/46
    • G06F9/4843G06F9/526
    • Embodiments described herein are directed to dynamically controlling the number of spins for a selected processing thread among a plurality of processing threads. A computer system tracks both the number of waiting processing threads and each thread's turn, wherein a selected thread's turn comprises the total number of waiting processing threads after the selected thread's arrival at the processor. Next, the computer system determines, based the selected thread's turn, the number of spins that are to occur before the selected thread checks for an available thread lock. The computer system also, based on the selected thread's turn, changes the number of spins, such that the number of spins for the selected thread is a function of the number of waiting processing threads and processors in the computer system.
    • 本文描述的实施例涉及动态地控制多个处理线程中所选择的处理线程的自旋数量。 计算机系统跟踪等待处理线程和每个线程的轮次数,其中所选线程的回合包括所选线程到达处理器之后的等待处理线程的总数。 接下来,计算机系统基于所选线程的轮次确定在所选线程检查可用线程锁之前将发生的自旋数。 计算机系统还基于选择的线程轮到改变自旋数,使得所选线程的旋转数量是计算机系统中等待处理线程和处理器的数量的函数。