公开(公告)号：US08438336B2

公开(公告)日：2013-05-07

申请号：US13237236

申请日：2011-09-20

Applicant: Kin-Chung Fung ,  Mark R. Scheevel

Inventor： Kin-Chung Fung ,  Mark R. Scheevel

IPC: G06F12/16

CPC classification number: G06F12/124 ,  G06F11/3466 ,  G06F12/0866 ,  G06F2201/885 ,  G06F2212/463

Abstract: Embodiments disclosed herein utilize statistical approximations to manage large filesystem-based caches based on imperfect information. When removing entries from a large cache, which may have a million or more entries, the cache manager does not need to find the absolutely oldest entry that has been accessed the least recently. Instead, it suffices to find an entry that is older than most. In embodiments disclosed herein, statistical sampling of the cache is performed to produce models of different properties of the cache, including the number of entries, distribution of access times, distribution of entry sizes, etc. The models are then used to guide decisions that involve those properties. The size of the samples can be adjusted to balance the cost of acquiring the samples against the confidence level of the models produced by the samples. To achieve randomness, entries are stored using prefixes of addresses generated via a message-digest function.

Abstract translation: 本文公开的实施例使用统计近似来基于不完美信息来管理大型基于文件系统的高速缓存。 当从可能具有百万以上条目的大型缓存中删除条目时，缓存管理器不需要找到最近访问的绝对最旧的条目。 相反，只需找到一个比大多数的条目。 在本文公开的实施例中，执行高速缓存的统计采样以产生高速缓存的不同属性的模型，包括条目的数量，访问时间的分布，入口大小的分布等。然后，使用模型来指导涉及 那些属性。 可以调整样品的尺寸以平衡采样的成本与样品产生的模型的置信水平。 为了实现随机性，使用通过消息摘要功能生成的地址前缀来存储条目。

公开(公告)号：US08364719B2

公开(公告)日：2013-01-29

申请号：US13085362

申请日：2011-04-12

Applicant: Mark R. Scheevel ,  Timothy A. Ozor ,  Greg Hilton ,  Jeffrey M. Collins

Inventor： Mark R. Scheevel ,  Timothy A. Ozor ,  Greg Hilton ,  Jeffrey M. Collins

IPC: G06F17/30

CPC classification number: G06F17/30374 ,  G06F17/30292 ,  G06F17/30339 ,  G06F17/30575 ,  G06F17/30587 ,  G06F17/3089 ,  G06F21/6272

Abstract: A method and system disclosed herein can be used to determine relationships between objects, determining which of those relationships are significant for a specific action, and determining physical dependencies between the objects. The method and system can be used to perform actions consistent with integrity constraints, and therefore, performs the actions in the correct order with a reduced likelihood of errors. The method and system are highly beneficial in that they can significantly enhance content management and can be implemented without having to write new or edit existing applications. Also, existing content data and applications may be used without any changes.

Abstract translation: 本文公开的方法和系统可以用于确定对象之间的关系，确定这些关系中的哪一个对于特定动作是重要的，以及确定对象之间的物理依赖性。 方法和系统可用于执行与完整性约束一致的操作，因此，以降低的错误可能性以正确的顺序执行操作。 该方法和系统是非常有益的，因为它们可以显着增强内容管理，并且可以实现，而无需编写新的或编辑现有的应用程序。 此外，可以使用现有的内容数据和应用程序而没有任何改变。

公开(公告)号：US20120011324A1

公开(公告)日：2012-01-12

申请号：US13237236

申请日：2011-09-20

Applicant: Kin-Chung Fung ,  Mark R. Scheevel

Inventor： Kin-Chung Fung ,  Mark R. Scheevel

IPC: G06F12/12

CPC classification number: G06F12/124 ,  G06F11/3466 ,  G06F12/0866 ,  G06F2201/885 ,  G06F2212/463

Abstract: Embodiments disclosed herein utilize statistical approximations to manage large filesystem-based caches based on imperfect information. When removing entries from a large cache, which may have a million or more entries, the cache manager does not need to find the absolutely oldest entry that has been accessed the least recently. Instead, it suffices to find an entry that is older than most. In embodiments disclosed herein, statistical sampling of the cache is performed to produce models of different properties of the cache, including the number of entries, distribution of access times, distribution of entry sizes, etc. The models are then used to guide decisions that involve those properties. The size of the samples can be adjusted to balance the cost of acquiring the samples against the confidence level of the models produced by the samples. To achieve randomness, entries are stored using prefixes of addresses generated via a message-digest function.

Abstract translation: 本文公开的实施例使用统计近似来基于不完美信息来管理大型基于文件系统的高速缓存。 从大型缓存中删除条目（可能有百万以上的条目）时，缓存管理器不需要找到最近访问的绝对最旧的条目。 相反，只需找到一个比大多数的条目。 在本文公开的实施例中，执行高速缓存的统计采样以产生高速缓存的不同属性的模型，包括条目的数量，访问时间的分布，入口大小的分布等。然后，使用模型来指导涉及 那些属性。 可以调整样品的尺寸以平衡采样的成本与样品产生的模型的置信水平。 为了实现随机性，使用通过消息摘要功能生成的地址前缀来存储条目。

公开(公告)号：US4616315A

公开(公告)日：1986-10-07

申请号：US690842

申请日：1985-01-11

Applicant: Gary L. Logsdon ,  Mark R. Scheevel ,  Michael A. Winchell

Inventor： Gary L. Logsdon ,  Mark R. Scheevel ,  Michael A. Winchell

IPC: G06F12/00 ,  G06F9/44 ,  G06F9/45

CPC classification number: G06F9/4436

Abstract: A system memory for a reduction processor which evaluates programs stored as binary graphs employing variable-free applicative language codes. These graphs are made up of nodes, each of which exists in memory and contains as its most significant bit a mark bit which when set indicates that the node is being used in a graph and when reset indicates that the node or storage location is available for future use by the processor. In order to accommodate the scanning of a number of storage locations in parallel, the system memory is divided into a node memory and the mark bit memory so that the mark bits for a number of sequential storage locations can be examined in parallel to determine which node locations are free for use by the graph manager.

Abstract translation: 一种用于还原处理器的系统存储器，其使用无变量的应用语言代码评估存储为二进制图形的程序。 这些图形由节点组成，每个节点都存在于存储器中，并且包含最高有效位的标记位，当设置指示节点正在图形中使用时，并且当复位指示节点或存储位置可用于 未来由处理器使用。 为了平行地适应多个存储位置的扫描，系统存储器被划分为节点存储器和标记位存储器，以便可并行地检查多个顺序存储位置的标记位以确定哪个节点 位置可由图表管理员自由使用。

公开(公告)号：US08452925B2

公开(公告)日：2013-05-28

申请号：US12904937

申请日：2010-10-14

Applicant: Lee Shepstone ,  Conleth S. O'Connell, Jr. ,  Mark R. Scheevel ,  Newton Isaac Rajkumar ,  Jamshid Afshar, Jr. ,  Puhong You ,  Brett J. Larsen ,  David Dean Caldwell

Inventor： Lee Shepstone ,  Conleth S. O'Connell, Jr. ,  Mark R. Scheevel ,  Newton Isaac Rajkumar ,  Jamshid Afshar, Jr. ,  Puhong You ,  Brett J. Larsen ,  David Dean Caldwell

IPC: G06F13/00

CPC classification number: G06F17/30902

Abstract: Systems and methods for managing cached content are disclosed. More particularly, embodiments disclosed herein may allow cached content to be updated (e.g. regenerated or replaced) in response to a notification. Specifically, embodiments disclosed herein may process a notification pertaining to content stored in a cache. Processing the notification may include locating cached content associated with the notification. After the cached content which corresponds to the notification is found, an appropriate action may be taken. For example, the cached content may be flushed from the cache or a request may be regenerated. As a result of the action, new content is generated. This new content is then used to replace or update the cached content.

Abstract translation: 公开了管理缓存内容的系统和方法。 更具体地，本文公开的实施例可以响应于通知而允许缓存的内容被更新（例如，再生或替换）。 具体地，本文公开的实施例可以处理与存储在高速缓存中的内容有关的通知。 处理通知可以包括定位与通知相关联的高速缓存内容。 在找到与通知相对应的缓存内容之后，可以采取适当的措施。 例如，缓存的内容可以从缓存刷新，或者可以重新生成请求。 作为动作的结果，生成新的内容。 然后使用此新内容来替换或更新缓存的内容。

公开(公告)号：US20130024622A1

公开(公告)日：2013-01-24

申请号：US13620396

申请日：2012-09-14

Applicant: John H. Martin ,  Matthew Helgren ,  Kin-Chung Fung ,  Mark R. Scheevel

Inventor： John H. Martin ,  Matthew Helgren ,  Kin-Chung Fung ,  Mark R. Scheevel

IPC: G06F12/08

CPC classification number: G06F17/30306 ,  G06F17/30902 ,  H04L67/2842

Abstract: Systems and methods for invalidating and regenerating pages. In one embodiment, a method can include detecting content changes in a content database including various objects. The method can include causing an invalidation generator to generate an invalidation based on the modification and communicating the invalidation to a dependency manager. A cache manager can be notified that pages in a cache might be invalidated based on the modification via a page invalidation notice. In one embodiment, a method can include receiving a page invalidation notice and sending a page regeneration request to a page generator. The method can include regenerating the cached page. The method can include forwarding the regenerated page to the cache manager replacing the cached page with the regenerated page. In one embodiment, a method can include invalidating a cached page based on a content modification and regenerating pages which might depend on the modified content.

Abstract translation: 使页面无效和重新生成的系统和方法。 在一个实施例中，一种方法可以包括检测包括各种对象的内容数据库中的内容变化。 该方法可以包括使无效生成器基于修改生成无效，并将该无效传递给依赖性管理器。 缓存管理器可以被通知，缓存中的页面可能会通过页面无效通知修改而无效。 在一个实施例中，一种方法可以包括接收页面无效通知并将页面再生请求发送到页面生成器。 该方法可以包括重新生成缓存的页面。 该方法可以包括将再生页面转发到高速缓存管理器，用再生页替换缓存的页面。 在一个实施例中，一种方法可以包括基于内容修改使得缓存的页面无效，并且重新生成可能取决于修改的内容的页面。

公开(公告)号：US20130013725A1

公开(公告)日：2013-01-10

申请号：US13619861

申请日：2012-09-14

Applicant: Mark R. Scheevel

Inventor： Mark R. Scheevel

IPC: G06F15/167

CPC classification number: G06F17/30887 ,  G06F12/08 ,  G06F17/30861 ,  G06F17/30902 ,  H04L61/6009 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

Abstract: Embodiments disclosed herein provide a high performance content delivery system in which versions of content are cached for servicing web site requests containing the same uniform resource locator (URL). When a page is cached, certain metadata is also stored along with the page. That metadata includes a description of what extra attributes, if any, must be consulted to determine what version of content to serve in response to a request. When a request is fielded, a cache reader consults this metadata at a primary cache address, then extracts the values of attributes, if any are specified, and uses them in conjunction with the URL to search for an appropriate response at a secondary cache address. These attributes may include HTTP request headers, cookies, query string, and session variables. If no entry exists at the secondary address, the request is forwarded to a page generator at the back-end.

Abstract translation: 本文公开的实施例提供了一种高性能内容传送系统，其中内容的版本被缓存以用于服务包含相同的统一资源定位符（URL）的网站请求。 当页面被缓存时，某些元数据也与页面一起存储。 该元数据包括必须查阅哪些额外的属性（如果有的话）以确定哪些版本的内容要响应请求而提供的描述。 当请求被发送时，高速缓存读取器在主缓存地址处查询该元数据，然后提取属性的值（如果有的话），并将其与URL结合使用以在辅助缓存地址处搜索适当的响应。 这些属性可能包括HTTP请求标头，Cookie，查询字符串和会话变量。 如果辅助地址中没有条目，则请求将转发到后端的页面生成器。

公开(公告)号：US07360025B1

公开(公告)日：2008-04-15

申请号：US10733742

申请日：2003-12-11

Applicant: Conleth O'Connell ,  Mark R. Scheevel ,  N. Isaac Rajkumar

Inventor： Conleth O'Connell ,  Mark R. Scheevel ,  N. Isaac Rajkumar

IPC: G06F12/00

CPC classification number: G06F17/30902 ,  Y10S707/99952

Abstract: Systems and methods which provide automatic management of cached content are disclosed. These systems and methods may provide a cache manager which is capable of updating content in a cache without receiving a request from a user. Content may be stored in a cache along with associated metadata. Based upon this metadata, the request which resulted in a particular piece of cached content may be regenerated. This regenerated request can be dynamically evaluated and content responsive generated. This newly generated content can be used to replace the previously cached content. Using these systems and methods content in a cache can be automatically managed and dynamically updated.

Abstract translation: 公开了提供缓存内容自动管理的系统和方法。 这些系统和方法可以提供能够更新高速缓存中的内容而不接收来自用户的请求的高速缓存管理器。 内容可以与相关联的元数据一起存储在高速缓存中。 基于该元数据，可以重新生成导致特定缓存内容的请求。 可以动态评估此再生请求，并生成内容响应。 该新生成的内容可用于替换先前缓存的内容。 缓存中使用这些系统和方法的内容可以被自动管理和动态更新。

公开(公告)号：US4644464A

公开(公告)日：1987-02-17

申请号：US617526

申请日：1984-06-05

Applicant: Gary L. Logsdon ,  Mark R. Scheevel ,  Frank A. Williams, Jr.

Inventor： Gary L. Logsdon ,  Mark R. Scheevel ,  Frank A. Williams, Jr.

IPC: G06F9/44 ,  G06F1/00

CPC classification number: G06F9/4436

Abstract: A parallel register-transfer mechanism and control section have been disclosed above for use in a reduction process for the evaluation of expressions of a variable-free applicative language stored as binary directed graphs. The expressions are reduced through a series of transformations until a result is obtained.

Abstract translation: 以上已经公开了一种并行寄存器传送机制和控制部分，用于评估作为二进制定向图存储的无变量应用语言表达式的简化处理。 通过一系列转换来减少表达式，直到获得结果。

公开(公告)号：US08850138B2

公开(公告)日：2014-09-30

申请号：US13619861

申请日：2012-09-14

Applicant: Mark R. Scheevel

Inventor： Mark R. Scheevel

IPC: G06F12/08 ,  G06F17/30

CPC classification number: G06F17/30887 ,  G06F12/08 ,  G06F17/30861 ,  G06F17/30902 ,  H04L61/6009 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

Abstract: Embodiments disclosed herein provide a high performance content delivery system in which versions of content are cached for servicing web site requests containing the same uniform resource locator (URL). When a page is cached, certain metadata is also stored along with the page. That metadata includes a description of what extra attributes, if any, must be consulted to determine what version of content to serve in response to a request. When a request is fielded, a cache reader consults this metadata at a primary cache address, then extracts the values of attributes, if any are specified, and uses them in conjunction with the URL to search for an appropriate response at a secondary cache address. These attributes may include HTTP request headers, cookies, query string, and session variables. If no entry exists at the secondary address, the request is forwarded to a page generator at the back-end.

Abstract translation: 本文公开的实施例提供了一种高性能内容传送系统，其中内容的版本被缓存以用于服务包含相同的统一资源定位符（URL）的网站请求。 当页面被缓存时，某些元数据也与页面一起存储。 该元数据包括必须查阅哪些额外的属性（如果有的话）以确定哪些版本的内容要响应请求而提供的描述。 当请求被发送时，高速缓存读取器将在主缓存地址处查询该元数据，然后提取属性的值（如果有的话），并将其与URL结合使用以在二级缓存地址上搜索适当的响应。 这些属性可能包括HTTP请求标头，Cookie，查询字符串和会话变量。 如果辅助地址中没有条目，则请求将转发到后端的页面生成器。