Abstract: Methods, systems, and apparatus, including computer program products for receiving a request for access to a first item of content stored on resources of a storage environment, the request for access being initiated by a first user, identifying an existing resource allocation arrangement associating elements of the first item of content with respective elements of the resources of the storage environment, performing an inquiry to determine whether an admission condition is satisfied, and upon satisfaction of the admission condition, generating a specification of an access operation, the access operation configured to enable a selected set of elements among the respective elements of the resources of the storage environment to be accessed.

Abstract: Systems, methods, and apparatus including computer program products to receive a data transfer request that includes a specification of an access operation to be executed in association with one or more network-based storage resource elements, the specification including respective persistent fully-resolvable identifiers for the one or more network-based storage resource elements, and process the access operation in accordance with its specification to effect a data transfer between nodes on a data network.

Abstract: An enhanced playback method including receiving real time content from source links connected to a sources, simultaneously storing the real time content as stored content using a fault tolerant and load balancing method, aggregating the real time content and stored content from additional content, delivering content real time or stored in response to a user request from a user on a terminal system using a cut-through forwarding method. A content/service handling and delivery system including source input/output (I/O) links, a content handling subsystem, the content handling subsystem connected to the source input links, a service delivery subsystem connected to the content handling subsystem, an input and interaction subsystem connected to the service delivery subsystem and terminal I/O links, the plurality terminal I/O links connected to the service delivery subsystem.

Abstract: The present invention introduces the notions of a rendezvous component and rendezvous functionality into the communications network environment. Using the invention, an application can express information regarding when an operation requested of a device should complete and at which location, and it enables the device to perform its operations respecting this information while also improving the device's overall behavior. In an embodiment, one or more data objects are distributed across one or more collections of storage devices using a dispersal technique. When access to a data object is desired, a rendezvous component issues a set of constituent requests to the collections of storage devices. These requests typically include location and timing rendezvous parameters specifying a destination location where and a given time when a given data object is to be reconstituted.

Abstract: An enhanced playback method including receiving real time content from source links connected to a sources, simultaneously storing the real time content as stored content using a fault tolerant and load balancing method, aggregating the real time content and stored content from additional content, delivering content real time or stored in response to a user request from a user on a terminal system using a cut-through forwarding method.

Abstract: A method for assembling multimedia streams enables assembly of any of a number of possible output multimedia streams from segments of source multimedia streams. Enabling assembly of the streams includes computing stream fragments for insertion between successive of the segments to form any of the output streams. According to such a method, computation required for creating transition points in source MPEG streams can be largely performed as a preprocess that produces data that can be stored for use in later assembling a stream, assembly of a stream requires relatively little computation and can be implemented using relatively inexpensive equipment, for example, in software.

Abstract: A method and apparatus for operating a computer graphics system to perform a conditional test on a node in a graphics data structure during the traversal of the graphics data structure by a structure walker. The graphics system is operated to manipulate data contained in a memory to define a value for an operand that is to be tested. The system accesses the operand from the memory. A structure walker performs a test on the value of the operand during traversal of the graphics data structure. Depending upon the result of the test, the structure walker traverses one of several paths in the graphics data structure to create a graphics display.

Abstract: A stand-alone graphics workstation including a digital computer host and a graphics processing subsystem is disclosed. Address data relating to the graphics subsystem components is mapped into the host system virtual memory. The application processes residing in the host are thereby able to communicate directly with the graphics subsystem components, as, e.g. the structure memory, without the need of a direct memory access hardware arrangement or device drivers.

Abstract: A method for operating a computer graphics system to build custom nodes containing commands and data information that is stored in a data structure in the graphics subsystem. A host processor calls routines which build the custome nodes. A structure walker traverses the data structure and extracts the information from the data structure to pass it to the graphics subsystem for display. The use of custom nodes increases the flexibility of advanced graphics data structures bny allowing the creation of other data structures during execution of a first data structure.

Abstract: A host system executes one or more application programs which results in graphic data structures. These graphic data structures are then continuously and asynchronously traversed. Traversal requests by competing application programs are scheduled and performed so that each application views the graphics processing as its own. The traversal and ordering of traversal requests provide efficient use of resources for multiple application programs.