|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Scheduling tasks with small communication delays for clusters of processorsтезисы доклада
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 8 октября 2025 г.
- Авторы: Bampis E., Giroudeau R., Kononov A.
- Сборник: SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architecture
- Тезисы
- Год издания: 2001
- Издательство: ACM
- Местоположение издательства: New York, N.Y., United States
- Первая страница: 314
- Последняя страница: 315
- DOI: 10.1145/378580.378726
- Аннотация: Until recently, the standard communication model for scheduling the task of a parallel program has been the homogeneous communication model (also known as the delay model) introduced by Rayward-Smith for unit-execution-times, unit-communication times (UET-UTC) precedence graphs. In this model, we have a set of identical processors that are able to communicate in a uniform way. We want to use these processors in order to process a set of tasks that are subject to precedence contraints. Each task has a processing time, and if two adjacent task of the precedence graph are processed by two different processors (resp. the same processors) then a communication delay has to be taken into account explicitly (resp. the communication time is neglected). The problem is to find a trade-off between the two extreme solutions, namely, execute all the tasks sequentially without communications, or try to use all the potential parallelism but in the cost of an increased communication overhead. This model has been extensively studied these last years both from the compexity and the (non)-approximability point of views.
- Добавил в систему: Кононов Александр Вениаминович