On contiguous and non-contiguous parallel task scheduling

@article{Bladek2015OnCA,
  title={On contiguous and non-contiguous parallel task scheduling},
  author={Iwo Bladek and Maciej Drozdowski and Fr{\'e}d{\'e}ric Guinand and Xavier Schepler},
  journal={J. Scheduling},
  year={2015},
  volume={18},
  pages={487-495}
}
In this paper we study differences between contiguous and non-contiguous parallel task schedules. Parallel tasks can be executed on more than one processor simultaneously. In the contiguous schedules indices of the processors assigned to a task must be a sequence of consecutive numbers. In the non-contiguous schedules processor indices may be arbitrary. Nonpreemptive schedules are considered. Given a parallel task instance, optimum contiguous and non-contiguous schedules can be of different… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Scheduling for Parallel Processing

Computer Communications and Networks • 2009
View 3 Excerpts

Communication patterns and allocation strategies

18th International Parallel and Distributed Processing Symposium, 2004. Proceedings. • 2004
View 2 Excerpts

The berth planning problem

Oper. Res. Lett. • 1998

Balancing contention and synchronization on the Intel Paragon

S. H. Bokhari, D. M. Nicol
IEEE Concurrency, • 1997
View 2 Excerpts

Similar Papers

Loading similar papers…