In this work we study the complexity of Sandpile prediction problems on several classes of directed graphs. We focus our research on low-dimensional directed lattices. We prove some upper and lower bounds for those problems. Our approach is based on the analysis of some reachability problems related to sandpiles.