[1] Results of a single-blind round-robin comparison of satellite primary productivity algorithms are presented. The goal of the round-robin exercise was to determine the accuracy of the algorithms in predicting depth-integrated primary production from information amenable to remote sensing. Twelve algorithms, developed by 10 teams, were evaluated by comparing their ability to estimate depth-in...

A mathematical cell delay modeling and performance comparison of two iterative scheduling algorithms for ATM input-queued switch are carried out in this paper. The algorithms under consideration are iterative round robin with multiple classes (IRRM-MC) and iterative round robin with slip (iSLIP). By using Bernoulli arrivals a mathematical model is proposed for both algorithms. The developed mod...

In this paper, we propose a new algorithm, called Dynamic DNS for Load Balancing (DDLB), embedded in DNS (Domain Name Service) servers. By applying our algorithm into a simulation model with real data and comparing its performance with the original round-robin DNS setting, we found that around 40% of the incoming requests had shorter service time and almost no incoming requests got longer servi...

This paper proposes an out-of-sequence (OOS) preventative cell dispatching algorithm, the multicast flow-based round robin (MFRR), for multicast input-queued space-memory-memory (IQ-SMM) Clos-network architecture. Independently treating each incoming cell, such as the desynchronized static round robin (DSRR), can lead to cells of the same packet being disordered after traversing the switch fabr...

High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a...

In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifier for each pair of classes. We present an empirical evaluation of the method, implemented as a wrapper around the Ripper rule learning algorithm, on 20 multi-class datasets from the UCI database repository. Our results...

Round Robin (RR) Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. If the time quantum taken is static then it undergoes degradation of the CPU performance and leads to so many context switches. In this paper, we have proposed a new effective dynamic RR algorithm SMDRR (Subcontrary Mean Dynamic Round Robin) based on dyna...

Some CPU scheduling algorithms such as First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (R-R), Multilevel Queue(MQ) and Multilevel Feedback Queue (MFQ has been elaborated and assessed on the basic CPU scheduling objectives i.e.; average waiting(AWT), average turnaround (ATT)and average response time(ART), average CPU utilization (AU)and average throughput(AT). Thes...

Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum...