专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20090119238A1 METHOD AND SYSTEM FOR PREDICTING RESOURCE USAGE OF REUSABLE STREAM PROCESSING ELEMENTS 有权
标题翻译：用于预测资源使用可回收流程处理元素的方法和系统
公开(公告)号：US20090119238A1
公开(公告)日：2009-05-07
申请号：US11935079
申请日：2007-11-05
申请人： Lisa Amini , Henrique Andrade , Wei Fan , James R. Giles , Kirsten W. Hildrum , Deepak Rajan , Deepak S. Turaga , Rohit Wagle , Joel L. Wolf , Philip S. Yu
发明人： Lisa Amini , Henrique Andrade , Wei Fan , James R. Giles , Kirsten W. Hildrum , Deepak Rajan , Deepak S. Turaga , Rohit Wagle , Joel L. Wolf , Philip S. Yu
IPC分类号： G06N5/04
CPC分类号： G06N99/005
摘要： A method is provided for generating a resource function estimate of resource usage by an instance of a processing element configured to consume zero or more input data streams in a stream processing system having a set of available resources that comprises receiving at least one specified performance metric for the zero or more input data streams and a processing power of the set of available resources, wherein one specified performance metric is stream rate; generating a multi-part signature of executable-specific information for the processing element and a multi-part signature of context-specific information for the instance; accessing a database of resource functions to identify a static resource function corresponding to the executable-specific information and a context-dependent resource function corresponding to the context-specific information; combining the static resource function and the context-dependent resource function to form a composite resource function for the instance; and applying the resource function to the at least one specified performance metric and the processing power to generate the resource function estimate of the at least one specified performance metric for processing by the instance.
摘要翻译：提供了一种用于通过被配置为在具有一组可用资源的流处理系统中消耗零个或多个输入数据流的处理元件的实例来生成资源使用的资源功能估计的方法，所述流处理系统包括：一组可用资源，其包括接收至少一个指定的性能度量零个或多个输入数据流和可用资源集合的处理能力，其中一个指定的性能度量是流速率; 生成用于处理元件的可执行特定信息的多部分签名和该实例的上下文特定信息的多部分签名; 访问资源功能的数据库以识别与所述可执行特定信息相对应的静态资源功能以及与所述上下文特定信息相对应的与上下文相关的资源功能; 结合静态资源功能和上下文相关资源功能，形成实例的复合资源功能; 以及将所述资源功能应用于所述至少一个指定的性能度量和所述处理能力以生成所述至少一个指定的性能度量的所述资源功能估计，以供所述实例处理。

2. 发明授权

US5437032A Task scheduler for a miltiprocessor system 失效
标题翻译：多处理器系统的任务调度程序
公开(公告)号：US5437032A
公开(公告)日：1995-07-25
申请号：US293257
申请日：1994-08-19
申请人： Joel L. Wolf , Philip S. Yu , John J. E. Turek
发明人： Joel L. Wolf , Philip S. Yu , John J. E. Turek
IPC分类号： G06F15/16 , G06F9/46 , G06F9/48 , G06F9/50 , G06F15/177
CPC分类号： G06F9/4881 , G06F9/5033 , G06F2209/483 , G06F2209/5017
摘要： A task scheduler for use in a multiprocessor, multitasking system in which a plurality of processor complexes, each containing one or more processors, concurrently execute tasks into which jobs such as database queries are divided. A desired level of concurrent task activity, such as the maximum number of tasks that can be executed concurrently without queuing of tasks, is defined for each processor complex. Each job is assigned a weight in accordance with the external priority accorded to the job. For each job there is defined a desired level of concurrent; task activity that is proportional to its share of the total weight assigned to all concurrently executing jobs. The jobs are prioritized for execution of awaiting tasks in accordance with the discrepancy between the desired level of multitasking activity and the actual level of multitasking activity for each job. Awaiting tasks are preferentially scheduled from jobs with the largest discrepancy between the desired and actual levels of concurrent task activity and are preferentially assigned to the processor complexes with the largest discrepancy between the desired and actual levels of concurrent task activity. The scheduler attempts to assign each task to a processor for which the task has an affinity or at least neutrality in terms of relative execution speed.
摘要翻译：一种在多处理器，多任务系统中使用的任务调度器，其中多个处理器复合体（每个处理器复合体包含一个或多个处理器）并行地执行诸如数据库查询之类的作业被分割的任务。为每个处理器复杂度定义了并发任务活动的期望级别，例如可并行执行并且不排队任务的任务的最大数量。每个作业都按照与工作相符的外部优先级分配重量。对于每个作业，定义了一个期望的并发级别; 任务活动与其分配给所有并行执行作业的总重量的份额成正比。根据所需级别的多任务活动与每个作业的多任务活动的实际水平之间的差异，这些作业被优先执行等待任务。等待任务优先从并发任务活动的期望和实际水平之间的最大差异的作业调度，并且优先地分配给期望和实际并发任务活动之间的最大差异的处理器复合体。调度程序尝试将每个任务分配给处理器，对于该处理器，任务具有相对于执行速度的亲和度或至少中立性。

3. 发明授权

US07356592B2 Method and apparatus for web farm traffic control 失效
标题翻译：网络农场交通管制的方法和装置
公开(公告)号：US07356592B2
公开(公告)日：2008-04-08
申请号：US10057516
申请日：2002-01-24
申请人： Joel L. Wolf , Philip S. Yu
发明人： Joel L. Wolf , Philip S. Yu
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L67/1006 , H04L67/1002 , H04L67/1008 , H04L67/1023 , H04L67/327 , H04L2029/06054
摘要： Disclosed is a method for controlling a web farm having a plurality of websites and servers, the method comprising categorizing customer requests received from said websites into a plurality of categories, said categories comprising a shareable customer requests and unshareable customer requests, routing said shareable customer requests such that any of said servers may process shareable customer requests received from different said websites, and routing said unshareable customer requests from specific said websites only to specific servers to which said specific websites have been assigned.
摘要翻译：公开了一种用于控制具有多个网站和服务器的网络农场的方法，所述方法包括将从所述网站接收的客户请求分类为多个类别，所述类别包括可共享的客户请求和不可客户的客户请求，路由所述可共享的客户请求使得任何所述服务器可以处理从不同的所述网站接收到的可共享的客户请求，并且将来自特定的所述网站的所述不可共享的客户请求仅路由到已经分配了所述特定网站的特定服务器。

4. 发明授权

US5544313A Baton passing optimization scheme for load balancing/configuration planning in a video-on-demand computer system 失效
标题翻译：在视频点播计算机系统中进行负载平衡/配置规划的巴吞不利优化方案
公开(公告)号：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.
摘要翻译：视频点播计算机系统包括多个存储多个视频的存储介质。存储介质是连接到计算机系统的磁盘。计算机系统根据接收到的用户性能请求，通过读取磁盘中的视频来播放视频，作为数据流，以对用户播放所选择的视频。计算机系统被编程为监视每个磁盘正在执行的视频数量。基于由计算机系统执行的监视功能，计算机系统通过将正在进行的视频的性能从一个磁盘传送到具有正在进行的视频副本的另一个磁盘来执行负载平衡功能。计算机系统周期性地执行重新分配功能，以在盘之间传输视频，以根据每个视频的用户性能请求来优化负载平衡。计算机系统执行的负载平衡有两个阶段：静态相和动态相。在静态阶段，将视频分配给内存和磁盘，在动态阶段，提供了一种在磁盘上以最小和平衡负载播放视频的方案。静态支持动态相，保证系统的最佳实时操作。动态相位负载平衡是通过一个通过过程的过程完成的。

5. 发明授权

US5392430A Hierarchical scheduling method for processing tasks having precedence constraints on a parallel processing system 失效
标题翻译：用于处理在并行处理系统上具有优先约束的任务的分级调度方法
公开(公告)号：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.
摘要翻译：由并行处理系统处理的调度的两个阶段最佳地调度由它们之间的优先约束的任务组组成的多个查询（作业）。在第一阶段的调度中，为每个作业创建多个最优时间表，为可能用于执行每个作业的每个可能数量的处理器提供一个最佳时间表，并且为每个作业执行的每个最佳时间表确定估计的作业执行时间每个作业，从而为作业执行的处理器数量的函数产生一组每个作业的估计作业执行时间。在创建所有这些最佳时间表时尊重每个作业中任务之间的优先约束。可以使用在任务之间具有优先约束的并行处理任务的任何已知的最佳调度方法，但是也公开了一种新颖的优选方法。第二阶段调度利用在调度的第一阶段确定的估计作业执行时间来创建作业的总体最佳调度。调度的第二阶段不涉及优先约束，因为优先约束位于同一作业中的任务之间，而不是在单独作业中的任务之间，因此可以调度作业而不观察任何优先约束。可以使用用于并行处理没有优先约束的作业的任何已知的最佳调度方法，但是也公开了一种新颖的优选方法。

6. 发明授权

US07941387B2 Method and system for predicting resource usage of reusable stream processing elements 有权
标题翻译：用于预测可重用流处理元素资源使用的方法和系统
公开(公告)号：US07941387B2
公开(公告)日：2011-05-10
申请号：US11935079
申请日：2007-11-05
申请人： Lisa Amini , Henrique Andrade , Wei Fan , James R. Giles , Kirsten W. Hildrum , Deepak Rajan , Deepak S. Turaga , Rohit Wagle , Joel L. Wolf , Philip S. Yu
发明人： Lisa Amini , Henrique Andrade , Wei Fan , James R. Giles , Kirsten W. Hildrum , Deepak Rajan , Deepak S. Turaga , Rohit Wagle , Joel L. Wolf , Philip S. Yu
IPC分类号： G06F17/00 , G06N5/02
CPC分类号： G06N99/005
摘要： A method is provided for generating a resource function estimate of resource usage by an instance of a processing element configured to consume zero or more input data streams in a stream processing system having a set of available resources that comprises receiving at least one specified performance metric for the zero or more input data streams and a processing power of the set of available resources, wherein one specified performance metric is stream rate; generating a multi-part signature of executable-specific information for the processing element and a multi-part signature of context-specific information for the instance; accessing a database of resource functions to identify a static resource function corresponding to the executable-specific information and a context-dependent resource function corresponding to the context-specific information; combining the static resource function and the context-dependent resource function to form a composite resource function for the instance; and applying the resource function to the at least one specified performance metric and the processing power to generate the resource function estimate of the at least one specified performance metric for processing by the instance.
摘要翻译：提供了一种用于通过被配置为在具有一组可用资源的流处理系统中消耗零个或多个输入数据流的处理元件的实例来生成资源使用的资源功能估计的方法，所述流处理系统包括：一组可用资源，其包括接收至少一个指定的性能度量零个或多个输入数据流和可用资源集合的处理能力，其中一个指定的性能度量是流速率; 生成用于处理元件的可执行特定信息的多部分签名和该实例的上下文特定信息的多部分签名; 访问资源功能的数据库以识别与所述可执行特定信息相对应的静态资源功能以及与所述上下文特定信息相对应的与上下文相关的资源功能; 结合静态资源功能和上下文相关资源功能，形成实例的复合资源功能; 以及将所述资源功能应用于所述至少一个指定的性能度量和所述处理能力，以生成所述至少一个指定的性能度量的资源功能估计，以供所述实例处理。

7. 发明授权

US06631413B1 Method for optimizing profits in electronic delivery of digital objects 失效
标题翻译：优化数字物体电子交付利润的方法
公开(公告)号：US06631413B1
公开(公告)日：2003-10-07
申请号：US09239008
申请日：1999-01-28
申请人： Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu
发明人： Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu
IPC分类号： G06F1300
CPC分类号： G06Q10/08
摘要： In accordance with the present invention, a method for selecting a channel and delivery time for digital objects for a broadcast delivery service including multiple channels of varying bandwidths includes the steps of selecting digital objects to be sent over the multiple channels, generating a schedule and pricing for the digital objects based on the digital object selected and existing delivery commitments and manipulating the schedule and pricing to provide a profitable delivery of the digital objects. A system is also included.
摘要翻译：根据本发明，一种用于为包括多个变化带宽的多个信道的广播传送业务的数字对象选择信道和传送时间的方法包括以下步骤：选择要在多个信道上发送的数字对象，生成调度和定价用于基于选定的数字对象和现有交付承诺的数字对象，并操纵计划和定价以提供数字对象的有利可图的交付。还包括一个系统。

8. 发明授权

US06477180B1 Optimizing method for digital content delivery in a multicast network 有权
标题翻译：多播网络中数字内容传送的优化方法
公开(公告)号：US06477180B1
公开(公告)日：2002-11-05
申请号：US09239341
申请日：1999-01-28
申请人： Charu C. Aggarwal , Jayachandran Sethuraman , Mark S. Squillante , Joel L. Wolf , Philip S. Yu
发明人： Charu C. Aggarwal , Jayachandran Sethuraman , Mark S. Squillante , Joel L. Wolf , Philip S. Yu
IPC分类号： H04J116
CPC分类号： H04N21/26225 , G06Q30/06 , H04L29/06 , H04L67/325 , H04L69/329 , H04N7/17318 , H04N21/26216 , H04N21/482 , H04N21/6405 , H04N21/6581
摘要： A method for scheduling delivery of digital objects over a network, in accordance with the invention, includes the steps of providing a user interface for selecting objects to be transmitted thereto, selecting at least one object to be transmitted to the user interface, identifying and receiving in-progress object transmissions corresponding to the at least one selected object, identifying portions of the at least one object not yet received to request transmission of the portions of the at least one object not yet received and receiving remaining portions of the at least one object during additional in-progress transmissions. A system is also included.
摘要翻译：根据本发明的一种用于通过网络调度数字对象传送的方法包括以下步骤：提供用于选择要发送到其上的对象的用户界面，选择要发送到用户界面的至少一个对象，识别和接收对应于所述至少一个所选择的对象的进行中对象传输，识别尚未被接收的所述至少一个对象的部分，以请求传送尚未被接收的所述至少一个对象的部分的部分，并且接收所述至少一个对象的剩余部分在额外的进行中的传输。还包括一个系统。

9. 发明授权

US5461415A Look-ahead scheduling to support video-on-demand applications 失效
标题翻译：前瞻性调度，以支持视频点播应用
公开(公告)号：US5461415A
公开(公告)日：1995-10-24
申请号：US213284
申请日：1994-03-15
申请人： Joel L. Wolf , Philip S. Yu
发明人： Joel L. Wolf , Philip S. Yu
IPC分类号： G06F12/00 , H04N7/173 , H04N7/16
CPC分类号： H04N7/17336
摘要： A system and method of supporting pause-resume in a video-on-demand service of a type which can accommodate multiple viewers sharing a common data stream is described. When a video server receives a performance request from one of the viewers for showing a particular video, it identifies and reserves a look-ahead stream. The look-ahead stream is another video stream which is scheduled to become available after a predetermined time period. When the video is commenced, a common data stream for the video is concurrently transmitted from the video server to reception equipment at the viewers' locations. Transmission of the common data stream causes the particular video to be performed on the viewers' reception equipment. When the video server receives a pause request and then a subsequent resume request from one of the viewers, it transmits the video via the look ahead stream instead of the common data stream.
摘要翻译：描述了支持可以容纳共享公共数据流的多个观看者的类型的视频点播服务中的暂停恢复的系统和方法。当视频服务器从其中一个观众接收到用于显示特定视频的演出请求时，它识别并预留了一个预先的流。先行流是在预定时间段之后被调度为可用的另一个视频流。当视频开始时，视频的公用数据流在观众的位置从视频服务器同时发送到接收设备。公共数据流的传输导致在观众的接收设备上执行特定的视频。当视频服务器从其中一个观看者接收到暂停请求，然后接收后续的恢复请求时，它经由预览流而不是公共数据流发送视频。

10. 发明授权

US5121494A Joining two database relations on a common field in a parallel relational database field 失效
标题翻译：在平行关系数据库领域中共享两个数据库关系
公开(公告)号：US5121494A
公开(公告)日：1992-06-09
申请号：US417366
申请日：1989-10-05
申请人： Daniel M. Dias , Joel L. Wolf , Philip S. Yu
发明人： Daniel M. Dias , Joel L. Wolf , Philip S. Yu
IPC分类号： G06F15/16 , G06F9/50 , G06F12/00 , G06F15/177 , G06F17/30
CPC分类号： G06F17/30498 , G06F17/30445 , Y10S707/99932
摘要： A technique for performing joins in parallel on a multiple processor database system effectively deals with data skew. The join operation is performed in three stages with an optional fourth stage. The first stage is a preparatory stage, the detail of which depends on the underlying join algorithm used. This preparatory stage provides pre-processing the results of which are used in the following stage as the basis for defining subtasks for the final join operation. The data provided in the first stage is used in the second stage to both define subtasks and to optimally allocate these subtasks to different processors in such a manner that the processors are close to equally loaded in the final join operation, even in the presence of data skew. This second stage is an assignment stage the details of which depend on the underlying join algorithm. Once the second stage has completed its processing of the subtasks, the subtasks are shipped to their assigned processors for processing and the final join of the two relations in the third stage. The method used in the final join operation depends on the underlying join algorithm used. Optionally, during the actual join as performed in the third stage, there could be a dynamic re-assignment of the subtasks should the join operation become unbalanced.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式