Tadanori Nakagawa

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
This paper proposes two techniques for obtaining a sharp lower bound for the multiprocessor scheduling problem (MSP) with non-negligible communication delay. In the proposed techniques, we apply the notion of inevitable communication delay to obtain a nontrivial lower bound on the scheduling length. The effectiveness of the derived bound is evaluated by(More)
  • 1