Parallel algorithm and complexity results for telephone link simulation
Vijaya Ramachandran, Li-C. Wang · 2002
The telephone connection problem (TCP) is the problem of simulating a telephone link of fixed capacity to assess its ability to serve incoming calls. This simulation is performed on a large number of sample calls at AT&T Bell Laboratories. In order to speed up the simulation, it is desirable to obtain good parallel algorithms for the problem. The authors give an O(k log n) time parallel on an EREW PRAM for the TCP using n processors, where k is the capacity of the telephone line and n is the number of calls. Then, they improve the algorithm to run in O(min( square root n,k)log n) time on an EREW PRAM using n processors. Finally, they prove that the TCP is a CC-complete problem.>