Abstract: The disclosed technology includes techniques for efficiently streaming media content from a multi-tiered storage system. An example implementation may be used for adaptive HTTP streaming of video segments and other content. In some implementations, flash memory SSDs (SLC or MLC) may form an intermediate cache layer between a first layer of DRAM cache and third layer of HDDs. Significant architectural elements of various implementations include optimal write granularity to overcome the write amplification effect of flash memory SSDs and a QoS-sensitive caching strategy that monitors the activity of the flash memory SSDs to ensure that video streaming performance is not hampered by the caching activity.

Abstract: The disclosed technology includes techniques for efficiently streaming media content from a multi-tiered storage system. An example implementation may be used for adaptive HTTP streaming of video segments and other content. In some implementations, flash memory SSDs (SLC or MLC) may form an intermediate cache layer between a first layer of DRAM cache and third layer of HDDs. Significant architectural elements of various implementations include optimal write granularity to overcome the write amplification effect of flash memory SSDs and a QoS-sensitive caching strategy that monitors the activity of the flash memory SSDs to ensure that video streaming performance is not hampered by the caching activity.

Abstract: An exemplary device comprises a first and second protocol layer, and an information exchange service (IES) in communication with the first and the second protocol layers. The IES is configured to share control information between the protocol layers. A protocol layer is capable of adapting behavior based on the control information shared by the IES. An exemplary method is presented for communicating between publishing and subscribing layers in a protocol stack. The method comprises, in the publishing layer, specifying a selected attribute and an associated value to be shared with the subscribing layer. The method further comprises storing the specified attribute and associated value, and receiving a subscribe request from the requesting layer. The request specifies the published attribute. The method further comprises, in response to the request, providing the associated value to a subscribing layer, and in the subscribing layer, adapting behavior based on the shared control information.

Abstract: An exemplary device comprises a first and second protocol layer, and an information exchange service (IES) in communication with the first and the second protocol layers. The IES is configured to share control information between the protocol layers. A protocol layer is capable of adapting behavior based on the control information shared by the IES. An exemplary method is presented for communicating between publishing and subscribing layers in a protocol stack. The method comprises, in the publishing layer, specifying a selected attribute and an associated value to be shared with the subscribing layer. The method further comprises storing the specified attribute and associated value, and receiving a subscribe request from the requesting layer. The request specifies the published attribute. The method further comprises, in response to the request, providing the associated value to a subscribing layer, and in the subscribing layer, adapting behavior based on the shared control information.

Abstract: The performance of an application is improved by identifying and eliminating items with dead time-stamps and eliminating work on items with irrelevant time-stamps. An algorithm executing in each node of a task graph computes and propagates guarantees which are used to eliminate both items with dead time-stamps and irrelevant computation on dead time-stamps. A continuous garbage collector eliminates items with dead time-stamps while the node continues to process received items. Unnecessary computations are reduced by automatically discerning the interest set of downstream modules for time-stamps and feeding the interest set back to upstream modules.

Abstract: The performance of an application is improved by identifying and eliminating items with dead time-stamps and eliminating work on items with irrelevant time-stamps. An algorithm executing in each node of a task graph computes and propagates guarantees which are used to eliminate both items with dead time-stamps and irrelevant computation on dead time-stamps. A continuous garbage collector eliminates items with dead time-stamps while the node continues to process received items. Unnecessary computations are reduced by automatically discerning the interest set of downstream modules for time-stamps and feeding the interest set back to upstream modules.

Abstract: A system for learning and applying a task and data parallel strategy to an application that includes at least one task for processing an input data stream to produce an output data stream includes the following components. A controller measuring an execution of the application to generate an action space representing a task and data parallel strategy. A run-time system applying the action space to implement the task and data parallel strategy.

Abstract: A system for integrating task and data parallelism in a dynamic application that includes at least one task for processing an input data stream to produce an output data stream replaces the at least one task with the following components. A splitter task for partitioning the input data stream into a plurality of data chunks. A plurality of worker tasks for processing subsets of the data chunks, each worker task being an instance of the at least one task, and a joiner task combining the processed data chunks to produce the output data stream.

Abstract: A system for learning and applying a task and data parallel strategy to an application that includes at least one task for processing an input data stream to produce an output data stream includes the following components. A controller measuring an execution of the application to generate an action space representing a task and data paralell strategy. A run-time system applying the action space to implement the task and data prallel strategy.

Abstract: A system for integrating task and data parallelism in a dynamic application that includes at least one task for processing an input data stream to produce an output data stream replaces the at least one task with the following components. A splitter task for partitioning the input data stream into a plurality of data chunks. A plurality of worker tasks for processing subsets of the data chunks, each worker task being an instance of the at least one task, and a joiner task combining the processed data chunks to produce the output data stream.

Abstract: In a computer system, a memory is allocated to a plurality of ports. The ports are arranged in a spatial ordering. A plurality of various sized data items are temporally ordered in each of the plurality of ports. Each data item includes a time-stamp to indicate the temporal ordering of the plurality of data items. The plurality of data items are atomically accessed by a plurality of threads using space and time coordinates. The space and time coordinates uniquely identify each of the plurality of data items.