公开(公告)号：US5544313A

公开(公告)日：1996-08-06

申请号：US241087

申请日：1994-05-11

申请人： Hadas Shachnai ,  Joel L. Wolf ,  Philip S. Yu

发明人： Hadas Shachnai ,  Joel L. Wolf ,  Philip S. Yu

IPC分类号： H04N7/173 ,  G06F13/14

CPC分类号： H04N7/17336 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A video on demand computer system includes a plurality of storage media each storing a plurality of videos. The storage media are disks attached to a computer system. The computer system plays the videos on demand by reading out the videos from the disks as data steams to play selected ones of the videos for users responsive to received user performance requests. The computer system is programmed to monitor the numbers of videos being performed for each of the disks. Based on the monitoring function performed by the computer system, the computer system performs a load balancing function by transferring the performance of a video in progress from one of the disks to another disk having a copy of the video in progress. The computer system periodically performs a reassignment function to transfer videos between the disks to optimize load balancing based on the user performance requests for each of the videos. There are two phases to the load balancing performed by the computer system; a static phase and a dynamic phase. In the static phase, videos are assigned to memory and disks, and in the dynamic phase there is provided a scheme for playing videos with minimal and balanced loads on the disks. The static phase supports the dynamic phase which insures optimal real-time operation of the system. Dynamic phase load balancing is accomplished by a process of baton passing.

摘要翻译： 视频点播计算机系统包括多个存储多个视频的存储介质。 存储介质是连接到计算机系统的磁盘。 计算机系统根据接收到的用户性能请求，通过读取磁盘中的视频来播放视频，作为数据流，以对用户播放所选择的视频。 计算机系统被编程为监视每个磁盘正在执行的视频数量。 基于由计算机系统执行的监视功能，计算机系统通过将正在进行的视频的性能从一个磁盘传送到具有正在进行的视频副本的另一个磁盘来执行负载平衡功能。 计算机系统周期性地执行重新分配功能，以在盘之间传输视频，以根据每个视频的用户性能请求来优化负载平衡。 计算机系统执行的负载平衡有两个阶段： 静态相和动态相。 在静态阶段，将视频分配给内存和磁盘，在动态阶段，提供了一种在磁盘上以最小和平衡负载播放视频的方案。 静态支持动态相，保证系统的最佳实时操作。 动态相位负载平衡是通过一个通过过程的过程完成的。

公开(公告)号：US5392430A

公开(公告)日：1995-02-21

申请号：US968717

申请日：1992-10-30

申请人： Ming-Syan Chen ,  John J. E. Turek ,  Joel L. Wolf ,  Philip S. Yu

发明人： Ming-Syan Chen ,  John J. E. Turek ,  Joel L. Wolf ,  Philip S. Yu

IPC分类号： G06F9/46 ,  G06F9/45 ,  G06F9/50 ,  G06F15/16 ,  G06F15/177

CPC分类号： G06F8/451 ,  Y10S707/99933

摘要： A plurality of queries (jobs) which consist of sets of tasks with precedence constraints between them are optimally scheduled in two stages of scheduling for processing on a parallel processing system. In a first stage of scheduling, multiple optimum schedules are created for each job, one optimum schedule for each possible number of processors which might be used to execute each job, and an estimated job execution time is determined for each of the optimum schedules created for each job, thereby producing a set of estimated job execution times for each job which are a function of the number of processors used for the job execution. Precedence constraints between tasks in each job are respected in creating all of these optimum schedules. Any known optimum scheduling method for parallel processing tasks that have precedence constraints among tasks may be used but a novel preferred method is also disclosed. The second stage of scheduling utilizes the estimated job execution times determined in the first stage of scheduling to create an overall optimum schedule for the jobs. The second stage of scheduling does not involve precedence constraints because the precedence constraints are between tasks within the same job and not between tasks in separate jobs, so jobs may be scheduled without observing any precedence constraints. Any known optimum scheduling method for the parallel processing of jobs that have no precedence constraints may be used, but a novel preferred method is also disclosed.

摘要翻译： 由并行处理系统处理的调度的两个阶段最佳地调度由它们之间的优先约束的任务组组成的多个查询（作业）。 在第一阶段的调度中，为每个作业创建多个最优时间表，为可能用于执行每个作业的每个可能数量的处理器提供一个最佳时间表，并且为每个作业执行的每个最佳时间表确定估计的作业执行时间 每个作业，从而为作业执行的处理器数量的函数产生一组每个作业的估计作业执行时间。 在创建所有这些最佳时间表时尊重每个作业中任务之间的优先约束。 可以使用在任务之间具有优先约束的并行处理任务的任何已知的最佳调度方法，但是也公开了一种新颖的优选方法。 第二阶段调度利用在调度的第一阶段确定的估计作业执行时间来创建作业的总体最佳调度。 调度的第二阶段不涉及优先约束，因为优先约束位于同一作业中的任务之间，而不是在单独作业中的任务之间，因此可以调度作业而不观察任何优先约束。 可以使用用于并行处理没有优先约束的作业的任何已知的最佳调度方法，但是也公开了一种新颖的优选方法。

公开(公告)号：US5161227A

公开(公告)日：1992-11-03

申请号：US434649

申请日：1989-11-13

申请人： Daniel M. Dias ,  Balakrishna R. Iyer ,  Philip S. Yu

发明人： Daniel M. Dias ,  Balakrishna R. Iyer ,  Philip S. Yu

IPC分类号： G06F15/16 ,  G06F15/177 ,  G06F17/30

CPC分类号： G06F17/30362

摘要： A multi-processor computer system in which each processor is under the control of separate system software and access a common database. A two level lock management system is used to prevent data corruption due to unsychronized data access by the multiple processors. By this system, subsets of data in the database are assigned respectively different lock entities. Before a task running on one of the processors access data in the database it first requests permission to access the data in a given mode with reference to the appropriate lock entity. A first level lock manager handles these requests synchronously, using a simplified model of the locking system having shared and exclusive lock modes to either grant or deny the request. All requests are then forwarded to a second level lock manager which grants or denies the request based on a more robust model of the locking system and queues denied requests. The denied requests are granted, in turn, as the tasks which have been granted access finish processing data in the database.

公开(公告)号：US4706150A

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

申请号：US933309

申请日：1986-11-21

申请人： Gerald Lebizay ,  Yeong-Chang L. Lien ,  Philip S. Yu

发明人： Gerald Lebizay ,  Yeong-Chang L. Lien ,  Philip S. Yu

IPC分类号： G06F15/173 ,  H04L12/00 ,  H04Q11/00 ,  H04M3/00 ,  H04Q5/00

CPC分类号： G06F15/17375 ,  H04L12/00

摘要： A protocol for a switching system that establishes multiple parallel paths between users through multiple autonomous switching planes by having a user desiring connection to issue connection requests to each of the switching planes. According to the invention, the user monitors the number of connections that have been successfully completed and if only some of the connections have been completed, because of conflicting requests, it follows a conflict protocol to issue retry requests to the planes on which the connection request was unsuccessful. Each switching plane follows the conflict protocol to respond to the retry request by disconnecting existing connections and completing at most one retried connection request.

摘要翻译： 一种交换系统的协议，其通过使用户期望连接向每个交换平面发出连接请求，通过多个自主切换平面在用户之间建立多个并行路径。 根据本发明，用户监视已经成功完成的连接的数量，并且由于冲突的请求只有一些连接已经完成，所以遵循冲突协议以向连接请求的平面发出重试请求 不成功 每个交换平面遵循冲突协议以通过断开现有连接并完成至多一个重试的连接请求来响应重试请求。

公开(公告)号：US09064364B2

公开(公告)日：2015-06-23

申请号：US10690778

申请日：2003-10-22

申请人： Naoki Abe ,  Carl E. Abrams ,  Chidanand V. Apte ,  Bishwaranjan Bhattacharjee ,  Kenneth A. Goldman ,  Matthias Gruetzner ,  Matthew A. Hilbert ,  John Langford ,  Sriram K. Padmanabhan ,  Charles P. Tresser ,  Kathleen M. Troidle ,  Philip S. Yu

发明人： Naoki Abe ,  Carl E. Abrams ,  Chidanand V. Apte ,  Bishwaranjan Bhattacharjee ,  Kenneth A. Goldman ,  Matthias Gruetzner ,  Matthew A. Hilbert ,  John Langford ,  Sriram K. Padmanabhan ,  Charles P. Tresser ,  Kathleen M. Troidle ,  Philip S. Yu

IPC分类号： G06Q20/02 ,  G07F7/10 ,  G06F21/62 ,  G06F21/72 ,  G06Q20/34 ,  G07F19/00

CPC分类号： G06Q20/4016 ,  G06F21/121 ,  G06F21/602 ,  G06F21/6218 ,  G06F21/6245 ,  G06F21/72 ,  G06F2221/07 ,  G06F2221/2101 ,  G06Q20/341 ,  G06Q20/3829 ,  G06Q2220/00 ,  G07F7/1008 ,  G07F7/1083 ,  G07F19/207 ,  H04L63/04

摘要： Various embodiments for maintaining security and confidentiality of data and operations within a fraud detection system. Each of these embodiments utilizes a secure architecture in which: (1) access to data is limited to only approved or authorized entities; (2) confidential details in received data can be readily identified and concealed; and (3) confidential details that have become non-confidential can be identified and exposed.

摘要翻译： 用于维护欺诈检测系统内的数据和操作的安全性和机密性的各种实施例。 这些实施例中的每一个都利用安全架构，其中：（1）对数据的访问仅限于批准或授权的实体; （2）接收到的数据的机密细节可以很容易地识别和隐藏; 和（3）可以识别和暴露出非机密的机密细节。

公开(公告)号：US08494036B2

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

申请号：US12177300

申请日：2008-07-22

申请人： Deepak Srinivac Turaga ,  Michail Vlachos ,  Philip S. Yu

发明人： Deepak Srinivac Turaga ,  Michail Vlachos ,  Philip S. Yu

IPC分类号： H04B3/46

CPC分类号： G06F17/141

摘要： Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even more accentuated in mobile environments (such as sensor networks) where computational and memory resources are typically limited. Introduced herein is a novel “resource adaptive” algorithm for spectrum and periodicity estimation on a continuous stream of data. The formulation is based on the derivation of a closed-form incremental computation of the spectrum, augmented by an intelligent load-shedding scheme that can adapt to available CPU resources. Experimentation indicates that the proposed technique can be a viable and resource efficient solution for real-time spectrum estimation.

摘要翻译： 流环境通常会指示不完整或近似算法执行，以应对数据速率的突然增加。 在计算和存储资源通常受限制的移动环境（如传感器网络）中，这种限制更加突出。 这里介绍的是一种用于连续数据流的频谱和周期估计的新型“资源自适应”算法。 该公式基于频谱的闭合增量计算的推导，通过可以适应可用CPU资源的智能加载开放方案来增强。 实验表明，提出的技术可以成为实时频谱估计的可行且资源有效的解决方案。

公开(公告)号：US08478875B2

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

申请号：US12164671

申请日：2008-06-30

申请人： Bugra Gedik ,  Kun-Lung Wu ,  Philip S. Yu

发明人： Bugra Gedik ,  Kun-Lung Wu ,  Philip S. Yu

IPC分类号： G06F15/173

CPC分类号： H04L67/10 ,  H02J3/14 ,  H04L47/10 ,  H04L47/225 ,  H04L47/41 ,  H04L49/90 ,  H04L49/901 ,  Y02D50/30 ,  Y04S20/224

摘要： One embodiment of the present method and apparatus adaptive in-operator load shedding includes receiving at least two data streams (each comprising a plurality of tuples, or data items) into respective sliding windows of memory. A throttling fraction is then calculated based on input rates associated with the data streams and on currently available processing resources. Tuples are then selected for processing from the data streams in accordance with the throttling fraction, where the selected tuples represent a subset of all tuples contained within the sliding window.

摘要翻译： 本发明的方法和设备的一个实施例是自适应操作员卸载包括将至少两个数据流（每个包括多个元组或数据项）接收到存储器的相应滑动窗口中。 然后基于与数据流相关联的输入速率和当前可用的处理资源来计算节流分数。 然后根据节流分数从数据流中选择元组进行处理，其中所选元组表示包含在滑动窗口内的所有元组的子集。

公开(公告)号：US08286153B2

公开(公告)日：2012-10-09

申请号：US12061284

申请日：2008-04-02

申请人： Xiaohui Gu ,  Philip S. Yu

发明人： Xiaohui Gu ,  Philip S. Yu

IPC分类号： G06F9/45

CPC分类号： H04L12/4641

摘要： A system and method are provided for optimizing component composition in a distributed stream-processing environment having a plurality of nodes capable of being associated with one or more of a plurality of stream processing components. The system includes an adaptive composition probing (ACP) module and a hierarchical state manager. The ACP module probes a subset of the plurality of stream processing components to determine the optimal component composition in response to a stream processing request. The hierarchical state manager manages local and global information for use by said ACP module in determining the optimal component composition.

摘要翻译： 提供了一种用于在分布式流处理环境中优化组件组成的系统和方法，其具有能够与多个流处理组件中的一个或多个相关联的多个节点。 该系统包括自适应组合探测（ACP）模块和分级状态管理器。 ACP模块探测多个流处理组件的子集，以响应于流处理请求来确定最佳组件组成。 层级状态管理器管理本地和全局信息，供所述ACP模块在确定最佳组件组成时使用。

公开(公告)号：US07945570B2

公开(公告)日：2011-05-17

申请号：US12551033

申请日：2009-08-31

申请人： Spyridon Papadimitriou ,  Philip S. Yu

发明人： Spyridon Papadimitriou ,  Philip S. Yu

IPC分类号： G06F17/30

CPC分类号： G06K9/00496

摘要： A computer-implemented method, system, and a computer readable article of manufacture identify local patterns in at least one time series data stream. A data stream is received that comprises at least one set of time series data. The at least one set of time series data is formed into a set of multiple ordered levels of time series data. Multiple ordered levels of hierarchical approximation functions are generated directly from the multiple ordered levels of time series data. A set of approximating functions are created for each level. A current window with a current window length is selected from a set of varying window lengths. The set of approximating functions created at one level in the multiple ordered levels is passed to a subsequent level as a set of time series data. The multiple ordered levels of hierarchical approximation functions are stored into memory after being generated.

摘要翻译： 计算机实现的方法，系统和计算机可读制造商标识至少一个时间序列数据流中的局部模式。 接收包括至少一组时间序列数据的数据流。 至少一组时间序列数据被形成为一组时间序列数据的多个有序级别。 分层近似函数的多个有序级别直接从多个有序级别的时间序列数据生成。 为每个级别创建一组近似函数。 从一组变化的窗口长度中选择具有当前窗口长度的当前窗口。 在多个有序等级中在一个级别创建的一组近似函数作为一组时间序列数据传递到后续级别。 分层近似函数的多个有序等级在生成后被存储到存储器中。

公开(公告)号：US20100063974A1

公开(公告)日：2010-03-11

申请号：US12551033

申请日：2009-08-31

申请人： SPYRIDON PAPADIMITRIOU ,  Philip S. Yu

发明人： SPYRIDON PAPADIMITRIOU ,  Philip S. Yu

IPC分类号： G06F17/30

CPC分类号： G06K9/00496

摘要： A computer-implemented method, system, and a computer readable article of manufacture identify local patterns in at least one time series data stream. A data stream is received that comprises at least one set of time series data. The at least one set of time series data is formed into a set of multiple ordered levels of time series data. Multiple ordered levels of hierarchical approximation functions are generated directly from the multiple ordered levels of time series data. A set of approximating functions are created for each level. A current window with a current window length is selected from a set of varying window lengths. The set of approximating functions created at one level in the multiple ordered levels is passed to a subsequent level as a set of time series data. The multiple ordered levels of hierarchical approximation functions are stored into memory after being generated.

摘要翻译： 计算机实现的方法，系统和计算机可读制造商标识至少一个时间序列数据流中的局部模式。 接收包括至少一组时间序列数据的数据流。 至少一组时间序列数据被形成为一组时间序列数据的多个有序级别。 分层近似函数的多个有序级别直接从多个有序级别的时间序列数据生成。 为每个级别创建一组近似函数。 从一组变化的窗口长度中选择具有当前窗口长度的当前窗口。 在多个有序等级中在一个级别创建的一组近似函数作为一组时间序列数据传递到后续级别。 分层近似函数的多个有序等级在生成后被存储到存储器中。