reduced overhead with a static schedule?

https://github.com/invenia/Parallelism.jl/blob/master/src/tmap.jl#L10

That would have quite a bit of overhead. It would be nice to have a static schedule (`@threads`) version for fast running programs, which would then be nice once there's an adjoint definition for the map.

Start at src/tmap.jl around line 10 and inspect the scheduling used by the map implementation. Compare it with Julia's @threads static scheduling and define the intended fast-running-program behavior; done means a static-schedule version exists and supports the stated future adjoint use case.

Written by the indexing model from the issue text.