An optimal upper bound on the minimal completion time in distributed supercomputing

@inproceedings{Lundberg1994AnOU,
  title={An optimal upper bound on the minimal completion time in distributed supercomputing},
  author={Lars Lundberg and H{\aa}kan Lennerstad},
  booktitle={International Conference on Supercomputing},
  year={1994}
}
We first consider an MIMD multiprocessor configuration with <italic>n</italic> processors. A parallel program, consisting of <italic>n</italic> processes, is executed on this system—one process per processor. The program terminates when all processes are completed. Due to synchronizations, processes may be blocked waiting for events in other processes. Associated with the program is a parallel profile vector <italic>v¯</italic>, index <italic>i</italic> (1≤<italic>i</italic>≤<italic>n</italic… CONTINUE READING