会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • System, method and computer program product for multi-level file-sharing by concurrent users
    • 并发用户多级文件共享的系统,方法和计算机程序产品
    • US07676526B1
    • 2010-03-09
    • US11934752
    • 2007-11-03
    • Serguei M. BeloussovStanislav S. ProtassovAlexander G. Tormasov
    • Serguei M. BeloussovStanislav S. ProtassovAlexander G. Tormasov
    • G06F17/30
    • G06F17/30067Y10S707/99932Y10S707/99933Y10S707/99943Y10S707/99954
    • A method of accessing a shareable computer file includes receiving a request to access the shareable computer file, retrieving a file ID from a stub file corresponding to the shareable computer file, retrieving a file name from a database corresponding to the file ID, accessing the shareable computer file if a user has not modified the shareable computer file, and accessing a modified copy of the shareable file stored in the stub file if the user has modified the shareable computer file. A database is generated in operating system space or accessed using the operating system, and includes file IDs and their corresponding file names for shareable computer files. The stub file is generated locally to correspond to the shareable computer file, and includes a modified copy of the shareable computer file if the shareable computer file has been modified, and a link to the shareable computer file if the shareable computer file has not been modified. If the shareable computer file has not been modified, a read-only operation retrieves any of file contents, file position and file size from the shareable computer file. File attributes relating to the shareable computer file can be retrieved from the stub file. The database is provided by the operating system for use by a Virtual Private Server.
    • 访问可共享计算机文件的方法包括接收访问可共享计算机文件的请求,从对应于可共享计算机文件的存根文件检索文件ID,从与文件ID相对应的数据库中检索文件名,访问可共享的计算机文件 如果用户没有修改可共享的计算机文件,并且如果用户已经修改了可共享的计算机文件,则访问存储在存根文件中的可共享文件的修改的副本的计算机文件。 在操作系统空间中生成数据库或使用操作系统访问数据库,并包含可共享计算机文件的文件ID及其相应的文件名。 存根文件在本地生成以对应于可共享计算机文件,并且如果可共享计算机文件已被修改,则包括可共享计算机文件的修改副本,以及如果可共享计算机文件未被修改的链接到可共享计算机文件 。 如果可共享的计算机文件未被修改,则只读操作从可共享计算机文件中检索文件内容,文件位置和文件大小中的任何一个。 可以从存根文件检索与可共享计算机文件相关的文件属性。 数据库由操作系统提供,供虚拟专用服务器使用。
    • 3. 发明授权
    • Fault tolerant distributed storage method and controller using (N,K) algorithms
    • 容错分布式存储方法和使用(N,K)算法的控制器
    • US07418620B1
    • 2008-08-26
    • US11004078
    • 2004-12-06
    • Alexander G. TormasovSerguei M. BeloussovStanislav S. Protassov
    • Alexander G. TormasovSerguei M. BeloussovStanislav S. Protassov
    • G06F11/00
    • G06F11/1076G06F2211/1028
    • Data sets and blocks are stored in a set of independent, functionally equivalent chunks. These chunks are placed on different elements of a distributed network to achieve pre-defined level of fault tolerance. Terms of fault tolerance are defined in terms of amount of unavailable sites in the network allowing receipt and access to the data block. Maximal and minimal number of chunks available are variable method parameters. The minimal amount of data chunks K needed to restore a data block is defined. The size of each chunk is approximately 1/K of the original block size. The maximal amounts of chunks are defined during distribution operation and depend upon a requested fault tolerance level. Redundancy in data storage is minimized and varies dynamically by changing the total amount of chunks available. Significant increase in data transfer rate is possible because all block chunks could be transferred in parallel and independently.
    • 数据集和块存储在一组独立的功能等同的块中。 这些块被放置在分布式网络的不同元件上,以实现预定义的容错级别。 根据允许接收和访问数据块的网络中不可用站点的数量来定义容错条款。 可用的最大和最小数量的块是可变方法参数。 定义了恢复数据块所需的最小量的数据块K。 每个块的大小约为原始块大小的1 / K。 在分配操作期间定义最大量的块,并且取决于请求的容错级别。 数据存储的冗余被最小化,并通过改变可用块的总量来动态变化。 数据传输速率的显着增加是可能的,因为所有块块可以并行和独立传输。
    • 4. 发明授权
    • System, method, and computer program product for group scheduling of computer resources
    • 计算机资源群组调度的系统,方法和计算机程序产品
    • US07665090B1
    • 2010-02-16
    • US10793881
    • 2004-03-08
    • Alexander G. TormasovSerguei M. BeloussovStanislav S. Protassov
    • Alexander G. TormasovSerguei M. BeloussovStanislav S. Protassov
    • G06F9/46
    • G06F9/4881
    • A system, method and computer program product for managing computer resources in a computer system running an operating system and a plurality of processes grouped into at least two groups. A set of resource limits corresponds to the processes. A scheduler of resource allocation allocates resources to each process such that total resource allocation to a group to which that process belongs remains constant. The resources comprise, e.g., network bandwidth, number of network connections, I/O bandwidth for peripheral devices, number of operations in a period of time for service operation with countable requests for service, number of operations in a period of time for a daemon with countable requests for service, permission for execution of operation, number of security descriptors, and number of terminals. The scheduler reallocates the resources based on a predictive algorithm, or based on process priority, or based on relative weighting of the processes. The scheduler can adjust an increase and a decrease of the resources available to a particular process. The scheduler is capable of increasing a resource allocation restriction to one process by and by waiting for that resource to become available. The scheduler is capable of increasing a resource allocation to one process by reducing allocation restriction to other processes in the same group on a basis proportional to their current use of that resource. The scheduler can reduce a resource allocation to a particular process based on a history of consumption of the resource by that process and a history of consumption of other resources by that process.
    • 一种用于管理运行操作系统的计算机系统中的计算机资源的系统,方法和计算机程序产品以及分组为至少两组的多个进程。 一组资源限制对应于进程。 资源分配调度器将资源分配给每个进程,使得对该进程所属的组的总资源分配保持不变。 资源包括网络带宽,网络连接数,外围设备的I / O带宽,服务操作的一段时间内的可操作请求服务的操作次数,守护进程的一段时间内的操作次数 具有可数服务请求,执行许可,安全描述符数量和终端数。 调度器基于预测算法或基于进程优先级或基于进程的相对权重重新分配资源。 调度器可以调整特定进程可用资源的增加和减少。 调度器能够通过等待该资源变得可用来增加对一个进程的资源分配限制。 调度器能够通过以与当前使用该资源成正比的方式减少对同一组中的其他进程的分配限制来增加对一个进程的资源分配。 调度器可以基于通过该过程的资源的消耗历史和通过该过程的其他资源的消耗历史来减少对特定进程的资源分配。
    • 6. 发明授权
    • Hierarchical repository for configuration-related and performance-related information related to computerized systems
    • 与计算机化系统相关的配置相关和性能相关信息的分层存储库
    • US07433872B2
    • 2008-10-07
    • US11115095
    • 2005-04-26
    • Yariv RosenbachAvishai AbrahamiGregory Bondar
    • Yariv RosenbachAvishai AbrahamiGregory Bondar
    • G06F17/30
    • G06F9/5044G06F2209/503Y10S707/99932
    • Method allowing a computerized manager to transparently allocate computational resources to a plurality of users. A plurality of computers or servers are provided for accommodating the computational resources or for storing data. These computational resources and the data are arranged as a hierarchical repository. A root computer is used as an interface between the users and the computers or servers. The root computer is capable of communicating with the users, with the computers or with servers. The computers or servers are controlled and the manager is allowed to allocate computer resources to the users. Information is stored in the computers or servers, in a local repository or in the system files of the computers or servers. Whenever desired, stored information is retrieved from the computers or servers and then the manager dynamically allocates computational resources that are required for each of the users through the root computer, essentially without interfering with the continuous operation of the users.
    • 允许计算机化管理器将计算资源透明地分配给多个用户的方法。 提供多个计算机或服务器用于容纳计算资源或用于存储数据。 这些计算资源和数据被排列为分层存储库。 根计算机用作用户和计算机或服务器之间的接口。 根计算机能够与用户,计算机或服务器进行通信。 控制计算机或服务器,并允许管理员向用户分配计算机资源。 信息存储在计算机或服务器,本地存储库或计算机或服务器的系统文件中。 无论何时需要,从计算机或服务器检索存储的信息,然后管理者基本上不干扰用户的连续操作来动态地分配通过根计算机为每个用户所需的计算资源。
    • 7. 发明授权
    • System and method for using file system snapshots for online data backup
    • 使用文件系统快照进行在线数据备份的系统和方法
    • US07246211B1
    • 2007-07-17
    • US10624858
    • 2003-07-22
    • Serguei BeloussovStanislav ProtassovAlexander Tormasov
    • Serguei BeloussovStanislav ProtassovAlexander Tormasov
    • G06F12/00G06F12/16G06F12/06
    • G06F11/1466G06F11/1461G06F2201/84
    • A system and method for providing online data backup for a computer system. In which the computer system includes an intermediate block data container. The computer system may utilize the intermediate block data container to manage data block release during the online data backup process. When the data storage driver receives a request to write a block into a data area that has already been copied by the backup procedure, then the required write is performed without limitations. If the incoming write request is directed to an area not yet backed-up, then the write process is suspended and the current state of the given data area is copied to the intermediate data storage container. When the copy procedure is completed, the system will allow the write procedure to be executed. Thus, the content of the data block at the moment the backup procedure commenced is stored in the intermediate block container. The content will be copied from the intermediate block data container by the backup procedure when required. The block will then be flagged and the backup process may continue.
    • 一种用于为计算机系统提供在线数据备份的系统和方法。 其中计算机系统包括中间块数据容器。 计算机系统可以利用中间块数据容器来管理在线数据备份过程中的数据块释放。 当数据存储驱动程序接收到将块写入已由备份过程复制的数据区的请求时,执行所需的写操作。 如果传入的写请求被引导到尚未备份的区域,则暂停写入处理,并将给定数据区的当前状态复制到中间数据存储容器。 当复制过程完成时,系统将允许执行写入过程。 因此,备份过程开始时的数据块的内容被存储在中间块容器中。 当需要时,内容将通过备份过程从中间块数据容器中复制。 该块将被标记,备份过程可能会继续。
    • 9. 发明授权
    • Distributed network data storage system and method
    • 分布式网络数据存储系统及方法
    • US07209973B2
    • 2007-04-24
    • US09918032
    • 2001-07-30
    • Alexander TormasovSergei BeloussovStanislav Protassov
    • Alexander TormasovSergei BeloussovStanislav Protassov
    • G06F15/16
    • H04L67/1008G06F17/30209H04L29/06H04L67/1002H04L67/1021H04L67/1029H04L2029/06054
    • The present invention is a system and method for distributed, highly scalable, wide area peer-to-peer network data storage. The functionally equivalent servers in the system are divided into groups. Each server maintains a dynamic list which is polled to determine the availability of the closest neighbor servers. Each server is switched between the groups of servers to optimize network connectivity parameters. Data and directory files are divided into a plurality of pieces which are stored on different servers. Files are uniformly and independently named, utilizing a tree with a common root, logical pathways, and unique file identifiers. When a server receives a client request for file system access, the plurality of file pieces are collected and sent to the client server from the neighbor servers simultaneously in order to optimize bandwidth. Servers with maximum throughput capacity are utilized for highest transmission speed and reduced processing time.
    • 本发明是用于分布式,高度可扩展的广域对等网络数据存储的系统和方法。 系统中功能等效的服务器分为几组。 每个服务器维护一个动态列表,该列表被轮询以确定最近的邻居服务器的可用性。 每个服务器在服务器组之间切换,以优化网络连接参数。 数据和目录文件被分成存储在不同服务器上的多个片段。 文件被统一和独立地命名,利用具有公共根,逻辑路径和唯一文件标识符的树。 当服务器接收到文件系统访问的客户机请求时,多个文件被同时从邻居服务器收集并发送到客户端服务器,以便优化带宽。 具有最大吞吐能力的服务器被用于最高的传输速度和缩短的处理时间。