Let u and ${upsilon}$ be any two vertices of a graph G and k be a positive integer. A vertex disjoint k-path cover between u and ${upsilon}$ is a set of k vertex disjoint paths between u and ${upsilon}$ such that these paths contain all vertices of G and there do not exist common vertices except u and ${upsilon}$ in these paths. A graph G is called one-to-one k-path coverable if for any two vertices u and ${upsilon}$, there is a vertex disjoint k-path cover between u and ${upsilon}$. It is known that in the bipartite graph G with 3 or more connectivity, there is no vertex disjoint k-path cover between two vertices which belong to the same bipartite set for any $3{leq}k{leq}{kappa}(G)$ where ${kappa}(G)$ is connectivity of G. In this paper, we study k-path coverability of the torus which is one of the well known interconnection networks. The non-bipartite $d({geq}2)$-dimensional torus G is shown to be one-to-one k-path coverable for any $1{leq}k{leq}{kappa}(G)$ where ${kappa}(G)=2d$.