We show that if a planar graph has a simple cycle of length $k$, where $k$ is a fixed integer, such a cycle may be computed in $\O$$(\log n \log^* n)$ expected time by a randomized EREW-PRAM with $\O$$(n)$ processors.