logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Minimizing the overhead for some tree-scheduling problems

delete1996-10-01
delete0
PRE
AI
E
Evripidis Bampis *
F
Frédéric Guinand
D
Denis Trystram
DOI：10.1016/0377-2217(96)00125-7delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper is devoted to the study of tree-scheduling problems within the execution model described by Anderson, Beame and Ruzzo. We first prove the NP-completeness of the problem of minimizing the overhead for scheduling trees on m processors, and then we propose an algorithm that provides optimal schedules when complete trees are considered.
Keywords:
overhead
scheduling
communications
trees

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available