Abstract: Media content, including content suitable for streaming, is distributed to and accessible over a communications network by computer nodes within a peer storage network of computer nodes hosting respective content stores. Discrete portions of a content file are multiply distributed to and persisted in a distributed set of the content stores existing within the storage network such that various content stores persist subsets of the content file portions. A computer node retrieves the discrete portions of the content file from the various distributed content stores, depending on node availability, the particular discrete portions there available, and node and network performance factors sufficient to maintain a minimum quality of service, thereby enabling streaming presentation of the content file on the requesting computer node.

Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.

Abstract: A multi-source peer content distribution system transfers content files from multiple, distributed peer computers to any requesting computer. The content distribution network coordinates file transfers through a mediation system including a content catalog and a host broker system. The content catalog contains an identification of each content file, the segmented subunits of each file, and the peer caches to which the subunits have been distributed. The host broker system receives content file requests issued over a network from requesting computers. In response, manifest files identifying the request corresponding content subunits and distributed cache locations are returned. The requesting computers can then retrieve and assemble the corresponding content subunits from the peer computers to obtain the requested content file.

Abstract: A multi-source peer content distribution system transfers content files from multiple, distributed peer computers to any requesting computer. The content distribution network coordinates file transfers through a mediation system including a content catalog and a host broker system. The content catalog contains an identification of each content file, the segmented subunits of each file, and the peer caches to which the subunits have been distributed. The host broker system receives content file requests issued over a network from requesting computers. In response, manifest files identifying the request corresponding content subunits and distributed cache locations are returned. The requesting computers can then retrieve and assemble the corresponding content subunits from the peer computers to obtain the requested content file.

Abstract: A multi-source peer content distribution system transfers content files from multiple, distributed peer computers to any requesting computer. The content distribution network coordinates file transfers through a mediation system including a content catalog and a host broker system. The content catalog contains an identification of each content file, the segmented subunits of each file, and the peer caches to which the subunits have been distributed. The host broker system receives content file requests issued over a network from requesting computers. In response, manifest files identifying the request corresponding content subunits and distributed cache locations are returned. The requesting computers can then retrieve and assemble the corresponding content subunits from the peer computers to obtain the requested content file.

Abstract: Methods and systems for parallel computation of an algorithm using a plurality of nodes configured as a Howard Cascade. A home node of a Howard Cascade receives a request from a host system to compute an algorithm identified in the request. The request is distributed to processing nodes of the Howard Cascade in a time sequence order in a manner to minimize the time to so expand the Howard Cascade. The participating nodes then perform the designated portion of the algorithm in parallel. Partial results from each node are agglomerated upstream to higher nodes of the structure and then returned to the host system. The nodes each include a library of stored algorithms accompanied by data template information defining partitioning of the data used in the algorithm among the number of participating nodes.

Abstract: The present invention generally relates to a system and method for using a gas in a well. In one aspect, the system includes a source of fluid and at least one multiphase pump for transporting the fluid. The system further includes a separator for separating phases in the fluid and an injector for injecting the gas into the well. The gas may be used for kicking off a shut-in well by the simultaneous injection of the gas into the shut-in well and the reduction of the wellhead pressure. The gas may also be used for maintaining production of the well, cleaning out the well or lightening the wellbore fluid in riser system. In another aspect, the invention provides a portable multiphase pump system. In yet another aspect, the invention provides a method for recycling gas from a wellbore fluid.