In many languages, the programmer is provided the capability of communicating, through the use of function calls, with other separate, independent processes. This capability can be as simple as a service request made to the operating system, or more advanced as Tuple Space operations specific to a Linda programming system. The problem with such calls, however, is that they block while waiting for data or information to be returned. This synchronous nature and lack of concurrency can be avoided by initiating the request for data earlier in the code and retrieving the returned data later when it is needed. In order to facilitate this concurrency of processing, an instructional footprint model is developed which formally describes movement of instructions. This paper presents research findings that entail the development of the instructional footprint model, an algorithmic framework in which to exploit concurrency in programming languages, and some preliminary results from applying the instructional footprint model.