Sciweavers

64 search results - page 6 / 13
» Scheduling Algorithms for Input Queued Switches Using Local ...
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
IEICET
2006
77views more  IEICET 2006»
13 years 7 months ago
Efficient Scheduling for SDMG CIOQ Switches
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
Mei Yang, Si-Qing Zheng
INFOCOM
2010
IEEE
13 years 5 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
RTAS
2006
IEEE
14 years 1 months ago
Switch Scheduling and Network Design for Real-Time Systems
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...
Sathish Gopalakrishnan, Marco Caccamo, Lui Sha
TSMC
2011
324views more  TSMC 2011»
13 years 2 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat