While the FA-BSP model provides significant performance improvements in large-scale graph applications, its single-threaded execution model may limit the performance of certain graph applications. This paper explores the potential benefits of enabling user-level asynchronous tasking with async and finish in FA-BSP programs using distributed triangle counting. The initial results from a generic HPC cluster show that a version using asynchronous tasking leads to a performance increase of 3% to 32%.