### Table 1: Admission Control Algorithms

### Table 1. Admission control algorithms for multiprocessors

1998

"... In PAGE 6: ... This is because when the number of processors is large, the bin packing algorithm has more freedom to assign compatible tasks to the same processor. The algorithms compared are shown in Table1 . For high loads, the best processor utilization is obtained by EXACT- MP with a FirstFit bin-packing (97%), closely followed by R-BOUND-MP (96%).... In PAGE 6: ...Table 1. Admission control algorithms for multiprocessors Table1 also shows the complexity of the algorithms from the previous section, where m is the number of tasks, p the number of processors and N = Pm i=1bTm Ti c. R-BOUND- MP has a complexity of O(m(p + log m)) explained as fol- lows.... ..."

Cited by 19

### Table 1. Admission control algorithms for multiprocessors

"... In PAGE 6: ... This is because when the number of processors is large, the bin packing algorithm has more freedom to assign compatible tasks to the same processor. The algorithms compared are shown in Table1 . For high loads, the best processor utilization is obtained by EXACT- MP with a FirstFit bin-packing (97%), closely followed by R-BOUND-MP (96%).... In PAGE 6: ...Table 1. Admission control algorithms for multiprocessors Table1 also shows the complexity of the algorithms from the previous section, where m is the number of tasks, p the number of processors and N = P m i=1 b T m T i c. R-BOUND- MP has a complexity of O#28m#28p + log m#29#29 explained as fol- lows.... ..."

### TABLE I THE DISTRIBUTED TOPOLOGY CONTROL ALGORITHM

2003

Cited by 64

### Table 1: Type of congestion control algorithms

2001

Cited by 48

### TABLE I CHARACTERISTICS OF THE CENTRALISED TOPOLOGY CONTROL ALGORITHMS.

2003

Cited by 2

### TABLE II CHARACTERISTICS OF THE DISTRIBUTED TOPOLOGY CONTROL ALGORITHMS.

2003

Cited by 2