Sciweavers

ICPP
1987
IEEE
13 years 8 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
ICN
2005
Springer
13 years 10 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
AICT
2005
IEEE
194views Communications» more  AICT 2005»
13 years 10 months ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer