We consider the online scheduling problem of minimizing total weighted flow time plus energy on a processor that can scale its speed dynamically between 0 and some maximum speed T . In the past few years this problem has been studied extensively under the clairvoyant setting, which requires the size of a job to be known when it is released [1, 4, 5, 8, 12, 15, 16, 17]. For the non-clairvoyant s...

Kropf 7] has collected together a number of problems that can be used as benchmarks for hardware veriication, one of which is a bus arbiter. The function of the bus arbiter is to assign the use of a shared resource on each clock cycle to one out of N subsystems that may want to use it, and in such a way that no subsystem is denied access forever. The most signiicant component in its implementat...

This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the area has been modified over time and today it is highly inconsistent. By presenting a coherent explanation of the various notions we hope that this paper will help to obtain a unified terminology. Furthermore, we outline the contributions presented during the last 30...

We propose a polynomial-time algorithm to find an equitable home–away assignment for a given timetable of a round-robin tournament. Our results give an answer to a problem raised by Elf et al. (Oper. Res. Lett. 31 (2003) 343), which concerns the computational complexity of the break minimization problem in sports timetabling. © 2004 Elsevier B.V. All rights reserved.

In this paper, previously performed UMTS studies have been extended to enhanced UMTS, and combined with several scheduling algorithms (ref. [1,2]). Scheduling algorithms for W-CDMA systems ranging from C/I based scheduling to Round-Robin scheduling are presented and discussed. We also include a trade-off between these two extreme methods of scheduling: Fair channel-dependent scheduling. All the...

Active routers allow computation to be performed within the network by processing packets when they pass through the routers. We design and implement a cluster-based active router system that provides multimedia stream transcoding service. The performance of the system is evaluated with three different load balancing schemes. We evaluate the out-of-order phenomenon and analyze the tradeoff betw...

The Virtual Output Queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The Dual Round-Robin Matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed...

In this paper, we investigate energy-efficient job dispatching algorithm for transcoding as a service (TaaS) in a multimedia cloud. We aim to minimize the energy consumption of service engines in the cloud while achieving low delay for TaaS. We formulate the job dispatching problem as a constrained optimization problem under the framework of Lyapunov optimization. Using the drift-plus-penalty f...