公开(公告)号：US06954752B2

公开(公告)日：2005-10-11

申请号：US09909287

申请日：2001-07-19

申请人： Arun Kwangil Iyengar

发明人： Arun Kwangil Iyengar

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30902 ,  H04L67/2847 ,  H04L67/2852 ,  Y10S707/99938 ,  Y10S707/99953

摘要： Techniques for managing data objects in conjunction with a computer system are provided. In a technique for clustering data objects on a disk storage device, the invention comprises maintaining a log of at least a portion of accesses (e.g., read and for write operations) to the data objects; determining from the maintained log a cluster comprised of data objects accessed at substantially similar times; and storing the data objects comprising the cluster in close proximity to one another on the disk storage device. In a technique for prefetching data objects on a disk storage device, the invention comprises receiving a request for a data object in a cluster, determining from the log a probability that at least one other data object in the cluster may be subsequently requested; and, in response to the probability being not less than a predetermined value, retrieving both the requested data object and the at least one other data object. Such clustering and prefetching techniques substantially reduce the number of storage device seeks.

摘要翻译： 提供了与计算机系统一起管理数据对象的技术。 在用于将数据对象聚集在磁盘存储设备上的技术中，本发明包括将数据对象的访问的至少一部分（例如，读取和写入操作）的记录维护在一起; 从维护日志中确定由基本相似的时间访问的数据对象组成的群集; 以及将包括所述集群的数据对象彼此紧密地存储在所述磁盘存储设备上。 在用于在盘存储设备上预取数据对象的技术中，本发明包括接收对群集中的数据对象的请求，从日志中确定可以随后请求群集中的至少一个其他数据对象的概率; 并且响应于概率不小于预定值，检索所请求的数据对象和所述至少一个其他数据对象。 这种聚类和预取技术大大减少了存储设备寻找的数量。

公开(公告)号：US06820125B1

公开(公告)日：2004-11-16

申请号：US09641415

申请日：2000-08-16

申请人： Daniel Manuel Dias ,  Arun Kwangil Iyengar

发明人： Daniel Manuel Dias ,  Arun Kwangil Iyengar

IPC分类号： G06F1516

CPC分类号： H04L63/08 ,  H04L29/06 ,  H04L63/04 ,  H04L67/303 ,  H04L67/42 ,  H04L69/329

摘要： In a client-server environment having a server group including one or more participating servers and one or more controller servers, where each participating server can communicate with at least one controller server, a method for coordinating actions among the servers in the server group comprising the steps of: (1) communicating between a client and at least one of the servers in the server group using a protocol that has limited or no defined procedures for passing state information between the client and the servers; (2) transmitting a request for an action from the client to one of the servers; and (3) communicating among a plurality of servers with at least one controller server coordinating actions of at least some of the servers in response to the request. A preferred embodiment of the method includes providing client identification information once by the client during a conversation, verifying the client identification information by one or more controller servers, generating client authentication information by one or more controller servers that is preserved in the conversation, and using the preserved client authentication information to automatically authenticate the client during the remainder of the conversation. Another preferred embodiment of the method includes transmitting a request by a client requiring participation by a plurality of servers and communicating among the servers with at least one controller server coordinating the actions of a plurality of servers in response to the request from the client.

摘要翻译： 在具有包括一个或多个参与服务器和一个或多个控制器服务器的服务器组的客户机 - 服务器环境中，其中每个参与服务器可以与至少一个控制器服务器通信，用于协调服务器组中的服务器之间的动作的方法，包括 步骤：（1）使用具有有限或没有定义的用于在客户端和服务器之间传递状态信息的过程的协议来在客户端与服务器组中的至少一个服务器之间进行通信; （2）从客户端向服务器之一发送动作请求; 以及（3）响应于该请求，在多个服务器之间与至少一个控制器服务器进行通信以协调至少一些服务器的动作。 该方法的优选实施例包括在对话期间由客户端提供一次客户端识别信息，通过一个或多个控制器服务器验证客户端标识信息，通过一个或多个在会话中保存的控制器服务器生成客户端认证信息，以及使用 保留的客户端身份验证信息，以便在剩余的会话期间自动验证客户端。 该方法的另一个优选实施例包括：发送由客户端请求多个服务器参与的请求，并且响应于来自客户端的请求，通过协调多个服务器的动作的至少一个控制器服务器在服务器之间进行通信。

公开(公告)号：US06598121B2

公开(公告)日：2003-07-22

申请号：US09993837

申请日：2001-11-06

申请人： James R. H. Challenger ,  Paul Michael Dantzig ,  Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric M. Levy-Abegnoli

发明人： James R. H. Challenger ,  Paul Michael Dantzig ,  Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric M. Levy-Abegnoli

IPC分类号： G06F1200

CPC分类号： G06F12/0811 ,  G06F12/121

摘要： A system and method for hierarchically caching objects includes one or more level 1 nodes, each including at least one level 1 cache; one or more level 2 nodes within which the objects are permanently stored or generated upon request, each level 2 node coupled to at least one of the one or more level 1 nodes and including one or more level 2 caches; and means for storing, in a coordinated manner, one or more objects in at least one level 1 cache and/or at least one level 2 cache, based on a set of one or more criteria. Furthermore, in a system adapted to receive requests for objects from one or more clients, the system having a set of one or more level 1 nodes, each containing at least one level 1 cache, a method for managing a level 1 cache includes the steps of applying, for part of the at least one level 1 cache, a cache replacement policy designed to minimize utilization of a set of one or more resources in the system; and using, for other parts of the at least one level 1 cache, one or more other cache replacement policies designed to minimize utilization of one or more other sets of one or more resources in the system.

公开(公告)号：US06574715B2

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

申请号：US10157672

申请日：2002-05-29

申请人： James R. H. Challenger ,  George Prentice Copeland ,  Paul Michael Dantzig ,  Arun Kwangil Iyengar ,  Matthew Dale McClain

发明人： James R. H. Challenger ,  George Prentice Copeland ,  Paul Michael Dantzig ,  Arun Kwangil Iyengar ,  Matthew Dale McClain

IPC分类号： G06F1200

CPC分类号： H04L67/1095 ,  G06F17/30902 ,  H04L29/06 ,  H04L67/2852 ,  H04L69/329

摘要： A method and apparatus in a data processing system for caching data in an internal cache and in an external cache A set of fragments is received for caching. A location is identified to store each fragment within the plurality of fragments based on a rate of change of data in each fragment. The set of fragments is stored in the internal cache and the external cache using the location identified for each fragment within the plurality of fragments.

公开(公告)号：US06457103B1

公开(公告)日：2002-09-24

申请号：US09359279

申请日：1999-07-22

申请人： James R. H. Challenger ,  Christopher Shane Claussen ,  George Prentice Copeland ,  Paul Michael Dantziq ,  Arun Kwangil Iyengar ,  Matthew Dale McClain

发明人： James R. H. Challenger ,  Christopher Shane Claussen ,  George Prentice Copeland ,  Paul Michael Dantziq ,  Arun Kwangil Iyengar ,  Matthew Dale McClain

IPC分类号： G06F1208

CPC分类号： G06F17/30902

摘要： A method and apparatus in a data processing system for caching a page containing dynamic content. Dynamic content in a page is divided into a plurality of objects. Each object is stored within the plurality of objects in a cache, wherein an object within the plurality of objects is selectively stored in the cache based on a rate change in data of the object.

摘要翻译： 一种用于缓存包含动态内容的页面的数据处理系统中的方法和装置。 页面中的动态内容被分成多个对象。 每个对象被存储在高速缓存中的多个对象内，其中基于对象的数据的速率变化，多个对象内的对象被选择性地存储在高速缓存中。

公开(公告)号：US09965731B2

公开(公告)日：2018-05-08

申请号：US11766932

申请日：2007-06-22

申请人： Paul M. Dantzig ,  Donna N. Dillenberger ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

发明人： Paul M. Dantzig ,  Donna N. Dillenberger ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

IPC分类号： G06Q10/06 ,  G06F9/50

CPC分类号： G06Q10/06 ,  G06F9/5038 ,  G06F2209/5021

摘要： Improved techniques are disclosed for processing transactions or requests in a data processing system. For example, a method for processing requests in a system including a plurality of nodes includes the following steps. At least two nodes of the plurality of nodes receive a plurality of requests. The two nodes exchange information to determine an order for processing requests. The two nodes process the requests in accordance with the order. The order may include a total order or a partial order.

公开(公告)号：US08863144B2

公开(公告)日：2014-10-14

申请号：US12723914

申请日：2010-03-15

申请人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

发明人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

IPC分类号： G06F9/46 ,  G06F15/173 ,  G06F9/50

CPC分类号： G06F9/46 ,  G06F9/505 ,  G06F2209/501 ,  G06F2209/5019 ,  H04L67/1008

摘要： In a computer system comprising a plurality of computing devices wherein the plurality of computing devices processes a plurality of tasks and each task has a task type, a method for determining overheads associated with task types comprises the following steps. Overheads are estimated for a plurality of task types. One of the plurality of computing devices is selected to execute one of the plurality of tasks, wherein the selection comprises estimating load on at least a portion of the plurality of computing devices from tasks assigned to at least a portion of the plurality of computing devices and the estimates of overheads of the plurality of task types. One or more of the estimates of overheads of the plurality of task types are varied.

摘要翻译： 在包括多个计算设备的计算机系统中，其中所述多个计算设备处理多个任务，并且每个任务具有任务类型，用于确定与任务类型相关联的开销的方法包括以下步骤。 估计多个任务类型的开销。 选择多个计算设备中的一个来执行多个任务中的一个，其中所述选择包括从分配给所述多个计算设备的至少一部分的任务估计所述多个计算设备的至少一部分上的负载，以及 多个任务类型的开销的估计。 改变多个任务类型的开销的估计中的一个或多个。

公开(公告)号：US08661442B2

公开(公告)日：2014-02-25

申请号：US13118740

申请日：2011-05-31

申请人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

发明人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

IPC分类号： G06F9/46 ,  G06Q40/00

CPC分类号： G06F9/5027 ,  G06F9/5044 ,  G06Q40/04

摘要： Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node.As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

摘要翻译： 自动技术被公开用于最小化包括多个节点的系统中的节点之间的通信，用于执行其中请求类型与特定节点相关联的请求。 例如，技术包括以下步骤。 关于收到的复合请求的频率和包含复合请求的单个请求的信息被维护。 对于频繁出现在复合请求中的多个请求类型，多个请求类型与相同的节点相关联。 作为另一示例，在包括用于执行多个应用的​​多个节点的系统中的用于最小化节点之间的通信的技术包括以下步骤：维护关于所述应用之间的通信量的信息，并使用所述信息将所述应用放置在所述应用上 节点以最小化所述节点之间的通信。

公开(公告)号：US08645573B2

公开(公告)日：2014-02-04

申请号：US13433529

申请日：2012-03-29

申请人： Arun Kwangil Iyengar

发明人： Arun Kwangil Iyengar

IPC分类号： G06F15/16

CPC分类号： G06F11/3466 ,  G06F11/3409

摘要： Selective compression of data, wherein it is determined which of a number of compression algorithms do not incur an overhead that exceeds available resources. Then, one of the determined algorithms is selected to maximize compression.

摘要翻译： 选择性压缩数据，其中确定多个压缩算法中的哪一个不会引起超出可用资源的开销。 然后，选择确定的算法之一以最大化压缩。

公开(公告)号：US08402130B2

公开(公告)日：2013-03-19

申请号：US12173502

申请日：2008-07-15

申请人： Arun Kwangil Iyengar

发明人： Arun Kwangil Iyengar

IPC分类号： G06F15/16

CPC分类号： G06F11/3466 ,  G06F11/3409

摘要： A method for communicating information from a first computing node to at least one of the following: a storage device and a second computing node. The first computing node is monitored to collect at least one estimate of available resources, and based on this estimate, an amount of data collected is modified. Then, the modified data is sent to at least one of the following: the storage device and the second computing node.

摘要翻译： 一种用于将信息从第一计算节点传送到以下的至少一个的方法：存储设备和第二计算节点。 监视第一计算节点以收集至少一个可用资源的估计，并且基于该估计，修改收集的数据量。 然后，将修改的数据发送到以下至少一个：存储设备和第二计算节点。