Pairings have found many cryptographic applications in recent years. The efficiency of implementing these cryptographic applications is determined by the speed of pairing computations. This paper categorizes and reviews the current progress on efficient pairing computations, and suggests the possibility of further research.