Posets whose all non-empty subsets have an infimum and a supremum inside are exactly the finite totally ordered sets. The name of such a poset is "finite chain".
Indeed, let $(D, \leq)$ be a such poset. First, it is totally ordered: for any $x, y \in D$, consider the subset $\\{ x, y \\}$. Now, since all non-empty subsets have an infimum inside, $(D, \leq)$ is well ordered. In the same way, the dual of $(D, \leq)$ is well ordered. As an exercise, you can check that a well ordered set such that its dual is well ordered is finite.