The graph represents the amount of data to be transferred between the tasks and the amount of time each task requires to complete its execution. The number of processors available, the number oflinks available for each processor, the link capacity, the maximum number of hops allowed for a message to travel, and the paths in the network specify the hardware in the system. A simulated annealing algorithm was incorporated to allocate and schedule the tasks along with the placing of shared memory blocks in the system. The system configuration can be predetermined or can be determined by the optimization program. The model is useful for determining the performance of distributed systems that employ virtual shared memory.
Experiments show the model works well and produces satisfactory results.