نتایج جستجو برای: round robin schesuling algorithm

تعداد نتایج: 800200  

2002
Tae-Jin Lee Yongsuk Kim

We consider differentiated bandwidth allocation for short-range wireless personal communication systems: Bluetooth. Since bandwidth requirements may vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and eff icient bandwidth allocation mec...

Journal: :Indonesian Journal of Electrical Engineering and Informatics (IJEEI) 2019

Journal: :European Journal of Operational Research 2017
Mats Carlsson Mikael Johansson Jeffrey Larson

We propose a tournament format that extends a traditional double round-robin format with divisional single round-robin tournaments. Elitserien, the top Swedish handball league, uses such a format for its league schedule. We introduce a constraint programming model that characterizes the general double round-robin plus divisional single round-robin format. This integrated model allows scheduling...

2010
Parag Jain Sandip Vijay S. C. Gupta

The performance of different ATM switch buffer queuing schemes for round-robin and weighted round-robin didn‘t have too much difference. This paper presents the discrete-event simulation provides detailed, accurate network simulation results and it observed a wide variety of network statistics. The software simulation package, OPNET, which specializes in discrete-event simulation of communicati...

Journal: :Queueing Syst. 2006
Douglas G. Down Rong Wu

We study a system of several identical servers in parallel, where a routing decision must be made immediately on a job’s arrival. Jobs arrive according to a Poisson process, with their processing times following a discrete distribution with finite support. The processing time of a job is known on arrival and may be used in the routing decision. We propose a policy consisting of multi-layered ro...

2002
Johannes Fürnkranz

In this paper we investigate the performance of pairwise (or round robin) classification, originally a technique for turning multi-class problems into two-class problems, as a general ensemble technique. In particular, we show that the use of round robin ensembles will also increase the classification performance of decision tree learners, which could directly handle multi-class problems. The p...

Abstract— High-performance computing and vast storage are two key factors required for executing data-intensive applications. In comparison with traditional distributed systems like data grid, cloud computing provides these factors in a more affordable, scalable and elastic platform. Furthermore, accessing data files is critical for performing such applications. Sometimes accessing data becomes...

Journal: :International Journal of Computer Applications 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید