Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Round-robin scheduling

Related publications (31)

Packet Scheduling in Multicamera Capture Systems

Pascal Frossard, Laura Toni, Thomas Maugey

In multiview video services, multiple cameras acquire the same scene from different perspectives, which results in correlated video streams. This generates large amounts of highly redundant data, which need to be properly handled during encoding and transm ...

2014

An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem

Jingmin Chen, Jianghang Chen

The quay crane scheduling problem plays an important role in the paradigm of port container terminal management, due to the fact that it closely relates to vessel berthing time. In this paper, we focus on the study of a special strategy for the cluster-bas ...

Elsevier Science Bv2014

Decentralized list scheduling

Nicolas Gabriel Gast

Classical list scheduling is a very popular and efficient technique for scheduling jobs for parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list ...

2013

Adaptive Multiview Video Streaming: Challenges and Opportunities

Delivering multiview video content over present packet networks poses multiple challenges. First, the best effort nature of the Internet exposes media packets to variable bandwidth, loss, and delay as they traverse the network. Second, the prediction depen ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Multi-path content delivery: Efficiency analysis and optimization algorithms

The paper studies the benefits of multi-path content delivery from a rate-distortion efficiency perspective. We develop an optimization framework for computing transmission schedules for streaming media packets over multiple network paths that maximize the ...

Academic Press Inc Elsevier Science2012

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

In-Network Packet Scheduling and Rate Allocation: A Content Delivery Perspective

We investigate two important problems in media delivery via active network agents. First, we consider streaming multiple video assets over a shared backbone network through an intermediate proxy-server to a set of receiving clients. The proxy is located at ...

2011

Greedy Scheduling for Distributed Computing Clusters

Milan Vojnovic, Amin Karbasi

Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a looku ...

2011

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

Exploiting the Path Propagation Time in Multipath Transmission with FEC

We consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet. An effective and wel ...

2009

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

Thomas Rothvoss

This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm. The quantitative metric used in this comparison is the processor speedup factor, equivalent to the factor by ...

2009

Related publications (31)