Grid service scheduling of related services using heuristics
    11.
    发明申请
    Grid service scheduling of related services using heuristics 有权
    使用启发式的相关服务的网格服务调度

    公开(公告)号:US20040167980A1

    公开(公告)日:2004-08-26

    申请号:US10370817

    申请日:2003-02-20

    IPC分类号: G06F015/173

    摘要: A method and system for creating service instances in a computing grid. The method can include scheduling a service in the computing grid to process at least a portion of a requested transaction. At least one additional service related to the scheduled service can be identified, and a load condition can be assessed in the at least one additional service related to the scheduled service. A new instance of the at least one additional service can be created if the load condition exceeds a threshold load. In this way, an enhanced capacity for processing transactions can be established in the related services in advance of a predicted increase in load in the grid.

    摘要翻译: 用于在计算网格中创建服务实例的方法和系统。 该方法可以包括在计算网格中调度服务以处理所请求的交易的至少一部分。 可以识别与调度服务相关的至少一个附加服务,并且可以在与所调度的服务相关的至少一个附加服务中评估负载条件。 如果负载条件超过阈值负载,则可以创建至少一个附加服务的新实例。 以这种方式,可以在网格中的负载预测的增加之前在相关服务中建立用于处理交易的增强的容量。

    Programmatically allocating memory among competing services in a distributed computing environment
    12.
    发明申请
    Programmatically allocating memory among competing services in a distributed computing environment 有权
    在分布式计算环境中以编程方式在竞争服务中分配内存

    公开(公告)号:US20040111514A1

    公开(公告)日:2004-06-10

    申请号:US10315376

    申请日:2002-12-10

    IPC分类号: G06F015/173

    摘要: Techniques are disclosed for programmatically allocating memory among competing services in a distributed computing environment. Characteristics of web request streams and formulas for cache hit rates and client response times are used to create an objective function for memory allocation, such that maximum benefit can be realized from the memory allocations. When a particular service is allocated more memory, it can store more of its objects in cache, which improves client response time. Optionally, information from service level agreements may be used as input to the memory allocation computations.

    摘要翻译: 公开了用于在分布式计算环境中的竞争服务之间以编程方式分配存储器的技术。 用于缓存命中率和客户端响应时间的Web请求流和公式的特征用于创建用于存储器分配的目标函数,从而可以从存储器分配中实现最大的收益。 当特定服务被分配更多的内存时,它可以将更多的对象存储在缓存中,这样可以改善客户端的响应时间。 可选地,来自服务级别协议的信息可以用作对存储器分配计算的输入。

    Flexible system and method for mirroring data
    13.
    发明申请
    Flexible system and method for mirroring data 有权
    灵活的数据镜像系统和方法

    公开(公告)号:US20040024979A1

    公开(公告)日:2004-02-05

    申请号:US10211686

    申请日:2002-08-02

    IPC分类号: G06F012/16

    摘要: A flexible data mirroring system and method are adapted for use in a data processing system having first and second data storage devices. Upon receiving notification of a file update to be written to the first data storage device a mirror mode and mirror event associated with the updated file are determined from mirror information that has been provisioned on a per-file, per-directory or per-volume, etc. basis. The file update is mirrored to the second data storage device according to the provisioned mirror mode and mirror event. If the mirror mode is continuous, the mirror operation proceeds immediately. If the mirror mode is discrete, the file update is noted and the mirror operation proceeds following occurrence of the file's mirror event.

    摘要翻译: 灵活的数据镜像系统和方法适用于具有第一和第二数据存储设备的数据处理系统。 在接收到要写入到第一数据存储设备的文件更新的通知时,根据已经在每个文件,每个目录或每个卷上提供的镜像信息来确定与更新的文件相关联的镜像模式和镜像事件, 等等。 根据配置的镜像模式和镜像事件,将文件更新镜像到第二个数据存储设备。 如果镜像模式是连续的,镜像操作立即进行。 如果镜像模式是离散的,则会记录文件更新,镜像操作在文件的镜像事件发生后继续进行。

    Processing service level agreement (SLA) terms in a caching component of a storage system
    14.
    发明申请
    Processing service level agreement (SLA) terms in a caching component of a storage system 失效
    在存储系统的缓存组件中处理服务级别协议(SLA)术语

    公开(公告)号:US20030229759A1

    公开(公告)日:2003-12-11

    申请号:US10162844

    申请日:2002-06-05

    IPC分类号: G06F012/12

    CPC分类号: G06F12/0866 G06F12/0804

    摘要: A method and system for processing Service Level Agreement (SLA) terms in a caching component in a storage system. The method can include monitoring cache performance for groups of data in the cache, each the group having a corresponding SLA. Overfunded SLAs can be identified according to the monitored cache performance. In consequence, an entry can be evicted from among one of the groups which correspond to an identified one of the overfunded SLAs. In one aspect of the present invention, the most overfunded SLA can be identified, and an entry can be evicted from among the group which corresponds to the most overfunded SLA.

    摘要翻译: 用于处理存储系统中的缓存组件中的服务级别协议(SLA)术语的方法和系统。 该方法可以包括监视缓存中的数据组的高速缓存性能,每个组具有对应的SLA。 可以根据监视的缓存性能来识别资源超标的SLA。 因此,可以从对应于所识别的一个超量供应的SLA的组中的一个组中逐出一个条目。 在本发明的一个方面,可以识别出最多资源的SLA,并且可以从对应于资源最多的SLA的群组中逐出一个条目。

    Intelligent content placement in a distributed computing network
    15.
    发明申请
    Intelligent content placement in a distributed computing network 审中-公开
    分布式计算网络中的智能内容放置

    公开(公告)号:US20030046357A1

    公开(公告)日:2003-03-06

    申请号:US09943560

    申请日:2001-08-30

    IPC分类号: G06F015/167 G06F015/173

    摘要: Techniques are disclosed for storing document content in a manner which improves efficiency and/or speed of servicing content requests. Expected and/or observed popularity of stored objects is used to determine where a particular object should be physically placed in a distributed computing network. The disclosed techniques may be used for initially placing objects and/or for subsequently placing objects at different and/or additional locations in the network.

    摘要翻译: 公开了用于以提高服务内容请求的效率和/或速度的方式存储文档内容的技术。 使用存储对象的预期和/或观察到的受欢迎程度来确定特定对象应在物理上放置在分布式计算网络中的位置。 所公开的技术可以用于初始放置对象和/或用于随后将对象放置在网络中的不同和/或附加位置处。

    Efficiently serving large objects in a distributed computing network
    16.
    发明申请
    Efficiently serving large objects in a distributed computing network 审中-公开
    在分布式计算网络中有效地服务大型对象

    公开(公告)号:US20030046335A1

    公开(公告)日:2003-03-06

    申请号:US09943562

    申请日:2001-08-30

    IPC分类号: G06F015/16

    摘要: Techniques are disclosed for improving the serving of large objects (equivalently, large files) in distributed computing networks which include network-attached storage (nullNASnull). Existing features of Hypertext Transfer Protocol (nullHTTPnull) and of Web server implementations are leveraged to achieve performance improvements in a novel way, and thereby greatly facilitate introduction of the present invention into existing networking environments. In particular, objects meeting certain criteria may be served using nullredirect filesnull in which a redirect status code is used to cause content retrieval requests to be automatically redirected from the requesting client device to the NAS, such that the requested content is served from the NAS rather than through a Web server from a Web server farm.

    摘要翻译: 公开了用于改进包括网络连接存储(“NAS”)在分布式计算网络中的大对象(相当于大文件)的服务的技术。 利用超文本传输​​协议(“HTTP”)和Web服务器实现的现有特征以新颖的方式实现性能改进,从而极大地促进将本发明引入现有的网络环境中。 特别地,可以使用“重定向文件”来使用满足某些标准的对象,其中使用重定向状态代码来使得内容检索请求被自动地从请求客户端设备重定向到NAS,使得所请求的内容从 NAS而不是通过来自Web服务器场的Web服务器。

    Grid quorum
    17.
    发明申请
    Grid quorum 有权
    网格法定人数

    公开(公告)号:US20040215614A1

    公开(公告)日:2004-10-28

    申请号:US10424034

    申请日:2003-04-25

    IPC分类号: G06F017/30

    摘要: The present invention is a grid quorum system, method and apparatus. In a cluster of resources in a computing grid, a resource locking method can include acquiring a temporally limited lock on a grid service in the computing grid. Upon expiration of the temporally limited lock, a renewal of the temporally limited lock can be requested. Subsequently, the temporally limited lock can be renewed if a renewal has been granted by the grid service in response to the request. Notably, the renewing step can include determining whether the cluster has been partitioned into a plurality of sub-clusters. If the cluster has been partitioned, a parent sub-cluster can be identified and the temporally limited lock can be renewed only if a quorum exists in the parent sub-cluster.

    摘要翻译: 本发明是网格法定系统,方法和装置。 在计算网格中的资源集群中,资源锁定方法可以包括在计算网格中的网格服务上获取时间上有限的锁定。 在暂时限制的锁定结束时,可以请求对时间有限的锁的更新。 随后,如果电网服务响应于该请求而授予更新,则可以更新时间有限的锁。 值得注意的是,更新步骤可以包括确定簇是否已被划分成多个子簇。 如果集群已被分区,则可以识别父子集群,并且只有在父子集群中存在仲裁时,才能更新时间限制的锁。

    Method, system and program product for auditing electronic transactions based on biometric readings
    18.
    发明申请
    Method, system and program product for auditing electronic transactions based on biometric readings 有权
    基于生物特征数据的电子交易审计方法,系统和程序产品

    公开(公告)号:US20040162987A1

    公开(公告)日:2004-08-19

    申请号:US10369303

    申请日:2003-02-19

    IPC分类号: H04L009/32

    CPC分类号: G06F21/32 G06F2221/2101

    摘要: Under the present invention a biometric reading, an audit point identity and transaction information are collected for each electronic transaction. Upon collection, the biometric reading, audit point identity and transaction information are packaged into an audit packet, which is then encrypted and stored in a log or the like. One or more of the electronic transactions can then be audited using this stored information. Specifically, for the electronic transactions that are to be audited, the corresponding audit packets are retrieved from storage and decrypted. Once decrypted, the biometric readings will be compared to each other to determine whether a set (e.g., one ore more) of the electronic transactions is potentially fraudulent. Typically, a set of electronic transactions is potentially fraudulent if a plurality of the biometric readings are identical or too similar to each other.

    摘要翻译: 根据本发明,为每个电子交易收集生物识别阅读,审核点身份和交易信息。 收集后,将生物识别读取,审核点身份和交易信息打包成审核数据包,然后将其加密并存储在日志等中。 然后可以使用该存储的信息来审计一个或多个电子交易。 具体来说,对于要被审计的电子交易,从存储中检索相应的审计数据包并进行解密。 一旦解密,将比较生物特征读数以确定电子交易的集合(例如,一个或多个)是否潜在的欺诈。 通常,如果多个生物特征读数彼此相同或太相似,则一组电子交易可能是欺诈性的。

    Method, system and program products for distributing portal content processing
    20.
    发明申请
    Method, system and program products for distributing portal content processing 有权
    用于分发门户内容处理的方法,系统和程序产品

    公开(公告)号:US20040054749A1

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

    申请号:US10242130

    申请日:2002-09-12

    IPC分类号: G06F015/16

    摘要: The present invention generally relates to a method, system and program product for distributing portal content processing. Specifically, a request for portal content is received on a surrogate system and then passed to a portal system. The portal system will obtain and aggregate a first type of the requested content, and then package the aggregated content into a response. The response will also include place holders that correspond to the remaining type of the requested content. The response will then be transmitted to the surrogate system, which will, based upon the place holders, obtain the remaining type of portal content. Once obtained, the remaining type of portal content will replace the place holders in the response, and the response will be rendered for the requesting portal user.

    摘要翻译: 本发明一般涉及用于分发门户内容处理的方法,系统和程序产品。 具体来说,在代理系统上接收到门户内容的请求,然后传递给门户系统。 门户系统将获取并聚合所请求内容的第一类,然后将聚合的内容打包成响应。 响应还将包括对应于所请求内容的剩余类型的占位符。 然后,响应将被传送到代理系统,代理系统将基于占位符获得剩余类型的门户内容。 一旦获得,门户内容的剩余类型将替换响应中的占位符,并且将为请求的门户用户提供响应。