نتایج جستجو برای: round robin schesuling algorithm
تعداد نتایج: 800200 فیلتر نتایج به سال:
Due to technology and its daily continuous advancing and enhancement the users dealing with it are hungry for the best and better quality of service and this demand never stops, from this point came the idea of my research which aims to enhance the mobile network using the LOAD BALANCE and its algorithm to make it better ,in my research am requiring a HANDOVER process to be involved to get the ...
Virtual Output Queuing is widely used by fixed-length highspeed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative algorithms (such as PIM and iSLIP) use multiple iterations ...
Field-Programmable Gate Arrays (FPGAs) are susceptible to radiation-induced Single Event Upsets (SEUs). A common technique for dealing with SEUs is Triple Modular Redundancy (TMR) combined with Module-based configuration memory Error Recovery (MER). By triplicating components and voting on their outputs, TMR helps localize the configuration memory errors, and by reconfiguring the faulty compone...
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algorithm is attractive because it is easy to implement and robust in its behavior. The theory behind the algorithm shows that, for a broad class of problems, it terminates and produces correct results. The theory also establishes a set of conditions where the algorithm runs in at most d(G) + 3 passes ...
This paper deals with the break minimization problem of sports scheduling. The problem is to find a stadium assignment that minimizes the total number of breaks under a given round-robin tournament schedule. We show that the problem can be formulated as MAX RES CUT and MAX 2SAT. We also apply Goemans and Williamson’s approximation algorithm based on positive semidefinite programming relaxation....
The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. Most pivoting rules are known, however, to need an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior to this work, for Cunningham’s Least Recently Considered rule [5], which belongs to the family of history-based rules. Also known as t...
Bandwidth management over wired bottleneck links has been an effective way to utilize network resources. For the rapidly emerging IEEE 802.11b Wireless LAN (WLAN), the limited WLAN bandwidth becomes a new bottleneck and requires bandwidth management. Most possible existing solutions only exclusively focus on optimizing multimedia traffic, pure downlink or pure uplink fairness, or are incompatib...
In survivable optical networks, wavelength assignment is a major concern than assigning routes to the light path requests. Earlier wavelength assignment algorithm suffers from unbalanced utilization of wavelengths that leads to blocking probability for any connection request. This paper analyzes the performance of the wavelength assignment strategies to reduce the network block rate of the requ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید