公开(公告)号：WO2008118186A1

公开(公告)日：2008-10-02

申请号：PCT/US2007/077716

申请日：2007-09-06

Applicant: ZATTOO INC. ,  JAMIN, Sugih ,  WANG, Wenjie ,  WANG, Zhiheng ,  CHANG, Hyunseok

Inventor： JAMIN, Sugih ,  WANG, Wenjie ,  WANG, Zhiheng ,  CHANG, Hyunseok

IPC: G06F17/00

CPC classification number: H04L67/104 ,  H04L65/4084 ,  H04L65/605 ,  H04N7/17318 ,  H04N21/2187 ,  H04N21/25875 ,  H04N21/4788 ,  H04N21/6125 ,  H04N21/6175 ,  H04N21/632

Abstract: Media is partitioned into k recurring frames or packets. Recurring frames of the same position 1 to k collectively define k media substreams which may be communicated from sending computers to a receiving computer over a computer network pursuant to a substream mask. The substream mask is defined by the receiving computer. Received substreams may be communicated to subsequent computers, and/or buffered for reassembly and playback at the receiving computer. Network node lists for substream and packet mask negotiation may be communicated to the receiving computer by sending computers or a rendezvous host.

Abstract translation: 媒体被分为k个循环帧或数据包。 相同位置1至k的重复帧共同地定义可以根据子流掩码通过计算机网络从发送计算机传送到接收计算机的k个媒体子流。 子流掩码由接收计算机定义。 接收的子流可以被传送到后续的计算机，和/或被缓存以用于在接收计算机上进行重组和重放。 用于子流和分组掩码协商的网络节点列表可以通过发送计算机或会合主机来传送到接收计算机。

公开(公告)号：WO2012151054A1

公开(公告)日：2012-11-08

申请号：PCT/US2012/034191

申请日：2012-04-19

Applicant: ALCATEL LUCENT ,  MUKHERJEE, Sarit ,  CHANG, Hyunseok ,  LEE, Myung, Jin ,  KODIALAM, Muralidharan, Sampath ,  LAKSHMAN, Tirunell, V.

Inventor： MUKHERJEE, Sarit ,  CHANG, Hyunseok ,  LEE, Myung, Jin ,  KODIALAM, Muralidharan, Sampath ,  LAKSHMAN, Tirunell, V.

IPC: G06F9/48

CPC classification number: G06F9/4881

Abstract: A method and system for scheduling tasks is provided. A plurality of lower bound completion times is determined, using one or more computer processors and memory, for each of a plurality of jobs, each of the plurality of jobs including a respective subset plurality of tasks. A task schedule is determined for each of the plurality of processors based on the lower bound completion times.

Abstract translation: 提供了一种调度任务的方法和系统。 对于多个作业中的每一个，使用一个或多个计算机处理器和存储器来确定多个下限完成时间，所述多个作业中的每个作业包括相应的子集多个任务。 基于下限完成时间为多个处理器中的每一个确定任务调度。