Optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity
    1.
    发明授权
    Optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity 有权
    使用动态块大小粒度优化计算集群中不同类型应用程序的文件系统

    公开(公告)号:US09021229B2

    公开(公告)日:2015-04-28

    申请号:US12760476

    申请日:2010-04-14

    IPC分类号: G06F3/06

    摘要: Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.

    摘要翻译: 本发明的实施例涉及使用动态块大小粒度来优化在计算集群中的不同类型的应用的文件系统。 示例性实施例包括为集群中的每个节点保留预定数量的存储分配区域,其中每个存储分配区域包括在本地连接的存储器的单个存储盘上的一组连续的数据块; 在本地连接的存储的单个存储盘上使用连续的一组数据块作为文件系统的块分配粒度,用于条带化要存储在文件系统中的数据以用于群集中的计算操作; 并且使用共享存储子系统的单个数据块作为文件系统的块分配粒度,用于条带化要存储在文件系统中的数据以用于群集中的数据访问操作。

    Optimizing a File System for Different Types of Applications in a Compute Cluster Using Dynamic Block Size Granularity
    2.
    发明申请
    Optimizing a File System for Different Types of Applications in a Compute Cluster Using Dynamic Block Size Granularity 有权
    使用动态块大小粒度优化计算群集中不同类型应用程序的文件系统

    公开(公告)号:US20110258378A1

    公开(公告)日:2011-10-20

    申请号:US12760476

    申请日:2010-04-14

    IPC分类号: G06F12/00 G06F12/02

    摘要: Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.

    摘要翻译: 本发明的实施例涉及使用动态块大小粒度来优化在计算集群中的不同类型的应用的文件系统。 示例性实施例包括为集群中的每个节点保留预定数量的存储分配区域,其中每个存储分配区域包括在本地连接的存储器的单个存储盘上的一组连续的数据块; 在本地连接的存储的单个存储盘上使用连续的一组数据块作为文件系统的块分配粒度,用于条带化要存储在文件系统中的数据以用于群集中的计算操作; 并且使用共享存储子系统的单个数据块作为文件系统的块分配粒度,用于条带化要存储在文件系统中的数据以用于群集中的数据访问操作。

    Earnings-based time-share scheduling
    5.
    发明授权
    Earnings-based time-share scheduling 失效
    基于收益的时间安排

    公开(公告)号:US06714960B1

    公开(公告)日:2004-03-30

    申请号:US08752909

    申请日:1996-11-20

    IPC分类号: G06F900

    CPC分类号: G06F9/4881

    摘要: A precise earnings-based time-share scheduler schedules multiple jobs in a computer system by apportioning earnings, at scheduler ticks. Earnings are apportioned to jobs based on actual time a job spent in a queue requesting execution on a central processing unit (CPU) in the computer system between scheduler ticks and amounts of time jobs ran on the CPU between scheduler ticks. At the end of a time slice, a job is selected for execution on the processor based on earnings apportioned to each job.

    摘要翻译: 精确的基于盈利的时间分配调度员通过分配收入在计划系统中调度多个作业。 收入根据作业花费在队列中的实际时间分配给作业,请求在计算机系统中的中央处理单元(CPU)上执行调度程序刻度和在调度程序刻度之间运行的时间工作量。 在时间段结束时,根据分配给每个作业的收入,选择在处理器上执行作业。

    Adaptive and integrated visualization of spatiotemporal data from large-scale simulations
    6.
    发明授权
    Adaptive and integrated visualization of spatiotemporal data from large-scale simulations 失效
    来自大规模模拟的时空数据的自适应和综合可视化

    公开(公告)号:US08699566B2

    公开(公告)日:2014-04-15

    申请号:US12695119

    申请日:2010-01-27

    IPC分类号: G06F15/00

    摘要: Adaptive and integrated visualization of spatiotemporal data from large-scale simulation, is provided. A simulation is performed utilizing a simulator comprising multiple processors, generating spatiotemporal data samples from the simulation. Each data sample has spatial coordinates with a time stamp at a specific time resolution, and a tag. The data samples are assembled into data streams based on at least one of a spatial relationship and the corresponding tag. Each data stream is encoded into multiple formats, and an integrated and adaptive visualization of the data streams is displayed, wherein various data streams are simultaneously and synchronously displayed.

    摘要翻译: 提供了大规模模拟的时空数据的自适应和综合可视化。 使用包括多个处理器的模拟器执行模拟,从仿真生成时空数据样本。 每个数据样本具有具有特定时间分辨率的时间戳的空间坐标和标签。 基于空间关系和相应标签中的至少一个将数据样本组装成数据流。 每个数据流被编码成多种格式,并且显示数据流的集成和自适应可视化,其中同时和同步地显示各种数据流。

    Managing filesystem versions
    7.
    发明授权
    Managing filesystem versions 失效
    管理文件系统版本

    公开(公告)号:US07139781B2

    公开(公告)日:2006-11-21

    申请号:US10427391

    申请日:2003-04-29

    IPC分类号: G06F12/00 G06F17/30

    摘要: A system and method for managing logical versions of a filesystem made through a near-instantaneous copy process is provided. Each logical version of the filesystem, including the primary version, is assigned a unique epoch number or other identifying value, and each filesystem object is assigned two epoch numbers that define the space of logical versions for which the object exists. A list of all valid epoch numbers are maintained in a version table. The near-instantaneous creation of a logical version of the filesystem requires inserting a unique epoch number entry in the version table (106) and the next epoch number to the new logical version. An original state of the system is preserved through the use of a copy-on-write procedure for filesystem objects that are reference by that logical filesystem version (120). Accordingly, filesystem versions are maintained and original states of previous states of the logical filesystem versions are preserved.

    摘要翻译: 提供了一种用于管理通过近瞬时复制过程制成的文件系统的逻辑版本的系统和方法。 文件系统的每个逻辑版本(包括主版本)都被分配一个唯一的历元编号或其他标识值,并为每个文件系统对象分配两个时代号,以定义对象所在的逻辑版本的空间。 在版本表中维护所有有效时期编号的列表。 文件系统的逻辑版本的即时即时创建需要在版本表(106)中插入唯一的时代号码条目,并将新的时代号码插入新的逻辑版本。 通过对由该逻辑文件系统版本(120)引用的文件系统对象使用写时复制过程来保留系统的原始状态。 因此,维护文件系统版本,并保留逻辑文件系统版本的先前状态的原始状态。

    Discipline for lock reassertion in a distributed file system
    8.
    发明授权
    Discipline for lock reassertion in a distributed file system 有权
    在分布式文件系统中重新锁定的纪律

    公开(公告)号:US07124131B2

    公开(公告)日:2006-10-17

    申请号:US10427035

    申请日:2003-04-29

    IPC分类号: G06F7/00 G06F12/00 G06F15/16

    摘要: A method and system for asserting a lock in a distributed file system is provided. All distributed locks have a lease for a limited time period, wherein the lease may be renewed periodically. A lock manager data structure is provided to maintain mode compatibility of locks granted to different client nodes for the same object. The process of acquiring or reasserting a lock includes determining whether there are other valid locks in use, as well as whether a valid lock is in operation in a conflicting or compatible mode with a requested lock. A new lock lease may be granted and a lock lease which has expired may be reasserted if a conflicting lease is not present.

    摘要翻译: 提供了一种用于断言分布式文件系统中的锁的方法和系统。 所有分布式锁具有有限时间段的租赁,其中可以周期性地更新租赁。 提供了一个锁管理器数据结构,以保持为相同对象授予不同客户机节点的锁的模式兼容性。 获取或重新设置锁的过程包括确定是否存在其他正在使用的有效锁,以及有效锁是否在与请求的锁的冲突或兼容模式下操作。 如果不存在冲突的租约,则可以授予新的锁租赁,并且已经过期的锁租赁可能被重新生效。

    System and method for finding preempted threads in a multi-threaded application
    9.
    发明授权
    System and method for finding preempted threads in a multi-threaded application 失效
    在多线程应用程序中查找抢占线程的系统和方法

    公开(公告)号:US06418460B1

    公开(公告)日:2002-07-09

    申请号:US08802802

    申请日:1997-02-18

    IPC分类号: G06F900

    CPC分类号: G06F9/4843 G06F9/462

    摘要: A system and method for inexpensively detecting preempted execution entities such as threads without kernel involvement. In a computer system having a memory and one or more processors, a shared memory arena is formed in user space within the memory. A preempt bit vector is then formed within the shared memory arena such that the preempt bit vector is accessible to any of a plurality of execution entities running in user mode. The preempt bit vector includes a plurality of rbits, wherein each rbit is associated with one of the plurality of execution entities and wherein an rbit is marked whenever its associated execution entity is preempted. Detection of preempted threads then becomes a matter of reading, via program code executing in user mode on one of the plurality of processors, bits in the preempt bit vector to detect preempted execution entities.

    摘要翻译: 一种用于廉价检测抢占执行实体(如没有内核参与的线程)的系统和方法。 在具有存储器和一个或多个处理器的计算机系统中,在存储器内的用户空间中形成共享存储器竞技场。 然后在共享存储器竞技场内形成先占比特向量,使得抢占比特向量可以以用户模式运行的多个执行实体中的任何一个访问。 抢占比特向量包括多个rbits,其中每个rbit与多个执行实体中的一个相关联,并且其中每当其相关联的执行实体被抢占时,rbit被标记。 然后,通过在多个处理器之一上的用户模式下执行的程序代码来检测抢占的线程成为读取的问题,以检测抢占的执行实体。