Creating a one-to-one mapping between a N-length list and M workers?
Sure.  Give the $i$th worker the range of items at indices from $\lfloor Ni/M \rfloor$ to $\lfloor N(i+1)/M \rfloor - 1$.

Here I assume indices range from $0$ to $N-1$, and workers are indexed by $i$, where $i$ ranges from $0$ to $M-1$.  Also, the notation $\lfloor x \rfloor$ represents the result of rounding $x$ down to the nearest integer.

This ensures that there are no overlaps, and the list is split evenly among the workers (as evenly as possible: each worker receives either $\lfloor N/M \rfloor$ items or $\lfloor N/M \rfloor + 1$ items).