公开(公告)号：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保证自动请求。

公开(公告)号：US06725456B1

公开(公告)日：2004-04-20

申请号：US09450035

申请日：1999-11-29

申请人： John Louis Bruno ,  José Carlos Brustoloni ,  Eran Gabber ,  Banu Ozden ,  Abraham Silberschatz

发明人： John Louis Bruno ,  José Carlos Brustoloni ,  Eran Gabber ,  Banu Ozden ,  Abraham Silberschatz

IPC分类号： G06F900

CPC分类号： G06F9/5011 ,  G06F2209/5014

摘要： A uniform application programming interface (API) provides efficient generation and control of resource reservations so as to ensure a desired quality of service (QoS) for applications running on an operating system of a computer system. The uniform API is based on a hierarchical file system which associates resource reservations with references to shared objects, rather than with the objects themselves. The uniform API permits the use of a variety of different proportional share schedulers for controlling access to physical resources, e.g., CPU, memory, disk, network interfaces, etc. of the computer system. The hierarchical file system includes a separate directory for each independently-scheduled physical resource of the computer system. A parent of the resource reservation in the hierarchical file system is either a root node of the file system or another reservation for the same resource. The resource reservation represents either an internal reservation, corresponding to a directory in the file system which is permitted to have child nodes associated therewith in the file system, or a queue, corresponding to a directory which is not permitted to have child nodes associated therewith. A given request for a resource reservation is processed by a proportional share scheduler associated with the resource, and identifies a queue having a predetermined portion of the resource allocated thereto. The invention also provides mechanisms for request tagging by the operating system, parental limitation of resources used by a child process, and “garbage collection” of resource reservations that are no longer needed.

摘要翻译： 统一的应用编程接口（API）提供资源预留的有效生成和控制，以便确保在计算机系统的操作系统上运行的应用的期望的服务质量（QoS）。 统一API基于分层文件系统，其将资源预留与对共享对象的引用相关联，而不是与对象本身相关联。 统一API允许使用各种不同的比例共享调度器来控制对物理资源的访问，例如计算机系统的CPU，存储器，盘，网络接口等。 分层文件系统包括用于计算机系统的每个独立调度的物理资源的单独的目录。 分层文件系统中的资源预留的父节点是文件系统的根节点或相同资源的另一个预留。 资源预留表示与文件系统中允许具有与文件系统相关联的子节点的目录相对应的内部预留，或对应于不允许具有与其相关联的子节点的目录的队列。 资源预留的给定请求由与资源相关联的比例共享调度器处理，并且识别具有分配给其的资源的预定部分的队列。 本发明还提供了由操作系统请求标记的机制，子进程使用的资源的父母限制以及不再需要的资源预留的“垃圾收集”。

公开(公告)号：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或磁盘存储器。 调度被称为移动到后端列表调度，它提供了累积的服务保证，以及更传统的保证，如公平（比例共享）和有界延迟。 在典型操作中，为从服务器寻求服务的进程服务器维护一个列表。 只有在没有违反最大容量限制的情况下，进程才能被列入列表，并且在列表中一次以从前到后的顺序提供。 在接收到服务之后，或在发生其他事件时，列表中的进程的位置可以被改变。

公开(公告)号：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请求都在不同的队列中。 队列由磁盘调度器提供服务，磁盘调度器根据公平的排队调度算法来选择来自队列的请求，该算法考虑到与队列中相关联的输入或输出的大小相关联的队列头部处的服务请求所需的估计时间 请求，分配给特定域的磁盘带宽的比例以及其他队列的状态。

公开(公告)号：US06625149B1

公开(公告)日：2003-09-23

申请号：US09450034

申请日：1999-11-29

申请人： José Carlos Brustoloni ,  Eran Gabber ,  Abraham Silberschatz

发明人： José Carlos Brustoloni ,  Eran Gabber ,  Abraham Silberschatz

IPC分类号： H04L1256

CPC分类号： H04L49/90 ,  H04L47/15 ,  H04L47/30 ,  H04L47/32 ,  H04L47/70 ,  H04L47/724 ,  H04L47/825

摘要： Received packets are processed utilizing protocol processing stages in an operating system, in accordance with a technique referred to as signaled receiver processing (SRP). A given protocol processing stage uses a next stage submit (NSS) function to pass a packet to a subsequent protocol processing stage. Each protocol processing stage is associated with one or more sockets. Each socket is associated with the input function of a protocol processing stage, an unprocessed input queue (UIQ) that contains packets destined to the socket but not yet processed by the socket's input function, and a list of owner processes, which expect input from the socket. NSS uses a multi-stage early demultiplexing (MED) function, which determines a packet's next destination socket, based on the stage currently processing the packet and on information contained in the packet. If the amount of buffering used by a packet plus the amount of input buffering already used by the packet's destination socket exceeds a designated limit associated with that socket, NSS drops the packet. Otherwise, NSS enqueues the packet in that socket's UIQ and signals that socket's owner processes. The signal triggers a default action corresponding to performance of the required protocol processing by one of the destination socket's owner processes, but those processes may override the default action by, e.g., deferring the required protocol processing until execution of a subsequent receive call.

摘要翻译： 根据称为信令接收机处理（SRP）的技术，在操作系统中利用协议处理级来处理接收的分组。 给定的协议处理阶段使用下一阶段提交（NSS）功能将数据包传递到后续的协议处理阶段。 每个协议处理阶段与一个或多个套接字相关联。 每个套接字与协议处理阶段的输入功能相关联，一个未处理的输入队列（UIQ），其包含目的地为套接字但尚未由套接字输入函数处理的数据包，以及所有者进程列表， 插座。 NSS使用多阶段早期解复用（MED）功能，其基于当前处理分组的阶段和包中包含的信息来确定分组的下一个目的地套接字。 如果数据包使用的缓冲量加上数据包目的套接口已经使用的输入缓冲量超过与该套接字相关联的指定限制，NSS将丢弃数据包。 否则，NSS将该套接字的UIQ中的数据包排入队列，并指示套接字的所有者进程。 信号触发与目标套接字所有者进程之一所需的协议处理性能相对应的默认动作，但是这些进程可以通过例如延迟所需的协议处理来覆盖默认动作，直到执行后续的接收呼叫。

公开(公告)号：US06604123B1

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

申请号：US09311229

申请日：1999-05-13

申请人： John Louis Bruno ,  Jose' Carlos Brustoloni ,  Eran Gabber ,  Abraham Silberschatz ,  Christopher Allen Small

发明人： John Louis Bruno ,  Jose' Carlos Brustoloni ,  Eran Gabber ,  Abraham Silberschatz ,  Christopher Allen Small

IPC分类号： G06F900

CPC分类号： G06F9/4843

摘要： A computer operating system in which transfer of control of executing threads between protection domains is implemented using specific portals dedicated to the particular transfer of control between two protection domains. The transfer of control may also include parameter manipulation. A server registers a portal specification with a portal manager, the portal specification defining the behavior of portals which transfer control to the server. Thereafter, when a client application desires service from the server, the client application requests instantiation of a portal which will transfer control of an execution thread from the client application protection domain to the server protection domain. Upon receipt of the request, the portal manager dynamically generates portal code and updates a portal table associated with the client application, thus instantiating the portal. When the client application desires to invoke the server, the client application issues a system call instruction which results in switching the processor to privileged mode, followed by a lookup to the portal table and a transfer of control to the portal code identified in the portal table. The execution of the portal code results in transfer of control of the execution thread to the protection domain of the server. Various parameter manipulation techniques are disclosed for improving the efficiency of the transfer of control.

摘要翻译： 一种计算机操作系统，其中使用专用于两个保护域之间的特定传输控制的特定门户来实现在保护域之间执行线程的控制的传送。 控制的转移也可以包括参数操作。 服务器向门户管理器注册门户规范，该门户规范定义将控制权转移到服务器的门户的行为。 此后，当客户端应用程序期望从服务器获得服务时，客户端应用程序请求实例化门户，该门户将把执行线程的控制从客户端应用程序保护域转移到服务器保护域。 在收到请求后，门户管理员动态生成门户代码并更新与客户端应用程序关联的门户表，从而实例化门户。 当客户端应用程序希望调用服务器时，客户端应用程序发出系统调用指令，导致处理器转换为特权模式，然后查找门户表，并将控制权转移到门户网站表中标识的门户代码 。 门户代码的执行导致执行线程的控制传输到服务器的保护域。 公开了用于提高控制传送效率的各种参数操纵技术。

公开(公告)号：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的量 需要实现这项服务。 按需服务器还响应查看器生成的命令来控制程序的查看。 在特定实施例中，这些命令包括诸如快进，快退和暂停的类似磁带播放器的操作。

公开(公告)号：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.

摘要翻译： 公开了一种用于在视频服务器中提供增强的每次视图的方法和装置。 具体地说，本发明周期性地调度与具有预定数量的处理器的视频服务器中的视频相对应的一组不可预先排除的任务，其中每个任务以预定时段开始并且具有以预定间隔隔开的一组子任务。 为了安排该组任务，本发明根据它们是否可以在单个处理器上进行调度来将任务分成两组。 本发明分别安排每组。 对于在单个处理器上不可调度的任务组，本发明确定了调度这样的组并且计划这些任务在预定时间开始的所需的处理器数量。 对于在单个处理器上可调度的任务组，本发明使用时隙阵列来确定这些任务是否在可用处理器上可调度。 如果本发明确定这样的任务组在可用处理器上是不可调度的，则本发明递归地在子集中划分这样的任务组，并重新执行可调度性的第二确定。 递归分区继续进行，直到任务组被视为可安排或不再可分区。 在后一种情况下，该组任务被视为不可计划。

公开(公告)号：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）从哪个队列丢弃分组的考虑。 根据该方法，当全局平均队列占用超过最大阈值时用信号通知分组丢弃，并且当全局占用在最小阈值和最大阈值之间时，以概率为基础发信号通知分组丢弃。 每个队列具有与其相关联的特定局部阈值，并且当其缓冲器占用超过其本地阈值时被认为是“违规”的。 当信号通知分组丢弃时，使用分层，未加权的循环选择方案选择违规队列中的一个，以确保以公平的方式选择违规队列。 然后从所选择的违规队列中丢弃一个数据包。

公开(公告)号：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.

摘要翻译： 在具有响应于从客户端接收的请求向多个客户端提供数据文件的预定总带宽的服务器系统中，提供准入控制的方法包括以下步骤：将多个信道分区分配给多个信道组，使得 每个通道组包括一个或多个通道分区。 然后，系统基于客户端之一请求的数据文件的长度获得信道组号，并且当与所获得的信道组号对应的信道组包含空闲信道分区时发送所请求的数据文件。