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

1. 发明授权

US5754773A Multimedia on-demand server having different transfer rates 失效
标题翻译：具有不同传输速率的多媒体点播服务器
公开(公告)号：US5754773A
公开(公告)日：1998-05-19
申请号：US470880
申请日：1995-06-06
申请人： Banu Ozden , Raveev Rastogi , Abraham Silberschatz
发明人： Banu Ozden , Raveev Rastogi , Abraham Silberschatz
IPC分类号： H04N7/173 , G06F15/173 , H04J3/22
CPC分类号： H04N7/17336 , H04N21/2387 , Y10S707/99945 , Y10S707/99948
摘要： A multimedia on-demand server including a randomly-accessible library of multimedia programs (such as movies stored on magnetic or optical disks), a limited amount of RAM to buffer and store selected portions of programs retrieved from the library, and an interface that switchably routes program material from the library and RAM buffers to an audience of viewers. The server employs a restricted retrieval strategy and a novel storage allocation scheme that enable different portions of one or more programs to be continuously retrieved and selectively routed to a large number of on-demand viewers, while at the same time minimizing the amount of the RAM required to effect this service. The on-demand server also responds to viewer-generated commands to control the viewing of a program. In a particular embodiment, these commands include video tape player-like operations such as fast-forward, rewind and pause.
摘要翻译：一种多媒体点播服务器，包括随机存取的多媒体节目库（诸如存储在磁盘或光盘上的电影），有限数量的RAM以缓冲和存储从库中检索的节目的所选部分，以及可切换的接口将程序资料从库和RAM缓冲区路由到观众的观众。服务器采用受限制的检索策略和新颖的存储分配方案，其使一个或多个节目的不同部分能够被连续地检索并且选择性地路由到大量的按需观看者，同时最小化RAM的量需要实现这项服务。按需服务器还响应查看器生成的命令来控制程序的查看。在特定实施例中，这些命令包括诸如快进，快退和暂停的类似磁带播放器的操作。

2. 发明授权

US5999963A Move-to-rear list scheduling 失效
标题翻译：移动到后端列表调度
公开(公告)号：US5999963A
公开(公告)日：1999-12-07
申请号：US965934
申请日：1997-11-07
申请人： John Louis Bruno , Eran Gabber , Banu Ozden , Abraham Silberschatz
发明人： John Louis Bruno , Eran Gabber , Banu Ozden , Abraham Silberschatz
IPC分类号： G06F9/48 , G06F9/00
CPC分类号： G06F9/4881
摘要： A new scheduling method and policy for shared (server) resources, such as the CPU or disk memory of a multiprogrammed data processor. The scheduling is referred to as Move-To-Rear List Scheduling and it provides a cumulative service guarantee and well as more traditional guarantees such as fairness (proportional sharing) and bounded delay. In typical operation, a list is maintained for a server of processes seeking service from the server. Processes are admitted to the list only when maximum capacity constraints are not violated, and once on the list, are served in a front-to-back order. After receiving service, or upon the occurrence of other events, the position of the process on the list may be changed.
摘要翻译：用于共享（服务器）资源的新调度方法和策略，例如多编程数据处理器的CPU或磁盘存储器。调度被称为移动到后端列表调度，它提供了累积的服务保证，以及更传统的保证，如公平（比例共享）和有界延迟。在典型操作中，为从服务器寻求服务的进程服务器维护一个列表。只有在没有违反最大容量限制的情况下，进程才能被列入列表，并且在列表中一次以从前到后的顺序提供。在接收到服务之后，或在发生其他事件时，列表中的进程的位置可以被改变。

3. 发明授权

US5720037A Multimedia on-demand server 失效
标题翻译：多媒体点播服务器
公开(公告)号：US5720037A
公开(公告)日：1998-02-17
申请号：US260856
申请日：1994-06-16
申请人： Alexandros Biliris , Banu Ozden , Rajeev Rastogi , Abraham Silberschatz
发明人： Alexandros Biliris , Banu Ozden , Rajeev Rastogi , Abraham Silberschatz
IPC分类号： H04N7/173 , H04N7/16
CPC分类号： H04N21/2387 , H04N7/17336
摘要： A multimedia on-demand server including a randomly accessible library of multimedia programs (such as movies stored on magnetic or optical disks), a limited amount of RAM to buffer and store selected portions of programs retrieved from the library, and an interface that switchably routes program material from the library and RAM buffers to an audience of viewers. The server employs a restricted retrieval strategy and a novel storage allocation scheme that enable different portions of one or more programs to be continuously retrieved and selectively routed to a large number of on-demand viewers, while at the same time minimizing the amount of the RAM required to effect this service. The on-demand server also responds to viewer-generated commands to control the viewing of a program. In a particular embodiment, these commands include video tape player-like operations such as fast-forward, rewind and pause.
摘要翻译：一种多媒体点播服务器，包括随机访问的多媒体节目库（诸如存储在磁盘或光盘上的电影），有限数量的RAM以缓冲和存储从库中检索的节目的所选部分，以及可切换路由的接口来自图书馆和RAM缓冲区的节目素材给观众。服务器采用受限制的检索策略和新颖的存储分配方案，其使一个或多个节目的不同部分能够被连续地检索并且选择性地路由到大量的按需观看者，同时最小化RAM的量需要实现这项服务。按需服务器还响应查看器生成的命令来控制程序的查看。在特定实施例中，这些命令包括诸如快进，快退和暂停的类似磁带播放器的操作。

4. 发明授权

US06434631B1 Method and system for providing computer storage access with quality of service guarantees 有权
标题翻译：提供计算机存储访问与服务质量保证的方法和系统
公开(公告)号：US06434631B1
公开(公告)日：2002-08-13
申请号：US09418795
申请日：1999-10-15
申请人： John Louis Bruno , Jose Carlos Brustoloni , Eran Gabber , Banu Ozden , Abraham Silberschatz
发明人： John Louis Bruno , Jose Carlos Brustoloni , Eran Gabber , Banu Ozden , Abraham Silberschatz
IPC分类号： G06F1314
CPC分类号： H04N21/23103 , G06F3/0613 , G06F3/0659 , G06F3/0674
摘要： A method and system for servicing disk I/O requests from domains which have been guaranteed minimum quality of disk service maintains I/O requests for each domain are in separate queues. The queues are serviced by a disk scheduler which selects requests from the queues in accordance with a fair queuing scheduling algorithm that considers the estimated time required to service the request at the head of a queue with regard for the size of the input or output associated with the request, the proportion of disk bandwidth assigned to the particular domain, and the state of the other queues.
摘要翻译：用于保护磁盘I / O请求的方法和系统，这些请求已经被保证，磁盘服务的最低质量维护每个域的I / O请求都在不同的队列中。队列由磁盘调度器提供服务，磁盘调度器根据公平的排队调度算法来选择来自队列的请求，该算法考虑到与队列中相关联的输入或输出的大小相关联的队列头部处的服务请求所需的估计时间请求，分配给特定域的磁盘带宽的比例以及其他队列的状态。

5. 发明授权

US5964829A Method and apparatus for providing enhanced pay per view in a video server employing a coarse-grained striping scheme 失效
标题翻译：在采用粗粒度条带化方案的视频服务器中提供增强的每次观看付费的方法和装置
公开(公告)号：US5964829A
公开(公告)日：1999-10-12
申请号：US624011
申请日：1996-03-27
申请人： Banu Ozden , Rajeev Rastogi , Abraham Silberschatz
发明人： Banu Ozden , Rajeev Rastogi , Abraham Silberschatz
IPC分类号： G06F15/173 , G06F9/46 , G06F9/48 , H04N5/765 , H04N5/93 , H04N7/16 , H04N7/173 , H04N21/2315 , H04N21/262
CPC分类号： H04N7/17336
摘要： A method and apparatus are disclosed for providing enhanced pay per view in a video server. Specifically, the present invention periodically schedules a group of non pre-emptible tasks corresponding to videos in a video server having a predetermined number of processors, wherein each task begins at predetermined periods and has a set of sub-tasks separated by predetermined intervals. To schedule the group of tasks, the present invention divides the tasks into two groups according to whether they may be scheduled on a single processor. The present invention schedules each group separately. For the group of tasks not scheduleable on a single processor, the present invention determines a number of processors required to schedule such group and schedules such tasks to start at a predetermined time. For the group of tasks scheduleable on a single processor, the present invention determines whether such tasks are scheduleable on the available processors using an array of time slots. If the present invention determines that such group of tasks are not scheduleable on the available processors, then the present invention recursively partitions such group of tasks in subsets and re-performs the second determination of scheduleability. Recursive partitioning continues until the group of tasks is deemed scheduleable or no longer partitionable. In the latter case, the group of tasks is deemed not scheduleable.
摘要翻译：公开了一种用于在视频服务器中提供增强的每次视图的方法和装置。具体地说，本发明周期性地调度与具有预定数量的处理器的视频服务器中的视频相对应的一组不可预先排除的任务，其中每个任务以预定时段开始并且具有以预定间隔隔开的一组子任务。为了安排该组任务，本发明根据它们是否可以在单个处理器上进行调度来将任务分成两组。本发明分别安排每组。对于在单个处理器上不可调度的任务组，本发明确定了调度这样的组并且计划这些任务在预定时间开始的所需的处理器数量。对于在单个处理器上可调度的任务组，本发明使用时隙阵列来确定这些任务是否在可用处理器上可调度。如果本发明确定这样的任务组在可用处理器上是不可调度的，则本发明递归地在子集中划分这样的任务组，并重新执行可调度性的第二确定。递归分区继续进行，直到任务组被视为可安排或不再可分区。在后一种情况下，该组任务被视为不可计划。

6. 发明授权

US06556578B1 Early fair drop buffer management method 有权
标题翻译：早期公平下降缓冲管理方法
公开(公告)号：US06556578B1
公开(公告)日：2003-04-29
申请号：US09295458
申请日：1999-04-14
申请人： Abraham Silberschatz , Banu Ozden , John Bruno , Huzur Saran
发明人： Abraham Silberschatz , Banu Ozden , John Bruno , Huzur Saran
IPC分类号： H04L1228
CPC分类号： H04L47/29 , H04L47/10 , H04L47/193 , H04L47/32 , H04L47/50 , H04L47/60 , H04L47/6225 , H04L47/6255 , H04L49/90 , H04L49/901 , H04L49/9047 , H04L49/9078 , H04L69/16 , H04L69/163
摘要： A method for managing a buffer pool containing a plurality of queues is based on consideration of both (a) when to drop a packet and (b) from which queue the packet should be dropped. According to the method a packet drop is signaled with the global average queue occupancy exceeds a maximum threshold and is signaled on a probabilistic basis when the global occupancy is between a minimum threshold and the maximum threshold. Each queue has a particular local threshold value associated with it and is considered to be “offending” when its buffer occupancy exceeds its local threshold. When a packet drop is signaled, one of the offending queues is selected using a hierarchical, unweighted round robin selection scheme which ensures that offending queues are selected in a fair manner. A packet is then dropped from the selected offending queue.
摘要翻译：一种用于管理包含多个队列的缓冲池的方法是基于（a）何时丢弃分组和（b）从哪个队列丢弃分组的考虑。根据该方法，当全局平均队列占用超过最大阈值时用信号通知分组丢弃，并且当全局占用在最小阈值和最大阈值之间时，以概率为基础发信号通知分组丢弃。每个队列具有与其相关联的特定局部阈值，并且当其缓冲器占用超过其本地阈值时被认为是“违规”的。当信号通知分组丢弃时，使用分层，未加权的循环选择方案选择违规队列中的一个，以确保以公平的方式选择违规队列。然后从所选择的违规队列中丢弃一个数据包。

7. 发明授权

US06330609B1 Admission control system and method for media-on-demand servers 失效
标题翻译：媒体点播服务器的入场控制系统和方法
公开(公告)号：US06330609B1
公开(公告)日：2001-12-11
申请号：US08966095
申请日：1997-11-07
申请人： Minos N. Garofalakis , Yannis E. Ioannidis , Banu Ozden , Abraham Silberschatz
发明人： Minos N. Garofalakis , Yannis E. Ioannidis , Banu Ozden , Abraham Silberschatz
IPC分类号： G06F1516
CPC分类号： H04Q3/0066
摘要： In a server system having a predetermined total bandwidth providing data files to a plurality of clients in response to requests received from the clients, a method for providing admission control comprises the steps of allocating a plurality of channel partitions to a plurality of channel groups such that each channel group includes one or more of the channel partitions. The system then obtains a channel group number based on the length of the data file requested by one of the clients and transmits the requested data file when a channel group corresponding to the obtained channel group number contains a vacant channel partition.
摘要翻译：在具有响应于从客户端接收的请求向多个客户端提供数据文件的预定总带宽的服务器系统中，提供准入控制的方法包括以下步骤：将多个信道分区分配给多个信道组，使得每个通道组包括一个或多个通道分区。然后，系统基于客户端之一请求的数据文件的长度获得信道组号，并且当与所获得的信道组号对应的信道组包含空闲信道分区时发送所请求的数据文件。

8. 发明授权

US5845279A Scheduling resources for continuous media databases 失效
标题翻译：为连续媒体数据库安排资源
公开(公告)号：US5845279A
公开(公告)日：1998-12-01
申请号：US883993
申请日：1997-06-27
申请人： Minos N. Garofalakis , Banu Ozden , Abraham Silberschatz
发明人： Minos N. Garofalakis , Banu Ozden , Abraham Silberschatz
IPC分类号： H04N7/173 , G06F17/30
CPC分类号： H04N7/17336 , Y10S707/99937
摘要： Various systems and methods of scheduling media segments of varying display rate, length and/or periodicity on at least one clustered, vertically-striped or horizontally-striped continuous media database volume. With respect to the at least one horizontally-striped database volume, one method includes the steps of: (1) associating a display value with each of the media segments, (2) sorting the media segments in a non-increasing order of value density to obtain an ordered list thereof and (3) building a scheduling tree of the media segments, the scheduling tree having a structure that increases a total display value of the media segments.
摘要翻译：在至少一个聚集，垂直条纹或水平条纹的连续媒体数据库卷上调度不同显示速率，长度和/或周期性的媒体片段的各种系统和方法。关于至少一个水平条纹数据库卷，一种方法包括以下步骤：（1）将显示值与每个媒体段相关联，（2）以不增加的数值密度顺序对媒体段进行排序以获得其有序列表，并且（3）构建媒体段的调度树，调度树具有增加媒体段的总显示值的结构。

9. 发明授权

US06675229B1 Methods and apparatus for providing quality of service for legacy applications 有权
标题翻译：为传统应用提供服务质量的方法和设备
公开(公告)号：US06675229B1
公开(公告)日：2004-01-06
申请号：US09450036
申请日：1999-11-29
申请人： John Louis Bruno , José Carlos Brustoloni , Eran Gabber , Banu Ozden , Abraham Silberschatz , Amit Singh
发明人： John Louis Bruno , José Carlos Brustoloni , Eran Gabber , Banu Ozden , Abraham Silberschatz , Amit Singh
IPC分类号： G06F954
CPC分类号： G06F9/5055 , G06F2209/5014
摘要： A computer operating system that allows legacy applications to be run automatically with quality of service (QoS) guarantees matching required QoS performance levels. In accordance with the invention, files have QoS requirement attributes that can be set-by users. Additionally, users may interpose a requirement broker between a given legacy application and the operating system. The requirement broker may be in the form of a modified version of a library that is dynamically linked with applications at load time. The requirement broker intercepts certain system calls and automatically requests from the system QoS guarantees in accordance with the QoS requirement attributes of the accessed files, whether local or remote.
摘要翻译：允许遗留应用程序以服务质量（QoS）自动运行的计算机操作系统保证匹配所需的QoS性能级别。根据本发明，文件具有可由用户设置的QoS要求属性。此外，用户可以在给定的遗留应用和操作系统之间插入需求代理。需求代理可以是在加载时与应用程序动态链接的库的修改版本的形式。需求代理根据所访问的文件的QoS要求属性（无论是本地还是远程）拦截某些系统调用并根据系统的QoS保证自动请求。

10. 发明授权

US06278998B1 Data mining using cyclic association rules 有权
标题翻译：数据挖掘使用循环关联规则
公开(公告)号：US06278998B1
公开(公告)日：2001-08-21
申请号：US09250502
申请日：1999-02-16
申请人： Banu Ozden , Sridhar Ramaswamy , Abraham Silberschatz
发明人： Banu Ozden , Sridhar Ramaswamy , Abraham Silberschatz
IPC分类号： G06F1730
CPC分类号： G06F17/30539 , G06F2216/03 , Y10S707/99931 , Y10S707/99933 , Y10S707/99935 , Y10S707/99936
摘要： A system and method for discovering association rules that display regular cyclic variation over time is disclosed. Such association rules may apply over daily, weekly or monthly (or other) cycles of sales data or the like. A first technique, referred to as the sequential algorithm, treats association rules and cycles relatively independently. Based on the interaction between association rules and time, we employ a new technique called cycle pruning, which reduces the amount of time needed to find cyclic association rules. A second algorithm, the interleaved algorithm, uses cycle pruning and other optimization techniques for discovering cyclic association rules with reduced overhead.
摘要翻译：公开了一种用于发现随时间显示常规循环变化的关联规则的系统和方法。这种关联规则可以应用于销售数据等的每日，每周或每月（或其他）周期。被称为顺序算法的第一种技术相对独立地对待关联规则和循环。基于关联规则和时间之间的相互作用，我们采用了一种称为循环修剪的新技术，减少了查找循环关联规则所需的时间。交织算法的第二种算法使用循环修剪和其他优化技术，以减少开销来发现循环关联规则。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式