In this paper we propose a parallel algorithm for constructing hierarchically semiseparable (HSS) matrices which needs fewer communication times than the algorithm in [Efficient scalable algorithms for hierarchically semiseparable matrices,submitted to SISC,2011].Our algorithm is based on random sampling low-rank approximation and interpolative decomposition (ID).The communication times of our algorithm are independent of the off-diagonal rank.The words communicated are also fewer.