Message Scheduling on Trees under a Generalized Line-Communication Model


In this paper, we generalize the line-communication model by relaxing the notion of conflictness between paths. We show that the problem of finding optimal schedules to route any set of messages under both our generalized linecommunication model and the bufferless routing model is NP-hard even if restricted to binary trees. Finally, a simple offline 2… (More)
DOI: 10.1109/ISPAN.1999.778910


4 Figures and Tables

Slides referencing similar topics