Compensated algorithms improve the accuracy of a re- sult evaluating a correcting term that compensates the finite precision of the computation. The implementation core of compensated algorithms is the computation of the rounding errors generated by the floating point operators. We focus this operator dependency discussing how to manage and to benefit from floating point arithmetic implemented through a fused multiply and add operator. We consider the com- pensation of dot product and polynomial evaluation with Horner iteration. In each case we provide theoretical a pri- ori error bounds and numerical experiments to exhibit the best algorithmic choices with respect to accuracy or perfor- mance issues.