The concept of processor sharing introduces a heuristics to prevent long jobs from blocking short jobs in queue. In practice, round-robin has to be used. In the literature, it is generally assumed that newly arrived jobs are put at the end of the queue. However, for highly varying job demands, such an approach may perform poorly. By favoring newly arrived jobs, which are more likely to be short...

In this paper we present a new and extremely competitive approach to solving a notoriously hard problem from the sports scheduling domain, the round robin problem. By combining local search satisfiability algorithms and an appropriate problem encoding based on classical propositional logic, we are able to find feasible schedules many times faster than using the best existing approaches to the r...

A scheduling algorithm is proposed for lightweight on-chip crossbar switch in on-chip networks. The proposed NA-MOO algorithm distributes the arbitration computing over all of the crossbar fabric nodes. Its implementation shows that it can reduce > 60% area and > 20% computation delay compared to conventional round robin based SLIP algorithm. Its feasibility is analyzed by using a SoC for HDTV ...

Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service it offers over a longer range at the MAC level. In our work, we propose two credit based scheduling schemes one in which completed flows distributes the left over credits equally to all higher...

The problem of ranking players in a round-robin tournament, in which outcome of any match is a win or a loss, is to rank players according to their performances in the tournament. In this paper we have improved previously developed MST (Majority Spanning Tree) algorithm for solving this problem, where the number of violations has been chosen as the criterion of optimality. We have compared the ...

| This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that prov...

This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without place constraints are considered. The algorithm uses Benders cuts to obtain feasible homeaway pattern sets in few iterations and this approach leads to significant reductions in computation time for hard instances. Fu...

A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in inputqueued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better packet latency and similar cell la...

MapReduce is a kind of software framework for easily writing applications which process vast amounts of data on large clusters of commodity hardware. In order to get better allocation of tasks and load balancing, the MapReduce work mode and task scheduling algorithm of Hadoop platform is analyzed in this paper. According to this situation that the number of tasks of the smaller weight job is mo...

In this paper, we propose a multi-branch neural network architecture named Coupled Modular Neural Network (CMNN). A CMNN is consisting of ? closely coupled sub-networks, where termed as the branching factor in paper. We call whole super-graph and each sub-network sub-graph. Each sub-graph stand-alone shares common block with other sub-graphs. To effectively leverage simple but easy-to-implement...