Code partitioning

From Wikipedia, the free encyclopedia

This article or section is in need of attention from an expert on the subject.
WikiProject Computer Science or the Computer Science Portal may be able to help recruit one.
If a more appropriate WikiProject or portal exists, please adjust this template accordingly.

Code partitioning is breaking up computer programming code into pieces. Generally, the goal is to run the different pieces of code on different cpu's without altering the original functionality. That can be a co-processor to accelerate certain functions or it can be another processor.

The problem with code partitioning is that one has to ensure that variables that have been declared and used in one part can be accessed in the other. That means that data has to be transported to the other cpu. This, off course, includes data that is randomly accessed or pointed to. This can make it very inefficient.

There are other means to achieve the same goal. One can partition binaries and provide a framework for a global memory space.

Although research has been done, code partitioning is not yet mainstream. All information that I could find was in papers. E.g. [1] .